The birth of geometry in exponential random graphs

Abstract

Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex degree and form very large numbers of simple polygons (triangles or squares). The models avoid the collapse phenomena that plague naive graph Hamiltonians based on triangle or square counts. More than that, statistically significant numbers of other geometric primitives (small pieces of regular lattices, cubes) emerge in our ensemble, even though they are not in any way explicitly pre-programmed into the formulation of the graph Hamiltonian, which only depends on properties of paths of length 2. While much of our motivation comes from hopes to construct a graph-based theory of random geometry (Euclidean quantum gravity), our presentation is completely self-contained within the context of exponential random graph theory, and the range of potential applications is considerably more broad.

arXiv commentv3: further clarifications and references added; accepted for publication

References in corpus (31)

• Emergence of a 4D World from Causal Quantum Gravity
• Nonperturbative Quantum Gravity
• Estimating and understanding exponential random graph models
• The causal set approach to quantum gravity
• Solution of the 2-star model of a network
• Double Scaling in Tensor Models with a Quartic Interaction
• Solution for the properties of a clustered network
• Discontinuous Percolation Transitions in Epidemic Processes, Surface Depinning in Random Media and Hamiltonian Random Graphs
• Network Transitivity and Matrix Models
• Clustering implies geometry in networks
• Phase transitions in a complex network
• The Asymptotics of Large Constrained Graphs
• Phase transitions in exponential random graphs
• Combinatorial Quantum Gravity: Geometry from Random Bits
• Distribution of diameters for Erdös-Rényi random graphs
• Analytical results for the distribution of shortest path lengths in random networks
• Ollivier-Ricci curvature convergence in random geometric graphs
• Quantum Gravity as an Information Network: Self-Organization of a 4D Universe
• Distance distribution in configuration model networks
• Singularities in the entropy of asymptotically large simple graphs
• The distribution of shortest path lengths in subcritical Erdős-Rényi networks
• Self-Assembly of Geometric Space from Random Graphs
• Enhanced Forman curvature and its relation to Ollivier curvature
• Random Holographic "Large Worlds" with Emergent Dimensions
• Interacting Thermofield Doubles and Critical Behavior in Random Regular Graphs
• Quantum Gravity on the computer: Impressions of a workshop
• The two-star model: exact solution in the sparse regime and condensation transition
• Statistical mechanics of graph models and their implications for emergent spacetime manifolds
• Ollivier curvature of random geometric graphs converges to Ricci curvature of their Riemannian manifolds
• Analytic solution of the two-star model with correlated degrees
• Combinatorial Quantum Gravity: Emergence of Geometric Space from Random Graphs

Cited by in corpus (6)

• Complex Quantum Networks: a Topical Review
• The mass of simple and higher-order networks
• Dirac gauge theory for topological spinors in 3+1 dimensional networks
• Convergence of Combinatorial Gravity
• Ensemble inequivalence and phase transitions in unlabeled networks
• Emergence of Lie group symmetric classical spacetimes in canonical tensor model