# P. Diaconis

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Algebraic algorithms for sampling from conditional distributions

- P. Diaconis, B. Sturmfels
- Mathematics
- 1 February 1998

We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include contingency tables, logistic regression, and spectral… Expand

Generating a random permutation with random transpositions

- P. Diaconis, M. Shahshahani
- Mathematics
- 1 June 1981

Iterated Random Functions

- P. Diaconis, D. Freedman
- Computer Science, Mathematics
- SIAM Rev.
- 1999

Iterated random functions are used to draw pictures or simulate large Ising models, among other applications. They offer a method for studying the steady state distribution of a Markov chain, and… Expand

Supercharacters and superclasses for algebra groups

- P. Diaconis, I. Isaacs
- Mathematics
- 20 November 2007

We study certain sums of irreducible characters and compatible unions of conjugacy classes in finite algebra groups. These groups generalize the unimodular upper triangular groups over a finite… Expand

Fastest Mixing Markov Chain on a Graph

- Stephen P. Boyd, P. Diaconis, Lin Xiao
- Computer Science, Mathematics
- SIAM Rev.
- 2004

We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform… Expand

Trailing the Dovetail Shuffle to its Lair

- D. Bayer, P. Diaconis
- Mathematics
- 1 May 1992

We analyze the most commonly used method for shuffling cards. The main result is a simple expression for the chance of any arrangement after any number of shuffles. This is used to give sharp bounds… Expand

Estimating and understanding exponential random graph models

- S. Chatterjee, P. Diaconis
- Mathematics, Physics
- 14 February 2011

We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent using… Expand

Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem

- D. Aldous, P. Diaconis
- Mathematics
- 1 October 1999

We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via… Expand

On the Eigenvalues of Random Matrices

- P. Diaconis, M. Shahshahani
- Mathematics
- 1994

Let M be a random matrix chosen from Haar measure on the unitary group U,,. Let Z = X + iY be a standard complex normal random variable with X and Y independent, mean 0 and variance 4normal… Expand