Mixing time of exponential random graphs (Q657693)

Sampling in exponential random graphs is typically carried out by using Markov chain Monte Carlo methods like the Glauber dynamics or the Metropolis-Hastings procedure. High and low temperature regimes are characterized, and for each regime the order of the mixing time of the sampling procedure is specified in terms of the number of vertices in the graph. The results are used to determine whether or not specific exponential random graph models possess a desired reciprocity property.