From the archives
A note on perfect simulation for exponential random graph models
Historical material. Affiliations, schedules and roles on this page describe their original context.
Date: October, 2017
Arxiv Number: 1710.00873
Authors: Andressa CerqueiraAurélien GarivierFlorencia Leonardi
Abstract: In this paper we propose a perfect simulation algorithm for the
Exponential Random Graph Model, based on the Coupling From The Past method of Propp &
Wilson (1996). We use a Glauber dynamics to construct the Markov Chain and we prove the
monotonicity of the ERGM for a subset of the parametric space. We also obtain an upper bound
on the running time of the algorithm that depends on the mixing time of the Markov chain.
Keywords:
