## Rayleigh processes, real trees, and root growth with re-grafting (2004)

### Cached

### Download Links

Citations: | 47 - 11 self |

### BibTeX

@TECHREPORT{Evans04rayleighprocesses,,

author = {Steven N. Evans and Jim Pitman and Anita Winter},

title = {Rayleigh processes, real trees, and root growth with re-grafting},

institution = {},

year = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous’s Brownian continuum random tree, the random tree-like object naturally associated with a standard Brownian excursion, may be thought of as a random compact real tree. The continuum random tree is a scaling limit as N → ∞ of both a critical Galton-Watson tree conditioned to have total population size N as well as a uniform random rooted combinatorial tree with N vertices. The Aldous–Broder algorithm is a Markov chain on the space of rooted combinatorial trees with N vertices that has the uniform tree as its stationary distribution. We construct and study a Markov process on the space of all rooted compact real trees that has the continuum random tree as its stationary distribution and arises as the scaling limit as N → ∞ of the Aldous–Broder chain. A key technical ingredient in this work is the use of a pointed Gromov–

### Citations

529 | Metric structures for Riemannian and non-Riemannian spaces (Birkhäuser - Gromov - 2001 |

425 |
and Andre Haefliger, Metric spaces of non-- positive curvature, grundlehren der mathematischen wissenschaften ed
- Bridson
- 1999
(Show Context)
Citation Context ... equivalent to the pointed convergence defined in [BBI01] (Definition 8.1.1.). The reader should be aware that uses of terms such as “pointed convergence” vary across the literature. For instance, in =-=[BH99]-=- the weaker notion of convergence requiring all closed balls ¯ B(ρn,r) to converge to ¯ B(ρ,r) in Gromov-Hausdorff topology is considered. Lemma 2.5. Consider ((Xn,dXn,ρn))n∈N and (X,d,ρ) in (T root ,... |

337 |
Inferring Phylogenies. Sinauer Associates
- Felsenstein
- 2003
(Show Context)
Citation Context ...portant role in algorithms that attempt to reconstruct optimal phylogenetic trees from data by moving through tree space as part of a hill-climbing or simulated annealing procedure (see, for example, =-=[Fel03]-=-). The crucial feature of the root growth with re-grafting dynamics is that they have a simple projective structure: If one follows the evolution of the points in a rooted subtree of the initial tree ... |

158 | The continuum random tree - Aldous - 1991 |

155 |
Markov Processes
- Ethier, Kurtz
- 1986
(Show Context)
Citation Context ...n distance is a genuine metric on the space of Borel probability measures and convergence with respect to this distance implies weak convergence (see, for example, Theorem 3.3.1 and Problem 3.11.2 of =-=[EK86]-=-). If V and W are two E-valued random variables on the same probability space (Σ, A, P) with distributions α and β, respectively, then (6.34) dW(α,β) ≤ sup |P[f(V )] − P[f(W)]| f∈B ≤ sup P[|f(V ) − f(... |

124 | Combinatorial stochastic processes - Pitman - 2002 |

107 |
The continuum random tree III
- Aldous
- 1993
(Show Context)
Citation Context ...by first working along the path from the root 0 to leaf 1, then along the path joining that path to leaf 2, and so on. But this choice of order is unimportant, because according to Lemma 21 of Aldous =-=[Ald93]-=-, the sequence of edgelengths is exchangeable, and independent of the shape of Rn, which is equally likely to be any one of the sn possible shapes.26 STEVEN N. EVANS, JIM PITMAN, AND ANITA WINTER Let... |

101 | Generating random spanning trees more quickly than the cover time - Wilson - 1996 |

95 | How to get a perfectly random sample from a generic Markov Chain and Generate a random spanning tree of a directed graph - Propp, Wilson - 1998 |

82 | A random walk construction of uniform spanning trees and uniform labelled trees - Aldous - 1990 |

75 | Geometry of the space of phylogenetic trees
- Billera, Holmes, et al.
(Show Context)
Citation Context ...ack to 1918: Prüfer [Prü18] sets up a bijection between labeled trees of size n and the points of {1,2,... ,n} n−2 . Phylogenetic trees are identified with points in matching polytopes in [DH98], and =-=[BHV01]-=- equips the space of finite phylogenetic trees with a fixed number of leaves with a metric that makes it a cell-complex with non-positive curvature. The plan of the rest of the paper is as follows. We... |

74 | tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces - Dress, Trees - 1984 |

59 |
Piecewise-deterministic Markov processes: A general class of non-diffusion stochastic models
- DAVIS
- 1984
(Show Context)
Citation Context ...s via alternating deterministic root growth and random jumps due to re-grafting and is an example of a piecewise-deterministic Markov process. A general framework for such processes was introduced in =-=[Dav84]-=- as an abstraction of numerous examples in queueing and control theory, and this line of research was extensively developed in the subsequent monograph [Dav93]. A more general formulation in terms of ... |

54 | Spatial branching processes, random snakes and partial differential equations - Gall - 1999 |

52 | The continuum random tree II: an overview. Stochastic Analysis - Aldous - 1990 |

33 | Terhalle: T-theory: an overview - Dress, Moulton, et al. - 1996 |

32 | A Markovian analysis of AdditiveIncrease Multiplicative-Decrease (AIMD) algorithms
- Dumas, Guillemin, et al.
(Show Context)
Citation Context ...AN, AND ANITA WINTER sufficiently large, and so the result follows from the ergodic theorem applied to {t ∈ R : ¯ Rt �= ¯ Rt−}. � Then the following corollary is a consequence of Proposition 7.1. See =-=[DGR02]-=-, where similar scaling limits are derived. Corollary 8.2. For each N ∈ N, let ( ˜ R N t )t≥0 denote a continuous time Markov chain with state space {1,... ,N} and infinitesimal generator matrix (8.13... |

32 | Topologie de Gromov équivariante, structures hyperboliques et arbres réels - Paulin - 1988 |

29 | R-trees in topology, geometry and group theory’, Handbook of geometry and topology - Bestvina |

24 |
Discretization of processes
- Jacod, Protter
- 2012
(Show Context)
Citation Context ...nd control theory, and this line of research was extensively developed in the subsequent monograph [Dav93]. A more general formulation in terms of martingales and additive functionals can be found in =-=[JS96]-=-. Some other appearances of such processes are [EP98, CDP01, DC99, Cai93, Cos90]. We note also that pruning and regrafting operations such as the one we consider here play an important role in algorit... |

22 |
A Course in Metric Geometry, Graduate studies in mathematics
- Burago, Burago, et al.
(Show Context)
Citation Context ... metric space Z (compare [Gro99, BH99, BBI01]). The GromovHausdorff distance defines a finite metric on the space of all isometry classes of compact metric spaces (see, for example, Theorem 7.3.30 in =-=[BBI01]-=-). Let (T,dGH) be the metric space of isometry classes of compact R-trees equipped with dGH. We will elaborate T slightly to incorporate the notion of rooted trees, and this latter space of rooted tre... |

16 |
Neuer Beweis eines Satzes uber
- Prüfer
- 1918
(Show Context)
Citation Context ...is quite a large literature on other approaches to “geometrizing” and “coordinatizing” spaces of trees. The first construction of codes for labeled trees without edge-length goes back to 1918: Prüfer =-=[Prü18]-=- sets up a bijection between labeled trees of size n and the points of {1,2,... ,n} n−2 . Phylogenetic trees are identified with points in matching polytopes in [DH98], and [BHV01] equips the space of... |

16 |
Introduction to Λ-trees, World Scientific Publishing Co
- Chiswell
- 2001
(Show Context)
Citation Context ...reconstruction of phylogenies. We also note that R-trees have been objects of intensive study in geometric group theory (see, for example, the surveys [Sha87, Mor92, Sha91, Bes02] and the recent book =-=[Chi01]-=-). Diffusions on an R-tree were investigated in [Eva00]. Some of the results on the space of R-trees obtained in this paper have already been found useful in the study scaling limits of Galton–Watson ... |

15 | Recursive self-similarity for random trees, random triangulations and Brownian excursion - Aldous - 1994 |

15 | Borodin and Paavo Salminen, Handbook of Brownian motion—facts and formulae - Andrei - 1996 |

13 | How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time - Wilson, Propp - 1996 |

11 | The real tree - Dress, Terhalle - 1996 |

9 | Mixing time for a Markov chain on cladograms - Aldous - 2000 |

9 |
Introduction to Λ-Trees
- Chiswell
- 2001
(Show Context)
Citation Context ...reconstruction of phylogenies. We also note that R-trees have been objects of intensive study in geometric group theory (see, for example, the surveys [Sha87, Mor92, Sha91, Bes02] and the recent book =-=[Chi01]-=-). Diffusions on an R-tree were investigated in [Eva00]. Some of the results on the space of R-trees obtained in this paper have already been found useful in the study scaling limits of Galton–Watson ... |

9 | Stability of piecewise-deterministic Markov processes - Dufour, Costa - 1999 |

9 | Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
- Peres, Revelle
- 2004
(Show Context)
Citation Context ...orithm for generating a uniform spanning tree of a graph [PW98, Wil96, WP96]. Asymptotics of the latter algorithm havesREAL TREES 43 been investigated in [Pit02b]. Wilson’s algorithm was also used in =-=[PR04]-=- to show that the finite-dimensional distributions of the re-scaled uniform random spanning tree for the d-dimensional discrete torus converges to the Brownian CRT as the number of vertices goes to in... |

8 | and Jean-François Le Gall. Random trees, Lévy processes and spatial branching processes - Duquesne |

8 | Λ-trees and their applications - Morgan - 1992 |

7 | Dendrology of groups: An introduction. Essays in Group Theory - Shalen - 1987 |

5 | Stationary distributions of piecewise-deterministic Markov processes, J.Appl.Prob - Costa - 1990 |

5 | R-trees and symmetric differences of sets - Terhalle - 1997 |

4 |
Models and optimization
- Markov
- 1993
(Show Context)
Citation Context ...ork for such processes was introduced in [Dav84] as an abstraction of numerous examples in queueing and control theory, and this line of research was extensively developed in the subsequent monograph =-=[Dav93]-=-. A more general formulation in terms of martingales and additive functionals can be found in [JS96]. Some other appearances of such processes are [EP98, CDP01, DC99, Cai93, Cos90]. We note also that ... |

4 | Stationary Markov processes related to stable Ornstein– Uhlenbeck processes and the additive coalescent - Evans, Pitman - 1997 |

3 | Pra, A class of piecewise deterministic Markov processes, Markov Process - Colombo, Dai |

3 |
Matchings and phylogenetic
- Diaconis, Holmes
- 1998
(Show Context)
Citation Context ...ength goes back to 1918: Prüfer [Prü18] sets up a bijection between labeled trees of size n and the points of {1,2,... ,n} n−2 . Phylogenetic trees are identified with points in matching polytopes in =-=[DH98]-=-, and [BHV01] equips the space of finite phylogenetic trees with a fixed number of leaves with a metric that makes it a cell-complex with non-positive curvature. The plan of the rest of the paper is a... |

3 |
models and optimization, Monographs on Statistics and Applied Probability
- Markov
- 1993
(Show Context)
Citation Context ...ork for such processes was introduced in [Dav84] as an abstraction of numerous examples in queueing and control theory, and this line of research was extensively developed in the subsequent monograph =-=[Dav93]-=-. A more general formulation in terms of martingales and additive functionals can be found in [JS96]. Some other appearances of such processes are [EP98, CDP01, DC99, Cai93, Cos90]. We note also that ... |

3 |
Inferring phylogenies, Sinauer Associates, 2003
- Felsenstein
(Show Context)
Citation Context ...portant role in algorithms that attempt to reconstruct optimal phylogenetic trees from data by moving through tree space as part of a hill-climbing or simulated annealing procedure (see, for example, =-=[Fel03]-=-). The crucial feature of the root growth with re-grafting dynamics is that they have a simple projective structure: If one follows the evolution of the points in a rooted subtree of the initial tree ... |

2 |
Note on exact and asymptotic distributions of the parameters of the loop-erased random walk on the complete graph
- Pittel
- 1940
(Show Context)
Citation Context ... special case of Wilson’s loop-erased walk algorithm for generating a uniform spanning tree of a graph [PW98, Wil96, WP96]. Asymptotics of the latter algorithm havesREAL TREES 43 been investigated in =-=[Pit02b]-=-. Wilson’s algorithm was also used in [PR04] to show that the finite-dimensional distributions of the re-scaled uniform random spanning tree for the d-dimensional discrete torus converges to the Brown... |

1 | A proof of the Markov chain theorem - Aldous, Tsoucas - 1989 |

1 | Generating random spanning trees, 30th - Broder - 1989 |

1 | Piecewise deterministic Markov processes, Stochastic Anal - Cai - 1993 |

1 |
Snakes and spiders: Brownian motion on
- Evans
(Show Context)
Citation Context ...s have been objects of intensive study in geometric group theory (see, for example, the surveys [Sha87, Mor92, Sha91, Bes02] and the recent book [Chi01]). Diffusions on an R-tree were investigated in =-=[Eva00]-=-. Some of the results on the space of R-trees obtained in this paper have already been found useful in the study scaling limits of Galton–Watson branching processes in [DLG04]. Once we have an extende... |

1 | On the derivative and the upcrossings of the Rayleigh process - Hasofer - 1970 |

1 | its applications, Group theory from a geometrical viewpoint (Trieste - Dendrology - 1990 |

1 | R-trees and symmetric differences of sets, Europ - Terhalle - 1997 |