Observability transitions in correlated networks

Observability analysis and state reconstruction for networks of nonlinear systems

We address the problem of retrieving the full state of a network of Rössler systems from the knowledge of the actual state of a limited set of nodes. The selection of nodes where sensors are placed is carried out in a hierarchical way through a procedure based on graphical and symbolic observability approaches applied to pairs of coupled dynamical systems. By using a map directly obtained from governing equations, we design a nonlinear network reconstructor that is able to unfold the state of non-measured nodes with working accuracy. For sparse networks, the number of sensor scales with half the network size and node reconstruction errors are lower in networks with heterogeneous degree distributions. The method performs well even in the presence of parameter mismatch and non-coherent dynamics and for dynamical systems with completely different algebraic structures like the Hindmarsch-Rose; therefore, we expect it to be useful for designing robust network control laws.

Observability transition in real networks

We consider the observability model in networks with arbitrary topologies. We introduce a system of coupled nonlinear equations, valid under the locally treelike ansatz, to describe the size of the largest observable cluster as a function of the fraction of directly observable nodes present in the network. We perform a systematic analysis on 95 real-world graphs and compare our theoretical predictions with numerical simulations of the observability model. Our method provides almost perfect predictions in the majority of the cases, even for networks with very large values of the clustering coefficient. Potential applications of our theory include the development of efficient and scalable algorithms for real-time surveillance of social networks, and monitoring of technological networks.

Analysis of the Effect of Degree Correlation on the Size of Minimum Dominating Sets in Complex Networks

Network controllability is an important topic in wide-ranging research fields. However, the relationship between controllability and network structure is poorly understood, although degree heterogeneity is known to determine the controllability. We focus on the size of a minimum dominating set (MDS), a measure of network controllability, and investigate the effect of degree-degree correlation, which is universally observed in real-world networks, on the size of an MDS. We show that disassortativity or negative degree-degree correlation reduces the size of an MDS using analytical treatments and numerical simulation, whereas positive correlations hardly affect the size of an MDS. This result suggests that disassortativity enhances network controllability. Furthermore, apart from the controllability issue, the developed techniques provide new ways of analyzing complex networks with degree-degree correlations.

Observability Transitions in Networks with Betweenness Preference

A network is considered observable if its current state can be determined in finite time from knowledge of the observed states. The observability transitions in networks based on random or degree-correlated sensor placement have recently been studied. However, these placement strategies are predominantly based on local information regarding the network. In this paper, to understand the phase transition process of network observability, we analyze the network observability transition for a betweenness-based sensor placement strategy, in which sensors are placed on nodes according to their betweenness. Using numerical simulations, we compute the size of the network’s largest observable component (LOC) and compare the observability transitions for different sensor placements. We find that betweenness-based sensor placement can generate a larger LOC in the observability transition than the random or degree-based placement strategy in both model and real networks. This finding may help to understand the relationship between network observability and the topological properties of the network.

Sufficient conditions of endemic threshold on metapopulation networks

In this paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks, where nodes represent subpopulations, and where agents diffuse and interact. Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, a fundamental quantity governing the epidemic dynamics. We consider the general case in which the infection rate at each node depends on its population size, as shown in recent empirical observations. We first prove that a sufficient condition for the endemic threshold (i.e., its upper bound), previously derived based on a mean-field approximation of network structure, also holds true for arbitrary networks. We also derive an improved condition showing that networks with the rich-club property (i.e., high connectivity between nodes with a large number of links) are more prone to disease spreading. The dependency of infection rate on population size introduces a considerable difference between this upper bound and estimates based on mean-field approximations, even when degree-degree correlations are considered. We verify the theoretical results with numerical simulations.

Robustness of oscillatory behavior in correlated networks

Understanding network robustness against failures of network units is useful for preventing large-scale breakdowns and damages in real-world networked systems. The tolerance of networked systems whose functions are maintained by collective dynamical behavior of the network units has recently been analyzed in the framework called dynamical robustness of complex networks. The effect of network structure on the dynamical robustness has been examined with various types of network topology, but the role of network assortativity, or degree–degree correlations, is still unclear. Here we study the dynamical robustness of correlated (assortative and disassortative) networks consisting of diffusively coupled oscillators. Numerical analyses for the correlated networks with Poisson and power-law degree distributions show that network assortativity enhances the dynamical robustness of the oscillator networks but the impact of network disassortativity depends on the detailed network connectivity. Furthermore, we theoretically analyze the dynamical robustness of correlated bimodal networks with two-peak degree distributions and show the positive impact of the network assortativity.

Coexistence of phases and the observability of random graphs

In a recent Letter, Yang et al. [Phys. Rev. Lett. 109, 258701 (2012)] introduced the concept of observability transitions: the percolationlike emergence of a macroscopic observable component in graphs in which the state of a fraction of the nodes, and of their first neighbors, is monitored. We show how their concept of depth-L percolation--where the state of nodes up to a distance L of monitored nodes is known--can be mapped onto multitype random graphs, and use this mapping to exactly solve the observability problem for arbitrary L. We then demonstrate a nontrivial coexistence of an observable and of a nonobservable extensive component. This coexistence suggests that monitoring a macroscopic portion of a graph does not prevent a macroscopic event to occur unbeknown to the observer. We also show that real complex systems behave quite differently with regard to observability depending on whether they are geographically constrained or not.