TY - JOUR

T1 - Observability transitions in correlated networks

AU - Hasegawa, Takehisa

AU - Takaguchi, Taro

AU - Masuda, Naoki

PY - 2013/10/14

Y1 - 2013/10/14

N2 - Yang, Wang, and Motter 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.

AB - Yang, Wang, and Motter 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.

UR - http://www.scopus.com/inward/record.url?scp=84886032458&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886032458&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.88.042809

DO - 10.1103/PhysRevE.88.042809

M3 - Article

AN - SCOPUS:84886032458

VL - 88

JO - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

JF - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

SN - 1063-651X

IS - 4

M1 - 042809

ER -