Concentric network symmetry

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory (05C90) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

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 ErdH{o}s-R'enyi, Barab'asi-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 ErdH{o}s-R'enyi 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.

Recommendations

Cited in

(7)

This page was built for publication: Concentric network symmetry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671257)