Phase transitions in a complex network
From MaRDI portal
Publication:2843754
Abstract: We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then determine the optimizing graphs for small triangle density and a range of edge density, though we can only prove they are local, not global, maxima of the entropy density. With this assumption we then prove that the resulting entropy density must lose its analyticity in various regimes. In particular this implies the existence of a phase transition between distinct heterogeneous multipartite phases at low triangle density, and a phase transition between these phases and the disordered phase at high triangle density.
Recommendations
Cited in
(40)- Large deviation for uniform graphs with given degrees
- On the lower tail variational problem for random graphs
- Phase transition in information propagation on high-order networks
- Ferromagnetic phase transition in Barabási-Albert networks
- Connectivity of Poissonian inhomogeneous random multigraphs
- Asymptotic structure of constrained exponential random graph models
- Phase transitions in optimized network models
- Reciprocity in directed networks
- Lattice gas models with long range interactions
- A large deviation principle for the Erdős-Rényi uniform random graph
- Typical large graphs with given edge and triangle densities
- Typical structure of sparse exponential random graph models
- Ensemble equivalence for dense graphs
- Topological transition in a coupled dynamics in random networks
- On the asymptotics of constrained exponential random graphs
- Phase transitions in networks of chaotic elements with short and long range interactions
- A symmetry breaking transition in the edge/triangle network model
- A detailed investigation into near degenerate exponential random graphs
- Ground states for exponential random graphs
- Driven transitions at the onset of ergodicity breaking in gauge-invariant complex networks
- Complexity, scaling, and a phase transition
- Limits of multi-relational graphs
- The birth of geometry in exponential random graphs
- Estimating and understanding exponential random graph models
- Existence of a symmetric bipodal phase in the edge-triangle model
- An introduction to large deviations for random graphs
- The phases of large networks with edge and triangle constraints
- Ensemble nonequivalence in random graphs with modular structure
- Moderate deviations in cycle count
- Ensemble inequivalence and absence of quasi-stationary states in long-range random networks
- Asymptotic structure and singularities in constrained directed graphs
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- Regular graphs with many triangles are structured
- PHASE TRANSITION IN THE ISING MODEL ON LOCAL-WORLD EVOLVING NETWORKS
- Vertex order in some large constrained random graphs
- Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
- Singularities in the entropy of asymptotically large simple graphs
- Multipodal structure and phase transitions in large constrained graphs
- Asymptotic structure of graphs with the minimum number of triangles
- Phase transitions in finite random networks
This page was built for publication: Phase transitions in a complex network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843754)
