The phases of large networks with edge and triangle constraints

DOI10.1088/1751-8121/AA8CE1MaRDI QIDQ4596129zbMATH OpenOpenAlexFDO

Authors Charles Radin, Kui Ren, Lorenzo Sadun, Richard Kenyon

Publication date 30 November 2017

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.04444

zbMATH Keywords

phase diagramphase transitionsrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Phase transitions (general) in equilibrium statistical mechanics (82B26) Statistical thermodynamics (82B30)

Abstract: Based on numerical simulation and local stability analysis we describe the structure of the phase space of the edge/triangle model of random graphs. We support simulation evidence with mathematical proof of continuity and discontinuity for many of the phase transitions. All but one of themany phase transitions in this model break some form of symmetry, and we use this model to explore how changes in symmetry are related to discontinuities at these transitions.

Recommendations

• Multipodal structure and phase transitions in large constrained graphs
• Network design with edge-connectivity and degree constraints
• Network Design with Edge-Connectivity and Degree Constraints
• Large networks and graph limits
• A symmetry breaking transition in the edge/triangle network model
• The asymptotics of large constrained graphs
• Simplex triangulation induced scale-free networks
• Network geometry and complexity
• Edge flows in the complete random-lengths network

Cites work

• scientific article; zbMATH DE number 3131738 (Why is no real title available?)
• scientific article; zbMATH DE number 3620562 (Why is no real title available?)
• scientific article; zbMATH DE number 3284254 (Why is no real title available?)
• A variational formulation of equilibrium statistical mechanics and the Gibbs phase rule
• Bipodal structure in oversaturated random graphs
• Correlation Functionals
• Estimating and understanding exponential random graph models
• Finitely forcible graphons
• First order phase transition in a model of quasicrystals
• Large networks and graph limits
• Multipodal structure and phase transitions in large constrained graphs
• Networks. An introduction.
• On a General Class of Models for Interaction
• On replica symmetry of large deviations in random graphs
• On the Minimal Density of Triangles in Graphs
• Phase transitions in a complex network
• Singularities in the entropy of asymptotically large simple graphs
• The asymptotics of large constrained graphs
• The large deviation principle for the Erdős-Rényi random graph

Cited in

(13)

• Recovering nonuniform planted partitions via iterated projection
• Ground states for exponential random graphs
• Emergent structures in large networks
• Phase transitions in a complex network
• Typical large graphs with given edge and triangle densities
• Large deviation for uniform graphs with given degrees
• Phase transitions in finite random networks
• Phase transitions in the edge/concurrent vertex model
• Regular graphs with many triangles are structured
• Moderate deviations in cycle count
• A symmetry breaking transition in the edge/triangle network model
• Existence of a symmetric bipodal phase in the edge-triangle model
• A large deviation principle for the Erdős-Rényi uniform random graph

This page was built for publication: The phases of large networks with edge and triangle constraints

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