The phases of large networks with edge and triangle constraints

DOI10.1088/1751-8121/AA8CE1zbMATH Open1386.82015arXiv1701.04444OpenAlexW2573615318MaRDI QIDQ4596129FDOQ4596129

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)

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.

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

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

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)

Cites Work

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

Cited In (11)

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

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)