A breakthrough in estimating the size of a (mostly hidden) network

Phys.org  April 22, 2020
For homogeneous networks accessing a mere 10% of the units could be sufficient to exactly infer the size of the entire network. But the same approach fails for heterogeneous networks, which are far more common in the field of complex systems. Researchers at New York University present a model-free approach to address this problem by studying the rank of a detection matrix that collates sampled time series of perceptible nodes from independent experiments. They unveil a connection between the rank of the detection matrix and the control-theoretic notion of observability. With this information it is to conclude when and how it is feasible to exactly infer the size of a network dynamical system…read more. TECHNICAL ARTICLE

Social network diagram. Credit: Daniel Tenerife/Wikipedia

Posted in Homogeneous networks and tagged , .

Leave a Reply