#### Filter Results:

#### Publication Year

1980

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A bstract. 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 give useful bounds on rates of convergence in a variety of examples. The present paper surveys the field and presents some new examples. There is a… (More)

Author names in alphabetical order. Abstract 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 equilibrium distribution; the rate of convergence to this distribution, i.e., the mixing rate of the Markov chain, is… (More)

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 the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of… (More)

We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution at a rate determined by the second smallest eigenvalue λ 2 of the Laplacian of the weighted graph. In this paper we consider the problem of assigning… (More)

Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erd˝ os-Rényi model, such as dependent edges and non-binomial degrees. In this paper, we use a characterization due to Erd˝ os and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The… (More)

Let Mn be a random n n unitary matrix with distribution given by Haar measure on the unitary group. Using explicit moment calculations, a general criterion is given for linear combinations of traces of powers of Mn to converge to a Gaussian limit as n ! 1. By Fourier analysis, this result leads to central limit theorems for the measure on the circle that… (More)

- Persi Diaconis
- 2008

The use of simulation for high-dimensional intractable computations has revolutionized applied mathematics. Designing, improving and understanding the new tools leads to (and leans on) fascinating mathematics, from representation theory through micro-local analysis.

The Metropolis algorithm is a widely used procedure for sampling from a specified distribution on a large finite set. We survey what is rigorously known about running times. This includes work from statistical physics, computer science, probability and statistics. Some new results are given ae an illustration of the geometric theory of Markov chains.