Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T19:42:27.969Z Has data issue: false hasContentIssue false

On the asymptotics of constrained exponential random graphs

Published online by Cambridge University Press:  04 April 2017

Richard Kenyon*
Affiliation:
Brown University
Mei Yin*
Affiliation:
University of Denver
*
* Postal address: Department of Mathematics, Brown University, Providence, RI 02912, USA. Email address: rkenyon@math.brown.edu
** Postal address: Department of Mathematics, University of Denver, Denver, CO 80208, USA. Email address: mei.yin@du.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of edges. What does a typical random graph look like, if drawn from an exponential model subject to such constraints? Will there be a similar phase transition phenomenon (as one varies the parameters) as that which occurs in the unconstrained exponential model? We present some general results for this constrained model and then apply them to obtain concrete answers in the edge-triangle model with fixed density of edges.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2017