Zero forcing number of graphs with a power law degree distribution
arXiv:2009.11938 · doi:10.1103/PhysRevE.103.022301
Abstract
The zero forcing number is the minimum number of black vertices that can turn a white graph black following a single neighbour colour forcing rule. The zero forcing number provides topological information about linear algebra on graphs, with applications to the controllability of linear dynamical systems and quantum walks on graphs among other problems. Here, I investigate the zero forcing number of undirected simple graphs with a power law degree distribution . For graphs generated by the preferential attachment model, with a diameter scaling logarithmically with the graph size, the zero forcing number approaches the graph size when . In contrast, for graphs generated by the deactivation model, with a diameter scaling linearly with the graph size, the zero forcing number is smaller than the graph size independently of . Therefore the scaling of the graph diameter with the graph size is another factor determining the controllability of dynamical systems.
arXiv comment5 pages, 5 figures
References in corpus (9)
- Emergence of scaling in random networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Scale-Free Networks are Ultrasmall
- Highly clustered scale-free networks
- The network topology of a potential energy landscape: A static scale-free network
- Topology and correlations in structured scale-free networks
- Zero forcing, linear and quantum controllability for systems evolving on networks
- Computational complexity arising from degree correlations in networks
- Statistical Mechanics of the Minimum Dominating Set Problem