# The Asymptotics of Large Constrained Graphs

arXiv: https://arxiv.org/abs/1401.1170 · HTML: https://mlsanity.com/paper/1401.1170/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Jan 2014.

## Built on by (most cited first, 1 of 1)

- [Path convergence of Markov chains on large graphs](https://mlsanity.com/paper/2308.09214/) (2023)

## Abstract (arXiv)

We show, through local estimates and simulation, that if one constrains simple graphs by their densities varepsilon of edges and τ of triangles, then asymptotically (in the number of vertices) for over 95% of the possible range of those densities there is a well-defined typical graph, and it has a very simple structure: the vertices are decomposed into two subsets V1 and V2 of fixed relative size c and 1-c, and there are well-defined probabilities of edges, gjk, between vj∈ Vj, and vk∈ Vk. Furthermore the four parameters c, g11, g22 and g12 are smooth functions of (varepsilon,τ) except at two smooth `phase transition' curves.