The depth first processes of Galton-Watson trees converge to the same Brownian excursion

From MaRDI portal
Revision as of 18:59, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1431505

DOI10.1214/aop/1055425793zbMath1049.05026OpenAlexW1978667133MaRDI QIDQ1431505

Abdelkader Mokkadem, Jean-François Marckert

Publication date: 10 June 2004

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aop/1055425793




Related Items

Rescaled bipartite planar maps converge to the Brownian mapOn scaling limits of random trees and maps with a prescribed degree sequenceRandom stable-type minimal factorizations of the n-cycleHeight and contour processes of Crump-Mode-Jagers forests. I: general distribution and scaling limits in the case of short edgesParameterised branching processes: a functional version of Kesten \& Stigum theoremLimit of normalized quadrangulations: the Brownian mapSchröder’s problems and scaling limits of random treesThe range of tree-indexed random walk in low dimensionsOn breadth‐first constructions of scaling limits of random graphs and random unicellular mapsConvergence of blanket times for sequences of random walks on critical random graphsScaling limits of slim and fat treesHeight and contour processes of Crump-Mode-Jagers forests. II: the Bellman-Harris universality classA branching process with coalescence to model random phylogenetic networksA phase transition in block-weighted random mapsThe continuum limit of critical random graphsModels of random subtrees of a graphLarge deviation local limit theorems and limits of biconditioned planar mapsOn random trees and forestsThe boundary of random planar maps via looptreesPatterns in Random Permutations Avoiding the Pattern 132Heavy subtrees of Galton-Watson trees with an application to Apollonian networksThe \(k\)-cut model in deterministic and random treesScaling Limits of Random Trees and Random GraphsInvariance principles for random bipartite planar mapsRandom real treesTightness results for infinite-slit limits of the chordal Loewner equationPattern-avoiding permutations and Brownian excursion. II: Fixed pointsThe lineage process in Galton-Watson trees and globally centered discrete snakesAsymptotics of trees with a prescribed degree sequence and applicationsReinforced weak convergence of stochastic processesPattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuationsItô's excursion theory and random treesScaling limit of triangulations of polygonsThe CRT is the scaling limit of unordered binary treesOn \(q\)-functional equations and excursion momentsOn The Limiting Distributions of the Total Height On Families of TreesGeometry of the minimal spanning tree of a random 3-regular graphAn analysis of budgeted parallel search on conditional Galton-Watson treesLadder variables, internal structure of Galton–Watson trees and finite branching random walksIterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensionsThe geometry of random minimal factorizations of a long cycle via biconditioned bitype random treesVertices with fixed outdegrees in large Galton-Watson treesExchangeable interval hypergraphs and limits of ordered discrete structuresConvergence of discrete snakesThe stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees



Cites Work


This page was built for publication: The depth first processes of Galton-Watson trees converge to the same Brownian excursion