English

Asymptotic structure and singularities in constrained directed graphs

Probability 2015-08-24 v4 Mathematical Physics Combinatorics math.MP

Abstract

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward pp-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph densities are controlled by parameters. The idea of directly constraining edge and other subgraph densities comes from Radin and Sadun. Such modeling circumvents a phenomenon first made precise by Chatterjee and Diaconis: that in ERGMs it is often impossible to independently constrain edge and other subgraph densities. In all our models, we find that large graphs have either uniform or bipodal structure. When edge density (resp. pp-star density) is fixed and pp-star density (resp. edge density) is controlled by a parameter, we find phase transitions corresponding to a change from uniform to bipodal structure. When both edge and pp-star density are fixed, we find only bipodal structures and no phase transition.

Keywords

Cite

@article{arxiv.1405.2466,
  title  = {Asymptotic structure and singularities in constrained directed graphs},
  author = {David Aristoff and Lingjiong Zhu},
  journal= {arXiv preprint arXiv:1405.2466},
  year   = {2015}
}

Comments

24 pages, 2 figures

R2 v1 2026-06-22T04:10:50.645Z