Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees

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

Publication:693717

DOI10.1214/11-AOP686zbMath1259.60033arXiv1003.3632MaRDI QIDQ693717

Bénédicte Haas, Grégory Miermont

Publication date: 10 December 2012

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

Full work available at URL: https://arxiv.org/abs/1003.3632




Related Items

Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson treesBivariate Markov chains converging to Lamperti transform Markov additive processesTree limits and limits of random treesThe distribution of height and diameter in random non-plane binary treesExcursion theory for Brownian motion indexed by the Brownian treeZooming in at the root of the stable treeSurprising identities for the greedy independent set on Cayley treesScaling limits of stochastic processes associated with resistance formsDissecting the circle, at randomAn asymptotic analysis of labeled and unlabeled \(k\)-treesThe CRT is the scaling limit of random dissectionsProbability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.Random enriched trees with applications to random graphsThe cut-tree of large Galton-Watson trees and the Brownian CRTSchröder’s problems and scaling limits of random treesSelf-similar growth fragmentations as scaling limits of Markov branching processesScaling limits of random Pólya treesThe stable trees are nestedFires on treesForward-backward stochastic differential equations and controlled McKean-Vlasov dynamicsGromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson treesGraphon convergence of random cographsScaling limits of slim and fat treesLimits of random tree-like discrete structuresThe scaling limit of a critical random directed graphOn the Wiener index of random treesA down‐up chain with persistent labels on multifurcating treesGrowing random graphs with a preferential attachment structureStable graphs: distributions and line-breaking constructionA binary embedding of the stable line-breaking constructionScaling Limits of Markov-Branching Trees and ApplicationsScaling limits of \(k\)-ary growing treesTail asymptotics for extinction times of self-similar fragmentationsOn random trees and forestsThe degree profile of random Pólya treesCutting Edges at Random in Large Recursive TreesSelf-similar scaling limits of non-increasing Markov chainsCutting down trees with a Markov chainsawScaling limits and influence of the seed graph in preferential attachment treesScaling limits for some random trees constructed inhomogeneouslyThe shape of unlabeled rooted random treesScaling limits of multi-type Markov branching treesThe gap between Gromov-Vague and Gromov-Hausdorff-vague topologyRecursive construction of continuum random treesAlmost sure convergence of vertex degree densities in the vertex splitting modelSimply Generated Unrooted Plane TreesGeneralized Markov branching treesGlobal regime for general additive functionals of conditioned Bienaymé-Galton-Watson treesGraph limits of random graphs from a subset of connected k‐treesScaling limits for a family of unrooted treesInverting the cut-tree transformThe dual tree of a recursive triangulation of the diskThe cut-tree of large recursive treesScaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given setSizes of the largest clusters for supercritical percolation on random recursive trees



Cites Work


This page was built for publication: Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees