Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Janson, Sigurdur Stef'ansson (2012)
Scaling limits of random planar maps with a unique large faceAnnals of Probability, 43
Daphn'e Dieuleveut (2013)
The vertex-cut-tree of Galton–Watson trees converging to a stable treeAnnals of Applied Probability, 25
T. Duquesne, Matthias Winkel (2005)
Growth of Lévy treesProbability Theory and Related Fields, 139
J. Rémy (1985)
Un Procédé Itératif de Dénombrement D'arbres Binaires et Son Application A Leur Génération AléatoireRAIRO Theor. Informatics Appl., 19
(1948)
Local limit and volume growth of Markov - Branching trees
Bo Chen, Matthias Winkel (2009)
Restricted exchangeable partitions and embedding of associated hierarchies in continuum random treesAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 49
J. Bertoin (2015)
The cut-tree of large recursive treesAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 51
J. Bertoin (2006)
Random fragmentation and coagulation processes
G. Miermont (2004)
Self-similar fragmentations derived from the stable tree II: splitting at nodesProbability Theory and Related Fields, 131
J. Geluk (1981)
Π-regular variation, 82
T. Duquesne (2010)
The exact packing measure of Lévy treesStochastic Processes and their Applications, 122
R. Abraham, Jean-François Delmas (2013)
Local limits of conditioned Galton-Watson trees: the condensation caseElectronic Journal of Probability, 19
Bénédicte Haas, R. Stephenson (2016)
Bivariate Markov chains converging to Lamperti transform Markov additive processesStochastic Processes and their Applications
(1977)
The asymptotic distribution of the maximum size of trees in a random forest
D. Aldous (1991)
Stochastic Analysis: The Continuum random tree II: an overview
T. Móri (2002)
On random treesStudia Scientiarum Mathematicarum Hungarica, 39
Multitype Markov Branching trees
Alessandra Caraceni (2014)
The Scaling Limit of Random Outerplanar MapsarXiv: Probability
N. Curien, Bénédicte Haas, I. Kortchemski (2013)
The CRT is the scaling limit of random dissectionsRandom Structures & Algorithms, 47
G. Miermont (2006)
Invariance principles for spatial multitype Galton–Watson treesAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 44
(1941)
Uber das logarithmisch normale Verteilungsgesetz der Dimensionen der Teilchen bei Zerstuckelung
I. Kortchemski (2011)
A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson TreesarXiv: Probability
Benedikt Stufler (2014)
The continuum random tree is the scaling limit of unlabeled unrooted treesRandom Structures & Algorithms, 55
M. Drmota (2009)
Random Trees: An Interplay between Combinatorics and Probability
Bénédicte Haas, G. Miermont (2009)
Self-similar scaling limits of non-increasing Markov chainsBernoulli, 17
Jérémie Bettinelli (2011)
Scaling Limit of Random Planar Quadrangulations with a BoundaryarXiv: Probability
A. Panholzer (2006)
Cutting down very simple treesQuaestiones Mathematicae, 29
S. Evans, J. Pitman, A. Winter (2004)
Rayleigh processes, real trees, and root growth with re-graftingProbability Theory and Related Fields, 134
D Aldous (1991)
1I. Ann. Probab., 19
T. Duquesne, J. Gall (2005)
The Hausdor measure of stable treesarXiv: Probability
P. Marchal (2003)
Constructing a sequence of random walks strongly converging to Brownian motion
J. Bertoin, G. Miermont (2012)
The cut-tree of large Galton-Watson trees and the Brownian CRTarXiv: Probability
C. Goldschmidt, Bénédicte Haas (2014)
A line-breaking construction of the stable treesElectronic Journal of Probability, 20
N. Curien, I. Kortchemski (2013)
Percolation on random triangulations and stable looptreesProbability Theory and Related Fields, 163
N. Curien, Bénédicte Haas (2012)
The stable trees are nestedProbability Theory and Related Fields, 157
T. Duquesne, J. Gall (2005)
Random Trees, Levy Processes and Spatial Branching ProcessesarXiv: Probability
S. Evans (2008)
Probability and Real Trees
R. Abraham, Jean-François Delmas (2013)
Local limits of conditioned Galton-Watson trees: the infinite spine caseElectronic Journal of Probability, 19
S. Krantz (1989)
Fractal geometryThe Mathematical Intelligencer, 11
D. Aldous (1991)
The Continuum Random Tree IIIAnnals of Probability, 19
M. Albenque, J. Marckert (2007)
Some families of increasing planar mapsElectronic Journal of Probability, 13
J. Bertoin, N. Curien, I. Kortchemski (2015)
Random planar maps & growth-fragmentationsarXiv: Probability
J. Bertoin, I. Kortchemski (2014)
Self-similar scaling limits of Markov chains on the positive integersarXiv: Probability
Bénédicte Haas, R. Stephenson (2014)
Scaling limits of k-ary growing treesAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 51
N. Curien, T. Duquesne, I. Kortchemski, I. Manolescu (2014)
Scaling limits and influence of the seed graph in preferential attachment treesArXiv, abs/1406.1758
R. Abraham, Jean-François Delmas, Patrick Hoscheit (2012)
A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spacesElectronic Journal of Probability, 18
N. Broutin, Minmin Wang (2017)
Cutting down p-trees and inhomogeneous continuum random trees
K. Panagiotou, Benedikt Stufler, Kerstin Weller (2014)
Scaling Limits of Random Graphs from Subcritical ClassesarXiv: Probability
N. Curien, I. Kortchemski (2013)
Random stable looptreesElectronic Journal of Probability, 19
Bénédicte Haas, G. Miermont (2004)
The Genealogy of Self-similar Fragmentations with Negative Index as a Continuum Random TreeElectronic Journal of Probability, 9
G. Pólya (1937)
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 68
J. Gall (2006)
Random real treesarXiv: Probability
L. Addario-Berry, N. Broutin, C. Goldschmidt (2009)
The continuum limit of critical random graphsProbability Theory and Related Fields, 152
M. Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske (2010)
Boltzmann Samplers, Pólya Theory, and Cycle PointingArXiv, abs/1003.4546
T. Duquesne, J. Gall (2005)
Probabilistic and fractal aspects of Lévy treesProbability Theory and Related Fields, 131
S. Kijima, Tomomi Matsui (2006)
Polynomial time perfect sampling algorithm for two-rowed contingency tables (Supported by Superrobust Computation Project of the 21st Century COE Program “Information Science and Technology Strategic Core.”)Random Structures and Algorithms, 29
R. Otter (1948)
The Number of TreesAnnals of Mathematics, 49
Gabriel Berzunza (2016)
On scaling limits of multitype Galton-Watson trees with possibly infinite variancearXiv: Probability
Bénédicte Haas, G. Miermont, J. Pitman, Matthias Winkel (2006)
Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic modelsAnnals of Probability, 36
(2014)
Aspects of Random Maps, Lecture notes of the 2014 Saint–Flour Probability Summer School
P. Flajolet, R. Sedgewick (2009)
Analytic Combinatorics
Daniel Ford (2005)
Probabilities on cladograms: introduction to the alpha modelarXiv: Probability
K. Panagiotou, Benedikt Stufler (2015)
Scaling limits of random Pólya treesProbability Theory and Related Fields, 170
J. Bertoin (2014)
Sizes of the largest clusters for supercritical percolation on random recursive treesRandom Structures & Algorithms, 44
J. Pitman (1997)
Coalescent Random Forests
N. Broutin, P. Flajolet (2010)
The distribution of height and diameter in random non‐plane binary treesRandom Structures & Algorithms, 41
Benedikt Stufler (2015)
Random Enriched Trees with Applications to Random GraphsElectron. J. Comb., 25
D. Croydon, B. Hambly (2010)
Spectral asymptotics for stable treesElectronic Journal of Probability, 15
N. Broutin, Cécile Mailler (2015)
And/or trees: A local limit point of viewRandom Structures & Algorithms, 53
L. Addario-Berry, N. Broutin, C. Goldschmidt, G. Miermont (2013)
The local weak limit of the minimum spanning tree of the complete grapharXiv: Probability
J. Bertoin (2010)
Fires on treesAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 48
Douglas Rizzolo (2011)
Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given setarXiv: Probability
L. Addario-Berry, N. Broutin, Cecilia Holmgren (2011)
Cutting down trees with a Markov chainsawarXiv: Probability
J. Pitman (2006)
Combinatorial Stochastic Processes, 1875
S. Janson (2011)
Simply generated trees, conditioned Galton–Watson trees, random allocations and condensationProbability Surveys, 9
N. Broutin, L. Devroye, E. McLeish, M. Salle (2008)
The height of increasing treesRandom Structures & Algorithms, 32
(2005)
Lectures from the 35th Summer School on Probability Theory
Bénédicte Haas, J. Pitman, Matthias Winkel (2007)
Spinal partitions and invariance under re-rooting of continuum random treesAnnals of Probability, 37
D. Aldous, Robin Pemantle (1996)
Random Discrete Structures
J. Marckert, G. Miermont (2009)
The CRT is the scaling limit of unordered binary treesRandom Structures & Algorithms, 38
J. Bertoin (2002)
Self-similar fragmentationsAnnales De L Institut Henri Poincare-probabilites Et Statistiques, 38
R. Bass (2011)
Convergence of probability measures
R. Wolpert (2000)
Lévy Processes
Bo Chen, Daniel Ford, Matthias Winkel (2008)
A new family of Markov branching trees: the alpha-gamma modelElectronic Journal of Probability, 14
S. Stefansson (2009)
The infinite volume limit of Ford's alpha modelarXiv: Mathematical Physics
J. Gall, Y. Jan (1998)
Branching processes in Lévy processes: the exploration processAnnals of Probability, 26
K. Falconer (1990)
Fractal Geometry: Mathematical Foundations and Applications
(2008)
and M
T. Duquesne (2003)
A limit theorem for the contour process of condidtioned Galton--Watson treesAnnals of Probability, 31
R Abraham (2013)
1Electron. J. Probab., 18
Loïc Raphélis (2014)
Scaling limit of multitype Galton-Watson trees with infinitely many typesarXiv: Probability
Bénédicte Haas, G. Miermont (2010)
Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered treesAnnals of Probability, 40
T. Duquesne, J. Gall (2009)
On the re-rooting invariance property of Lévy treesElectronic Communications in Probability, 14
Camille Pagnard (2016)
Local limits of Markov Branching trees and their volume growtharXiv: Probability
P. Marchal (2008)
A note on the fragmentation of a stable treeDiscrete Mathematics & Theoretical Computer Science
R. Stephenson (2013)
General fragmentation treesElectronic Journal of Probability, 18
N. Broutin, Minmin Wang (2014)
Reversing the cut tree of the Brownian continuum random treearXiv: Probability
D. Aldous (1996)
PROBABILITY DISTRIBUTIONS ON CLADOGRAMS, 76
G. Miermont (2003)
Self-similar fragmentations derived from the stable tree IProbability Theory and Related Fields, 127
M. Drmota, Bernhard Gittenberger (2010)
The shape of unlabeled rooted random treesEur. J. Comb., 31
I. Kortchemski (2011)
Invariance principles for Galton-Watson trees conditioned on the number of leavesStochastic Processes and their Applications, 122
N. Broutin, Minmin Wang (2014)
Cutting down $\mathbf p$-trees and inhomogeneous continuum random treesArXiv, abs/1408.0144
S. Taylor (1998)
LÉVY PROCESSES (Cambridge Tracts in Mathematics 121)Bulletin of The London Mathematical Society, 30
[The goal of these lecture notes is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.]
Published: Jun 27, 2018
Keywords: Random trees; Scaling limits; Self-similar fragmentations; self-similar Markov processes; 05C05; 60F17; 60J05; 60J25; 60J80
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.