Persi Diaconis

Affiliations:
  • Stanford University, USA


According to our database1, Persi Diaconis authored at least 45 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Isomorphisms between random graphs.
J. Comb. Theory, Ser. B, May, 2023

2022
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback.
Am. Math. Mon., 2022

Card guessing with partial feedback.
Comb. Probab. Comput., 2022

2021
Sequential importance sampling for estimating expectations over the space of perfect matchings.
CoRR, 2021

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs.
Adv. Appl. Math., 2021

Permanental generating functions and sequential importance sampling.
Adv. Appl. Math., 2021

2019
Reproducing kernel orthogonal polynomials on the multinomial distribution.
J. Approx. Theory, 2019

2017
Probabilizing parking functions.
Adv. Appl. Math., 2017

2016
The Mathematics of the Flip and Horseshoe Shuffles.
Am. Math. Mon., 2016

2015
de Finetti Priors using Markov chain Monte Carlo computations.
Stat. Comput., 2015

Central limit theorems for some set partition statistics.
Adv. Appl. Math., 2015

2014
Carries, Group Theory, and Additive Combinatorics.
Am. Math. Mon., 2014

Combinatorics of balanced carries.
Adv. Appl. Math., 2014

Unseparated pairs and fixed points in random permutations.
Adv. Appl. Math., 2014

2013
Random doubly stochastic tridiagonal matrices.
Random Struct. Algorithms, 2013

2011
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees.
Internet Math., 2011

On Barycentric Subdivision.
Comb. Probab. Comput., 2011

2010
Functions of random walks on hyperplane arrangements.
Adv. Appl. Math., 2010

2009
Carries, Shuffling, and an Amazing Matrix.
Am. Math. Mon., 2009

Fastest Mixing Markov Chain on Graphs with Symmetries.
SIAM J. Optim., 2009

Carries, shuffling, and symmetric functions.
Adv. Appl. Math., 2009

2008
Threshold Graph Limits and Random Threshold Graphs.
Internet Math., 2008

Shuffling cards, adding numbers, and symmetric functions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Dynamical Bias in the Coin Toss.
SIAM Rev., 2007

2006
Fastest Mixing Markov Chain on a Path.
Am. Math. Mon., 2006

The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem.
SIAM Rev., 2006

Markov bases for noncommutative Fourier analysis of ranked data.
J. Symb. Comput., 2006

2005
Symmetry Analysis of Reversible Markov Chains.
Internet Math., 2005

2004
Fastest Mixing Markov Chain on a Graph.
SIAM Rev., 2004

Numerical Results for the Metropolis Algorithm.
Exp. Math., 2004

Random Matrices, Magic Squares and Matching Polynomials.
Electron. J. Comb., 2004

Solitaire: Man Versus Machine.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

2003
Who cares about permanents?
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Toeplitz Minors.
J. Comb. Theory, Ser. A, 2002

2001
Combinatorics for the East Model.
Adv. Appl. Math., 2001

2000
Immanants and Finite Point Processes.
J. Comb. Theory, Ser. A, 2000

1999
Iterated Random Functions.
SIAM Rev., 1999

1998
What Do We Know about the Metropolis Algorithm?
J. Comput. Syst. Sci., 1998

1995
Riffle Shuffles, Cycles, and Descents.
Comb., 1995

1992
Binomial coefficient codes over GF(2).
Discret. Math., 1992

Universal cycles for combinatorial structures.
Discret. Math., 1992

Analysis of Top To Random Shuffles.
Comb. Probab. Comput., 1992

1991
Efficient Computation of Isotypic Projections for the Symmetric Group 87.
Proceedings of the Groups And Computation, 1991

1990
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions.
Random Struct. Algorithms, 1990

1980
Average Running Time of the Fast Fourier Transform.
J. Algorithms, 1980


  Loading...