Probability and Real Trees

182 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

THE CONTOUR OF SPLITTING TREES IS A LÉVY PROCESS (2007, background): “and v, that is, the sequence wwith highest generation such that w≺ uand w≺ v. 2.2 Chronological trees Chronological trees are particular instances of R-trees. For further reading on R-trees, see e.g. [9, 6, 16] and the references therein. The R-trees we consider here can roughly be seen as the set o”
Tree metrics and their Lipschitz-free spaces (2009, background): “It is fairly straightfoward to check that metrics induced by R-trees indeed satisfy this condition; for a proof of the converse, see [3], Chap.”
Recent progress in coalescent theory (2009, unknown): “More details concerning the Gromov-Hausdorff topology and this convergence can be found, for instance, in Evans’ Saint Flour notes [78].”
The continuum limit of critical random graphs (2009, background): “Here we will concentrate on the most famous random example of such trees, Aldous’ Brownian continuum random tree (see [4, 5, 6]), and encourage the interested reader to look at [18, 21, 33] and the references therein for more general cases.”
Itô’s excursion theory and random trees (2010, background): “Section 2 of [19], and [11] for a general overview of real trees in probability theory).”