26 citations · 105 across the 26 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012★ 12 cited
Corrigendum: Sampling regular graphs and a peer-to-peer network
Colin Cooper, Martin Dyer, Catherine Greenhill
In [Combinatorics, Probability and Computing 16 (2007), 557 - 593, Theorem 1] we proved a polynomial-time bound on the mixing rate of the switch chain for sampling d-regular graphs…
math.CO2012★ 2 cited
Making Markov chains less lazy
Catherine Greenhill
The mixing time of an ergodic, reversible Markov chain can be bounded in terms of the eigenvalues of the chain: specifically, the second-largest eigenvalue and the smallest eigenva…