On symmetry of uniform and preferential attachment graphs

zbMath1298.05286MaRDI QIDQ740670

Svante Janson, Wojciech Szpankowski, Giorgos Kollias, Abram Magner

Publication date: 9 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p32

zbMATH Keywords

symmetryautomorphismrandom graphspreferential attachment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (3)

SYMMETRY GEOMETRY BY PAIRINGS ⋮ Generating graphs by creating associative and random links between existing nodes ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The diameter of a scale-free random graph
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Statistical mechanics of complex networks
• The Asymptotic Number of Unlabelled Regular Graphs
• On the asymmetry of random regular graphs and random graphs
• Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
• Asymmetric graphs

This page was built for publication: On symmetry of uniform and preferential attachment graphs