Concentric Network Symmetry
arXiv:1407.0224 · doi:10.1016/j.ins.2015.11.014
Abstract
Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify the symmetries around nodes, which we call connectivity patterns. We develop two topological transformations that allow a concise characterization of the different types of symmetry appearing on networks and apply these concepts to six network models, namely the Erdős-Rényi, Barabási-Albert, random geometric graph, Waxman, Voronoi and rewired Voronoi. Real-world networks, namely the scientific areas of Wikipedia, the world-wide airport network and the street networks of Oldenburg and San Joaquin, are also analyzed in terms of the proposed symmetry measurements. Several interesting results emerge from this analysis, including the high symmetry exhibited by the Erdős-Rényi model. Additionally, we found that the proposed measurements present low correlation with other traditional metrics, such as node degree and betweenness centrality. Principal component analysis is used to combine all the results, revealing that the concepts presented here have substantial potential to also characterize networks at a global scale.
References in corpus (6)
- Observability and Controllability of Nonlinear Networks: The Role of Symmetry
- Quantum Random Walks Hit Exponentially Faster
- Emergence of Symmetry in Complex Networks
- Detecting degree symmetries in networks
- Prominent effect of soil network heterogeneity on microbial invasion
- Modular Dynamics of Financial Market Networks
Cited by in corpus (6)
- Paragraph-based complex networks: application to document classification and authenticity verification
- Text characterization based on recurrence networks
- An Image Analysis Approach to the Calligraphy of Books
- Syntonets: Toward A Harmony-Inspired General Model of Complex Networks
- Gene regulatory and signalling networks exhibit distinct topological distributions of motifs
- Accessibility: A Generalization of the Node Degree (A Tutorial)