19 citations · 88 across the 21 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 3 cited
Half-graphs, other non-stable degree sequences, and the switch Markov chain
Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2
One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain con…
math.CO2019★ 19 cited
The mixing time of the switch Markov chains: a unified approach
Péter L. Erdős, Catherine Greenhill, Tamás Róbert Mezei +3
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results w…