大脑功能和结构网络的可控性

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Complexity Pub Date : 2024-09-18 DOI:10.1155/2024/7402894
Ali Moradi Amani, Amirhessam Tahmassebi, Andreas Stadlbauer, Uwe Meyer-Baese, Vincent Noblet, Frederic Blanc, Hagen Malberg, Anke Meyer-Baese
{"title":"大脑功能和结构网络的可控性","authors":"Ali Moradi Amani,&nbsp;Amirhessam Tahmassebi,&nbsp;Andreas Stadlbauer,&nbsp;Uwe Meyer-Baese,&nbsp;Vincent Noblet,&nbsp;Frederic Blanc,&nbsp;Hagen Malberg,&nbsp;Anke Meyer-Baese","doi":"10.1155/2024/7402894","DOIUrl":null,"url":null,"abstract":"<div>\n <p>Normal and aberrant cognitive functions are the result of the dynamic interplay between large-scale neural circuits. Describing the nature of these interactions has been a challenging task yet important for neurodegenerative disease evolution. Fusing modern dynamic graph network theory techniques and control theory applied on complex brain networks creates a new framework for neurodegenerative disease research by determining disease evolution at the subject level, facilitating a predictive treatment response and revealing key mechanisms responsible for disease alterations. It has been shown that two types of controllability—the average and the modal controllability—are relevant for the mechanistic explanation of how the brain navigates between cognitive states. The average controllability favors highly connected areas which move the brain to easily reachable states, while the modal controllability favors weakly connected areas representative for difficult-to-reach states. We propose two different techniques to achieve these two types of controllability: a centrality measure based on a sensitivity analysis of the Laplacian matrix is employed to determine the average controllability, while graph distances form the basis of the modal controllability. The concepts of “choosing the best driver set” and “graph distances” are applied to measure the average controllability and the modal controllability, respectively. Based on these new techniques, we obtain important disease descriptors that visualize alterations in the disease trajectory by revealing densely connected hubs or sparser areas. Our results suggest that these two techniques can accurately describe the different node roles in controlling trajectories of brain networks.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2024 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7402894","citationCount":"0","resultStr":"{\"title\":\"Controllability of Functional and Structural Brain Networks\",\"authors\":\"Ali Moradi Amani,&nbsp;Amirhessam Tahmassebi,&nbsp;Andreas Stadlbauer,&nbsp;Uwe Meyer-Baese,&nbsp;Vincent Noblet,&nbsp;Frederic Blanc,&nbsp;Hagen Malberg,&nbsp;Anke Meyer-Baese\",\"doi\":\"10.1155/2024/7402894\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>Normal and aberrant cognitive functions are the result of the dynamic interplay between large-scale neural circuits. Describing the nature of these interactions has been a challenging task yet important for neurodegenerative disease evolution. Fusing modern dynamic graph network theory techniques and control theory applied on complex brain networks creates a new framework for neurodegenerative disease research by determining disease evolution at the subject level, facilitating a predictive treatment response and revealing key mechanisms responsible for disease alterations. It has been shown that two types of controllability—the average and the modal controllability—are relevant for the mechanistic explanation of how the brain navigates between cognitive states. The average controllability favors highly connected areas which move the brain to easily reachable states, while the modal controllability favors weakly connected areas representative for difficult-to-reach states. We propose two different techniques to achieve these two types of controllability: a centrality measure based on a sensitivity analysis of the Laplacian matrix is employed to determine the average controllability, while graph distances form the basis of the modal controllability. The concepts of “choosing the best driver set” and “graph distances” are applied to measure the average controllability and the modal controllability, respectively. Based on these new techniques, we obtain important disease descriptors that visualize alterations in the disease trajectory by revealing densely connected hubs or sparser areas. Our results suggest that these two techniques can accurately describe the different node roles in controlling trajectories of brain networks.</p>\\n </div>\",\"PeriodicalId\":50653,\"journal\":{\"name\":\"Complexity\",\"volume\":\"2024 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7402894\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complexity\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/2024/7402894\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2024/7402894","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

正常和异常的认知功能是大规模神经回路之间动态相互作用的结果。描述这些相互作用的性质一直是一项具有挑战性的任务,但对于神经退行性疾病的演变却非常重要。将现代动态图网络理论技术与应用于复杂大脑网络的控制理论相融合,通过确定主体层面的疾病演变、促进预测性治疗反应和揭示导致疾病改变的关键机制,为神经退行性疾病研究创建了一个新框架。研究表明,两种可控性--平均可控性和模态可控性--与大脑如何在认知状态之间导航的机理解释相关。平均可控性有利于高连接区域,使大脑进入容易达到的状态,而模态可控性则有利于弱连接区域,使大脑进入难以达到的状态。我们提出了两种不同的技术来实现这两种可控性:基于拉普拉斯矩阵敏感性分析的中心度量被用来确定平均可控性,而图距离则是模态可控性的基础。选择最佳驱动集 "和 "图距离 "的概念分别用于测量平均可控性和模态可控性。基于这些新技术,我们获得了重要的疾病描述符,通过揭示连接密集的枢纽或稀疏的区域,直观地显示疾病轨迹的变化。我们的研究结果表明,这两种技术可以准确描述大脑网络控制轨迹中不同节点的作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Controllability of Functional and Structural Brain Networks

Normal and aberrant cognitive functions are the result of the dynamic interplay between large-scale neural circuits. Describing the nature of these interactions has been a challenging task yet important for neurodegenerative disease evolution. Fusing modern dynamic graph network theory techniques and control theory applied on complex brain networks creates a new framework for neurodegenerative disease research by determining disease evolution at the subject level, facilitating a predictive treatment response and revealing key mechanisms responsible for disease alterations. It has been shown that two types of controllability—the average and the modal controllability—are relevant for the mechanistic explanation of how the brain navigates between cognitive states. The average controllability favors highly connected areas which move the brain to easily reachable states, while the modal controllability favors weakly connected areas representative for difficult-to-reach states. We propose two different techniques to achieve these two types of controllability: a centrality measure based on a sensitivity analysis of the Laplacian matrix is employed to determine the average controllability, while graph distances form the basis of the modal controllability. The concepts of “choosing the best driver set” and “graph distances” are applied to measure the average controllability and the modal controllability, respectively. Based on these new techniques, we obtain important disease descriptors that visualize alterations in the disease trajectory by revealing densely connected hubs or sparser areas. Our results suggest that these two techniques can accurately describe the different node roles in controlling trajectories of brain networks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
期刊最新文献
Transfer Payments and Regional Total Factor Productivity: Evidence From China Quantification of the Synergistic Inhibitory Effects of an Oncolytic Herpes Virus Plus Paclitaxel on Anaplastic Thyroid Cancer Cells Performance Evaluation of Control Strategies for Autonomous Quadrotors: A Review Chaotic Image Encryption Scheme Based on Improved Z-Order Curve, Modified Josephus Problem, and RNA Operations: An Experimental Li-Fi Approach Finite-Time Boundedness of Conformable Faulty Fuzzy Systems With Time Delay
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1