Pajevic Sinisa, Plenz Dietmar
Division of Computational Bioscience, Mathematical and Statistical Computing Laboratory, Center for Information Technology, National Institutes of Health, Bethesda, Maryland, United States of America.
PLoS Comput Biol. 2009 Jan;5(1):e1000271. doi: 10.1371/journal.pcbi.1000271. Epub 2009 Jan 30.
Cascading activity is commonly found in complex systems with directed interactions such as metabolic networks, neuronal networks, or disease spreading in social networks. Substantial insight into a system's organization can be obtained by reconstructing the underlying functional network architecture from the observed activity cascades. Here we focus on Bayesian approaches and reduce their computational demands by introducing the Iterative Bayesian (IB) and Posterior Weighted Averaging (PWA) methods. We introduce a special case of PWA, cast in nonparametric form, which we call the normalized count (NC) algorithm. NC efficiently reconstructs random and small-world functional network topologies and architectures from subcritical, critical, and supercritical cascading dynamics and yields significant improvements over commonly used correlation methods. With experimental data, NC identified a functional and structural small-world topology and its corresponding traffic in cortical networks with neuronal avalanche dynamics.
级联活动常见于具有定向相互作用的复杂系统中,如代谢网络、神经网络或社交网络中的疾病传播。通过从观察到的活动级联中重建潜在的功能网络架构,可以深入了解系统的组织。在这里,我们专注于贝叶斯方法,并通过引入迭代贝叶斯(IB)和后验加权平均(PWA)方法来降低其计算需求。我们引入了PWA的一种特殊情况,以非参数形式表示,我们称之为归一化计数(NC)算法。NC能有效地从亚临界、临界和超临界级联动力学中重建随机和小世界功能网络拓扑及架构,并且比常用的相关方法有显著改进。利用实验数据,NC识别出了具有神经元雪崩动力学的皮质网络中的功能和结构小世界拓扑及其相应的信息流。