DJ Aldous - Ecole d'Ete de Probabilites de Saint-Flour XII, … - Springer EXCHANGEABILITY AND RELATED TOPICS PAR David J. ALDOUS Page 2. O. Introduction ... mixture
of (y)'s if t (2.3) (') : Jry(.)e(d¥) for some distribution O on r . But in practice
it is much more convenient to use a definition of "(Y ) is " i ... Cited by 381 - Related articles - All 3 versions
[CITATION] Reversible Markov chains and random walks on graphs
- ►kfupm.edu.sa [PDF] DJ Aldous - Bernoulli, 1999 - jstor.org Department of Statistics, University of California, Berkeley, CA 94720, USA.
e-mail: aldousstat. berkeley. edu internet: http: //www.stat. berkeley.
edu/users/aldous ... Consider N particles, which merge into clusters ... Cited by 310 - Related articles - BL Direct - All 10 versions
[CITATION] Random walks on finite groups and rapidly mixing Markov chains
- ►128.32.135.2 [PDF] D Aldous - The Annals of Probability, 1991 - jstor.org The Annals of Probability 1991, Vol. 19, No. 1, 1-28 THE CONTINUUM RANDOM TREE.
I1 By David Aldous University of California, Berkeley Exact and asymptotic
results for the uniform random labelled tree on n vertices have been ... Cited by 259 - Related articles - All 11 versions
D Aldous - The Annals of Probability, 1989 - jstor.org The Annals of Probability 1989, Vol. 17, No. 2, 586-595 STOPPING TIMES AND
TIGHTNESS. II1 By David Aldous University of California, Berkeley To establish
weak convergence of a sequence of martingales to a continu- ous martingale ... Cited by 197 - Related articles - All 7 versions
- ►stanford.edu [PDF] D Aldous, P Diaconis - American Mathematical Monthly, 1986 - jstor.org SHUFFLING CARDS AND STOPPING TIMES DAVID ALDOUS* Department of Statistics,
University of California, Berkeley, CA 94720 PERSI DIACONIS** Department of
Statistics, Stanford University, Stanford, CA 94305 1. Introduction. How ... Cited by 223 - Related articles - All 11 versions
- ►psu.edu [PDF] D Aldous, P Diaconis - BULLETIN-AMERICAN MATHEMATICAL SOCIETY, 1999 - ams.org This survey paper treats two themes in parallel. One theme is a purely math-
ematical question: describe the asymptotic law (probability distribution) of the
length of the longest increasing subsequence of a random permutation. This ... Cited by 229 - Related articles - BL Direct - All 23 versions
D Aldous - The Annals of Probability, 1993 - jstor.org The Annals of Probability 1993, Vol. 21, No. 1, 248-289 THE CONTINUUM RANDOM
TREE III By David Aldous1 University of California, Berkeley Let (âê{k), k >
1) be random trees with k leaves, satisfying a consis- tency condition: ... Cited by 238 - Related articles - All 5 versions
- ►cnrs.fr [PDF] … Aldous, DJ Aldous, D Aldous, V Limic, D Aldous … - Electron. J. Probab.}, 2002 - hal-sfo.ccsd.cnrs.fr We define and study a family of Markov processes with state space the compact
set of all partitions of N that we call exchangeable fragmen- tation-coalescence
processes. They can be viewed as a combination of exchangeable ... Cited by 2257 - Related articles - View as HTML - Library Search - All 5 versions
