Persi Diaconis

According to our database1, Persi Diaconis authored at least 38 papers between 1980 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Reproducing kernel orthogonal polynomials on the multinomial distribution.
Journal of Approximation Theory, 2019

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

2015
de Finetti Priors using Markov chain Monte Carlo computations.
Statistics and Computing, 2015

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

2014
Carries, Group Theory, and Additive Combinatorics.
The American Mathematical Monthly, 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 Mathematics, 2011

On Barycentric Subdivision.
Combinatorics, Probability & Computing, 2011

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

2009
Carries, Shuffling, and an Amazing Matrix.
The American Mathematical Monthly, 2009

Fastest Mixing Markov Chain on Graphs with Symmetries.
SIAM Journal on Optimization, 2009

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

2008
Threshold Graph Limits and Random Threshold Graphs.
Internet Mathematics, 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 Review, 2007

2006
Fastest Mixing Markov Chain on a Path.
The American Mathematical Monthly, 2006

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

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

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

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

Numerical Results for the Metropolis Algorithm.
Experimental Mathematics, 2004

Random Matrices, Magic Squares and Matching Polynomials.
Electr. 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 Review, 1999

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

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

1992
Binomial coefficient codes over GF(2).
Discrete Mathematics, 1992

Universal cycles for combinatorial structures.
Discrete Mathematics, 1992

Analysis of Top To Random Shuffles.
Combinatorics, Probability & Computing, 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...