Persi Diaconis

50 papers A* 3Journal 45Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Counting the number of group orbits by marrying the Burnside process with importance sampling.
Adv. Appl. Math.
Persi Diaconis, Chenyang Zhong
2025 J jnl
Estimating the size of a set using cascading exclusion.
CoRR
Sourav Chatterjee, Persi Diaconis, Susan P. Holmes
2025 J jnl
Poisson approximation for large permutation groups.
Adv. Appl. Math.
Persi Diaconis, Nathan Tung
2025 J jnl
Random sampling of contingency tables and partitions: Two practical examples of the Burnside process.
Stat. Comput.
Persi Diaconis, Michael Howes
2023 J jnl
Isomorphisms between random graphs.
J. Comb. Theory B
Sourav Chatterjee, Persi Diaconis
2022 J jnl
Card guessing with partial feedback.
Comb. Probab. Comput.
Persi Diaconis, Ronald L. Graham, Xiaoyu He, Sam Spiro
2022 J jnl
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback.
Am. Math. Mon.
Persi Diaconis, Ronald L. Graham, Sam Spiro
2021 J jnl
Permanental generating functions and sequential importance sampling.
Adv. Appl. Math.
Fan Chung, Persi Diaconis, Ron Graham
2021 J jnl
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs.
Adv. Appl. Math.
Persi Diaconis, Brett Kolesnik
2021 J jnl
Sequential importance sampling for estimating expectations over the space of perfect matchings.
CoRR
Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi
2019 J jnl
Reproducing kernel orthogonal polynomials on the multinomial distribution.
J. Approx. Theory
Persi Diaconis, Robert C. Griffiths
2017 J jnl
Probabilizing parking functions.
Adv. Appl. Math.
Persi Diaconis, Angela Hicks
2016 J jnl
The Mathematics of the Flip and Horseshoe Shuffles.
Am. Math. Mon.
Steve Butler, Persi Diaconis, Ron Graham
2015 J jnl
Central limit theorems for some set partition statistics.
Adv. Appl. Math.
Bobbie Chern, Persi Diaconis, Daniel M. Kane, Robert C. Rhoades
2015 J jnl
de Finetti Priors using Markov chain Monte Carlo computations.
Stat. Comput.
Sergio Bacallado, Persi Diaconis, Susan P. Holmes
2014 J jnl
Carries, Group Theory, and Additive Combinatorics.
Am. Math. Mon.
Persi Diaconis, Xuancheng Shao, Kannan Soundararajan
2014 J jnl
Combinatorics of balanced carries.
Adv. Appl. Math.
Persi Diaconis, Jason E. Fulman
2014 J jnl
Unseparated pairs and fixed points in random permutations.
Adv. Appl. Math.
Persi Diaconis, Steven N. Evans, Ron Graham
2013 J jnl
Random doubly stochastic tridiagonal matrices.
Random Struct. Algorithms
Persi Diaconis, Philip Matchett Wood
2011 J jnl
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees.
Internet Math.
Joseph K. Blitzstein, Persi Diaconis
2011 J jnl
On Barycentric Subdivision.
Comb. Probab. Comput.
Persi Diaconis, Laurent Miclo
2010 J jnl
Functions of random walks on hyperplane arrangements.
Adv. Appl. Math.
Christos A. Athanasiadis, Persi Diaconis
2009 J jnl
Carries, Shuffling, and an Amazing Matrix.
Am. Math. Mon.
Persi Diaconis, Jason E. Fulman
2009 J jnl
Carries, shuffling, and symmetric functions.
Adv. Appl. Math.
Persi Diaconis, Jason E. Fulman
2009 J jnl
Fastest Mixing Markov Chain on Graphs with Symmetries.
SIAM J. Optim.
Stephen P. Boyd, Persi Diaconis, Pablo A. Parrilo, Lin Xiao
2008 A* conf
Shuffling cards, adding numbers, and symmetric functions.
SODA
Persi Diaconis
2008 J jnl
Threshold Graph Limits and Random Threshold Graphs.
Internet Math.
Persi Diaconis, Susan P. Holmes, Svante Janson
2007 J jnl
Dynamical Bias in the Coin Toss.
SIAM Rev.
Persi Diaconis, Susan P. Holmes, Richard Montgomery
2006 J jnl
Fastest Mixing Markov Chain on a Path.
Am. Math. Mon.
Stephen P. Boyd, Persi Diaconis, Jun Sun, Lin Xiao
2006 J jnl
Markov bases for noncommutative Fourier analysis of ranked data.
J. Symb. Comput.
Persi Diaconis, Nicholas Eriksson
2006 J jnl
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem.
SIAM Rev.
Jun Sun, Stephen P. Boyd, Lin Xiao, Persi Diaconis
2005 J jnl
Symmetry Analysis of Reversible Markov Chains.
Internet Math.
Stephen P. Boyd, Persi Diaconis, Pablo A. Parrilo, Lin Xiao
2004 J jnl
Fastest Mixing Markov Chain on a Graph.
SIAM Rev.
Stephen P. Boyd, Persi Diaconis, Lin Xiao
2004 J jnl
Numerical Results for the Metropolis Algorithm.
Exp. Math.
Persi Diaconis, J. W. Neuberger
2004 J jnl
Random Matrices, Magic Squares and Matching Polynomials.
Electron. J. Comb.
Persi Diaconis, Alexander Gamburd
2004 — conf
Solitaire: Man Versus Machine.
NIPS
Xiang Yan, Persi Diaconis, Paat Rusmevichientong, Benjamin Van Roy
2003 A* conf
Who cares about permanents?
SODA
Persi Diaconis
2002 J jnl
Toeplitz Minors.
J. Comb. Theory A
Daniel Bump, Persi Diaconis
2001 J jnl
Combinatorics for the East Model.
Adv. Appl. Math.
Fan Chung, Persi Diaconis, Ronald L. Graham
2000 J jnl
Immanants and Finite Point Processes.
J. Comb. Theory A
Persi Diaconis, Steven N. Evans
1999 J jnl
Iterated Random Functions.
SIAM Rev.
Persi Diaconis, David Freedman
1998 J jnl
What Do We Know about the Metropolis Algorithm?
J. Comput. Syst. Sci.
Persi Diaconis, Laurent Saloff-Coste
1995 J jnl
Riffle Shuffles, Cycles, and Descents.
Comb.
Persi Diaconis, Michael McGrath, Jim Pitman
1995 A* conf
What do we know about the Metropolis algorithm?
STOC
Persi Diaconis, Laurent Saloff-Coste
1992 J jnl
Analysis of Top To Random Shuffles.
Comb. Probab. Comput.
Persi Diaconis, James Allen Fill, Jim Pitman
1992 J jnl
Binomial coefficient codes over GF(2).
Discret. Math.
Persi Diaconis, Ronald L. Graham
1992 J jnl
Universal cycles for combinatorial structures.
Discret. Math.
Fan R. K. Chung, Persi Diaconis, Ronald L. Graham
1991 — conf
Efficient Computation of Isotypic Projections for the Symmetric Group 87.
Groups And Computation
Persi Diaconis, Daniel N. Rockmore
1990 J jnl
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions.
Random Struct. Algorithms
Persi Diaconis, Ronald L. Graham, John A. Morrison
1980 J jnl
Average Running Time of the Fast Fourier Transform.
J. Algorithms
Persi Diaconis