36 citations · 216 across the 28 of their papers we have counts for
3 papers · 1 filter
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…
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…
A class of phylogenetic networks reconstructable from ancestral profiles
Peter L. Erdos, Charles Semple, Mike Steel
Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set of sampled species. In contrast to phylogenetic trees which show only speci…