A note on perfect simulation for Exponential Random Graph Models
Keyword(s):
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 and 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.
2018 ◽
Vol 15
(3)
◽
2018 ◽
Vol 50
(01)
◽
pp. 272-301
◽
2018 ◽
Vol 40
(1)
◽
pp. 144-170
◽
2019 ◽
Vol 29
(1)
◽
pp. 35-61
2012 ◽
Vol 21
(4)
◽
pp. 883-900
◽