Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421352 | Discrete Applied Mathematics | 2008 | 7 Pages |
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 construct a practical network automorphism group decomposition, relate automorphism group structure to network topology and discuss generic forms of symmetry and their origin in real-world networks. We also comment on how symmetry can affect network redundancy and robustness.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ben D. MacArthur, Rubén J. Sánchez-García, James W. Anderson,