On Automorphism Groups of Networks
arXiv:0705.3215 · doi:10.1016/j.dam.2008.04.008
Abstract
We consider the size and structure of the automorphism groups of a variety of empirical `real-world' networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We relate automorphism group structure to network topology and discuss generic forms of symmetry and their origin in real-world networks.
10 pages, 2 figures, major changes, abridged version
References in corpus (1)
Cited by in corpus (59)
- Symmetries, Cluster Synchronization, and Isolated Desynchronization in Complex Networks
- Mathematical frameworks for oscillatory network dynamics in neuroscience
- Complete Characterization of Stability of Cluster Synchronization in Complex Dynamical Networks
- Symmetries and Cluster Synchronization in Multilayer Networks
- A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
- Symmetric States Requiring System Asymmetry
- Stable Chimeras and Independently Synchronizable Clusters
- Dimensionality reduction and spectral properties of multilayer networks
- Topological Control of Synchronization Patterns: Trading Symmetry for Stability
- Spectral Characteristics of Network Redundancy
- Classical symmetries and the Quantum Approximate Optimization Algorithm
- Exploiting symmetry in network analysis
- Complex Networks and Symmetry I: A Review
- Hidden Symmetries in Real and Theoretical Networks
- Koopman Operator and its Approximations for Systems with Symmetries
- Partial Synchronization and Partial Amplitude Death in Mesoscale Network Motifs
- Does the brain behave like a (complex) network? I. Dynamics
- Complex Quantum Networks: a Topical Review
- Controlling synchronous patterns in complex networks
- Complex Networks and Symmetry II: Reciprocity and Evolution of World Trade
- Stochastic cycle selection in active flow networks
- Network experiment demonstrates converse symmetry breaking
- Network-complement transitions, symmetries, and cluster synchronization
- Antagonistic Phenomena in Network Dynamics
- Effective Bounds on Network-Size for Anti-phase Synchronization
- Clusters in nonsmooth oscillator networks
- Axiomatic Ranking of Network Role Similarity
- Concentric Network Symmetry
- Normalized Laplace Operators for Hypergraphs with Real Coefficients
- Attracting Poisson Chimeras in Two-population Networks
- Symmetric motifs in random geometric graphs
- Strongly uncontrollable network topologies
- Zoo Guide to Network Embedding
- Optimal control of network-coupled subsystems: Spectral decomposition and low-dimensional solutions
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- A Structured Table of Graphs with Symmetries and Other Special Properties
- Geometry and symmetry in biochemical reaction systems
- Quasi-symmetries in complex networks: a dynamical model approach
- Concurrent formation of nearly synchronous clusters in each intertwined cluster set with parameter mismatches
- Estimating cellular redundancy in networks of genetic expression
- Transitional cluster dynamics in a model for delay-coupled chemical oscillators
- An introduction to spectral distances in networks (extended version)
- Approximate Network Symmetry
- Topologically protected synchronization in networks
- A rigorous and efficient approach to finding and quantifying symmetries in complex networks
- Mechanisms for Network Growth that Preserve Spectral and Local Structure
- Algebraic and Topological Indices of Molecular Pathway Networks in Human Cancers
- Local symmetry in random graphs
- Percolation critical exponents in cluster kinetics of pulse-coupled oscillators
- General Equitable Decompositions for Graphs with Symmetries
- Emergence of a spectral gap in a class of random matrices associated with split graphs
- Spectral theory of weighted hypergraphs via tensors
- Observability of Nonlinear Complex Networks in the Presence of Symmetries: A Graphical Approach
- Modeling languages from graph networks
- Irregular Metamaterial Networks
- Extensions and Applications of Equitable Decompositions for Graphs with Symmetries
- Graph Iso/Auto-morphism: A Divide-&-Conquer Approach
- Equitable Decompositions of Graphs
- Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach