288 citations · 537 across the 9 of their papers we have counts for
4 papers · 1 filter
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…
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…
On fixed points of permutations
Persi Diaconis, Jason Fulman, Robert Guralnick
The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Rest…
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…