#### Filter Results:

- Full text PDF available (101)

#### Publication Year

1980

2017

- This year (0)
- Last 5 years (8)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Stephen P. Boyd, Persi Diaconis, Lin Xiao
- SIAM Review
- 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… (More)

- Persi Diaconis, David Freedman
- SIAM Review
- 1999

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… (More)

- Dave Bayer, Persi Diaconis
- 2007

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in… (More)

In a famous paper 8] Hammersley investigated the length L n of the longest increasing subsequence of a random n-permutation. Implicit in that paper is a certain one-dimensional continuous-space… (More)

This paper develops bounds on the rate of decay of powers of Markov kernels on finite state spaces. These are combined with eigenvalue estimates to give good bounds on the rate of convergence to… (More)

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… (More)

We describe a sequential importance sampling (SIS) procedure for analyzing two-way zero–one or contingency tables with fixed marginal sums. An essential feature of the new method is that it samples… (More)

- Fan Chung Graham, Persi Diaconis, Ronald L. Graham
- Discrete Mathematics
- 1992

Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In this paper, we explore generalizations of de Bruijn cycles for a variety… (More)

- DAVID ALDOW, Persi Diaconis
- 1987

Consider a finite Markov chain, in particular one with strong “symmetry” properties such as a random walk on a group. Let r,, be the distribution after n steps. The theory of convergence of n,, to a… (More)

- Joseph K. Blitzstein, Persi Diaconis
- Internet Mathematics
- 2011

Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi model, such as dependent edges and non-binomial degrees. In this paper, we… (More)