Observability transitions in correlated networks
arXiv:1309.1862 · doi:10.1103/PhysRevE.88.042809
Abstract
Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)] analyzed a model for network observability transitions in which a sensor placed on a node makes the node and the adjacent nodes observable. The size of the connected components comprising the observable nodes is a major concern of the model. We analyze this model in random heterogeneous networks with degree correlation. With numerical simulations and analytical arguments based on generating functions, we find that negative degree correlation makes networks more observable. This result holds true both when the sensors are placed on nodes one by one in a random order and when hubs preferentially receive the sensors. Finally, we numerically optimize networks with a fixed degree sequence with respect to the size of the largest observable component. Optimized networks have negative degree correlation induced by the resulting hub-repulsive structure; the largest hubs are rarely connected to each other, in contrast to the rich-club phenomenon of networks.
14 pages, 5 figures
References in corpus (13)
- Critical phenomena in complex networks
- Mitigation of Malicious Attacks on Networks
- The Rich-Club Phenomenon In The Internet Topology
- Classes of complex networks defined by role-to-role connectivity profiles
- Fractal and Transfractal Recursive Scale-Free Nets
- Percolation on correlated networks
- Chaperones as integrators of cellular networks: Changes of cellular integrity in stress and diseases
- Percolation transition in networks with degree-degree correlation
- Network Observability Transitions
- Generation of arbitrarily two-point correlated random networks
- Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
- Scale-free networks with a large- to hypersmall-world transition
- Robustness of correlated networks against propagating attacks
Cited by in corpus (7)
- Percolation on complex networks: Theory and application
- Statistical Mechanics of the Minimum Dominating Set Problem
- Coexistence of phases and the observability of random graphs
- Sufficient conditions of endemic threshold on metapopulation networks
- Observability transition in real networks
- Observability transitions in clustered networks
- Observability of dynamical networks from graphic and symbolic approaches