Observability transitions in clustered networks

Abstract

We investigate the effect of clustering on network observability transitions. In the observability model introduced by Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)], a given fraction of nodes are chosen randomly, and they and those neighbors are considered to be observable, while the other nodes are unobservable. For the observability model on random clustered networks, we derive the normalized sizes of the largest observable component (LOC) and largest unobservable component (LUC). Considering the case where the numbers of edges and triangles of each node are given by the Poisson distribution, we find that both LOC and LUC are affected by the network's clustering: more highly-clustered networks have lower critical node fractions for forming macroscopic LOC and LUC, but this effect is small, becoming almost negligible unless the average degree is small. We also evaluate bounds for these critical points to confirm clustering's weak or negligible effect on the network observability transition. The accuracy of our analytical treatment is confirmed by Monte Carlo simulations.

arXiv comment12 pages, 6 figures

References in corpus (31)

• Emergence of scaling in random networks
• Statistical physics of social dynamics
• Epidemic processes in complex networks
• Critical phenomena in complex networks
• Growing Scale-Free Networks with Tunable Clustering
• Random graphs with clustering
• Properties of highly clustered networks
• Highly clustered scale-free networks
• Percolation and Epidemic Thresholds in Clustered Networks
• Tuning clustering in random networks with arbitrary degree distributions
• How clustering affects the bond percolation threshold in complex networks
• Clustering and Synchronization of Oscillator Networks
• Cascades on a class of clustered random networks
• Bond percolation on a class of clustered random networks
• Random Networks with Tunable Degree Distribution and Clustering
• Network Observability Transitions
• Statistical Mechanics of the Minimum Dominating Set Problem
• The synchronizability of highly clustered scale-free networks
• Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks
• Suppressing epidemics on networks by exploiting observer nodes
• Random graphs with arbitrary clustering and their applications
• Efficiency of prompt quarantine measures on a susceptible-infected-removed model in networks
• Dominating Scale-Free Networks Using Generalized Probabilistic Methods
• Observability transitions in correlated networks
• Two-pathogen model with competition on clustered networks
• Structure of percolating clusters in random clustered networks
• Percolation in random graphs with higher-order clustering
• Cooperative coinfection dynamics on clustered networks
• Coexistence of phases and the observability of random graphs
• Observability transition in real networks
• Observability transition in multiplex networks

Cited by in corpus (3)

• Degree correlations in graphs with clique clustering
• Belief propagation on networks with cliques and chordless cycles
• Symbiotic and antagonistic disease dynamics on networks using bond percolatio