The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity

Abstract

We study the inhomogeneous continuum random trees (ICRT) that arise as weak limits of birthday trees. We give a description of the exploration process, a function defined on [0,1] that encodes the structure of an ICRT, and also of its width process, determining the size of layers in order of height. These processes turn out to be transformations of bridges with exchangeable increments, which have already appeared in other ICRT related topics such as stochastic additive coalescence. The results rely on two different constructions of birthday trees from processes with exchangeable increments, on weak convergence arguments, and on general theory on continuum random trees.

38 pages, 7 figures

Cited by in corpus (18)

• Limit of normalized quadrangulations: The Brownian map
• Scaling limits of random bipartite planar maps with a prescribed degree sequence
• Universality for critical heavy-tailed network models: Metric structure of maximal components
• On scaling limits of random trees and maps with a prescribed degree sequence
• Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
• Dini derivatives for Exchangeable Increment processes and applications
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• The quantile transform of a simple walk
• Global lower mass-bound for critical configuration models in the heavy-tailed regime
• On the profile of trees with a given degree sequence
• Limit of trees with fixed degree sequence
• On breadth-first constructions of scaling limits of random graphs and random unicellular maps
• Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
• Scaling limits for some random trees constructed inhomogeneously
• Epidemics on critical random graphs with heavy-tailed degree distribution
• Probabilistic and fractal aspects of Levy trees
• Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon
• Cutting down $\mathbf{p}$-trees and inhomogeneous continuum random trees