288 citations · 738 across the 21 of their papers we have counts for
Showing 2007 · math.PRShow all
3 papers · 2 filters
math.PR2007★ 288 cited
Graph limits and exchangeable random graphs
Persi Diaconis, Svante Janson
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and man…
math.PR2007★ 93 cited
Fastest mixing Markov chain on graphs with symmetries
Stephen Boyd, Persi Diaconis, Pablo A. Parrilo +1
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize t…
math.PR2007★ 80 cited
Separation cut-offs for birth and death chains
Persi Diaconis, Laurent Saloff-Coste
This paper gives a necessary and sufficient condition for a sequence of birth and death chains to converge abruptly to stationarity, that is, to present a cut-off. The condition in…