Dynamical complexity as a proxy for the network degree distribution.

Dynamical complexity as a proxy for the network degree distribution.
复制标题

动态复杂性作为网络度分布的代理。

DOI:
10.1103/physreve.99.012310
复制
发表时间:
2018
期刊:
Physical review. E
影响因子:
--
通讯作者:
I. Sendiña
I. Sendiña
中科院分区:
--
文献类型:
--
作者:
A. Tlaie;Inmaculada Leyva;R. Sevilla;V. Vera;I. Sendiña

文献摘要

参考文献

被引文献

相似文献

我们探索了复杂网络中节点的拓扑相关性与它所表现出的个体动态之间的关系。当系统是弱耦合时,耦合强度对节点动态复杂性的影响是节点拓扑角色的函数,节点的复杂程度越高,节点的复杂程度越低。我们提供了混沌振荡器、脉冲耦合神经元和非线性电子电路实验网络的理论模型的几个例子来证明这种分层行为。重要的是,我们的结果表明,仅从单个动态测量就可以推断出网络的度分布。
We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the nodes is found to be a function of their topological roles, with nodes of higher degree displaying lower levels of complexity. We provide several examples of theoretical models of chaotic oscillators, pulse-coupled neurons, and experimental networks of nonlinear electronic circuits evidencing such a hierarchical behavior. Importantly, our results imply that it is possible to infer the degree distribution of a network only from individual dynamical measurements.
DOI: 10.1126/science.44.1129.244
发表时间: --
期刊: Science
影响因子: 56.9
作者:
V. Gates;.. M. L. Ludwig-M.-L.-Ludwig-2273875465;J. A. Hartsuck;T. A. Steitz;H. Muirhead;J. C. Coppola;G. N. Reeke
通讯作者: V. Gates;.. M. L. Ludwig-M.-L.-Ludwig-2273875465;J. A. Hartsuck;T. A. Steitz;H. Muirhead;J. C. Coppola;G. N. Reeke