Toward Stronger Robustness of Network Controllability: A Snapback Network Model
Yang Lou, Lin Wang, Guanrong Chen

TL;DR
This paper introduces the q-snapback network model, analyzing its topological features and demonstrating its superior robustness in network controllability against various attacks compared to other network models.
Contribution
The paper proposes a novel q-snapback network model and evaluates its topological properties and robustness, highlighting its enhanced controllability resilience.
Findings
Q-snapback network has favorable topological characteristics.
It exhibits the strongest robustness of controllability.
Superior robustness compared to multiplex congruence and scale-free networks.
Abstract
A new complex network model, called q-snapback network, is introduced. Basic topological characteristics of the network, such as degree distribution, average path length, clustering coefficient and Pearson correlation coefficient, are evaluated. The typical 4-motifs of the network are simulated. The robustness of both state and structural controllabilities of the network against targeted and random node- and edge-removal attacks, with comparisons to the multiplex congruence network and the generic scale-free network, are presented. It is shown that the q-snapback network has the strongest robustness of controllabilities due to its advantageous inherent structure with many chain- and loop-motifs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
