Controllability and maximum matchings of complex networks
arXiv:1810.09059 · doi:10.1103/PhysRevE.99.012317
Abstract
Previously, the controllability problem of a linear time-invariant dynamical system was mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on random bipartite graphs were calculated analytically with the cavity method at zero temperature limit. Here we present an alternative theory to estimate MM sizes based on the core percolation theory and the perfect matching of cores. Our theory is much more simplified and easily interpreted, and can estimate MM sizes on random graphs with or without symmetry between out- and in-degree distributions. Our result helps to illuminate the fundamental connection between the controllability problem and the underlying structure of complex systems.
arXiv comment12 pages, 3 figures, and 1 table
References in corpus (34)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- The diameter of the world wide web
- The large-scale organization of metabolic networks
- Critical phenomena in complex networks
- Universal Behavior of Load Distribution in Scale-free Networks
- Control Principles of Complex Networks
- Exact Controllability of Complex Networks
- The fundamental advantages of temporal networks
- Controlling edge dynamics in complex networks
- Controlling complex networks: How much energy is needed?
- Realistic Control of Network Dynamics
- Control centrality and hierarchical structure in complex networks
- Spectrum of Controlling and Observing Complex Networks
- Controllability analysis of the directed human protein interaction network identifies disease genes and drug targets
- Emergence of bimodality in controlling complex networks
- The number of guards needed by a museum: A phase transition in vertex covering of random graphs
- Effect of correlations on network controllability
- Controllability transition and nonlocality in network control
- Network Controllability Is Determined by the Density of Low In-Degree and Out-Degree Nodes
- Rigorous decimation-based construction of ground pure states for spin glass models on random lattices
- The number of matchings in random graphs
- Core percolation on complex networks
- Core percolation in random graphs: a critical phenomena analysis
- Analytic solution of a static scale-free network model
- Statistical Mechanics of the Minimum Dominating Set Problem
- Intrinsic degree-correlations in static model of scale-free networks
- Core percolation and onset of complexity in Boolean networks
- Maximum matching on random graphs
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
- The statistical mechanics of random set packing and a generalization of the Karp-Sipser algorithm
- Two faces of greedy leaf removal procedure on graphs
- Statistical mechanics of bipartite -matchings
Cited by in corpus (4)
- Energy cost study for controlling complex social networks with conformity behavior
- Statistical mechanics of bipartite -matchings
- The network asymmetry caused by the degree correlation and its effect on the bimodality in control
- A local algorithm and its percolation analysis of bipartite -matching problem