Recursive self-similarity for random trees, random triangulations and Brownian excursion

From MaRDI portal
Publication:1336555

DOI10.1214/aop/1176988720zbMath0808.60017OpenAlexW2016099245MaRDI QIDQ1336555

David J. Aldous

Publication date: 12 March 1995

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

Full work available at URL: https://doi.org/10.1214/aop/1176988720




Related Items (28)

Linear-sized independent sets in random cographs and increasing subsequences in separable permutationsDissecting the circle, at randomConvergence of uniform noncrossing partitions toward the Brownian triangulationRandom non-crossing plane configurations: A conditioned Galton-Watson tree approachOn the distribution of betweenness centrality in random treesThe shape of random pattern-avoiding permutationsMaximum agreement subtrees and Hölder homeomorphisms between Brownian treesA recursive distributional equation for the stable treePopulation dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022Central limit theorems for the spectra of classes of random fractalsThe Aldous chain on cladograms in the diffusion limitRandom stable laminations of the diskRandom recursive triangulations of the disk via fragmentation theoryOn the number of large triangles in the Brownian triangulation and fragmentation processesScaling limits and influence of the seed graph in preferential attachment treesVolume growth and heat kernel estimates for the continuum random treeSelf-similarity and spectral asymptotics for the continuum random treeTree-based models for random distribution of massSelf-similar real trees defined as fixed points and their geometric propertiesSpaces of algebraic measure trees and triangulations of the circleThe geometry of random minimal factorizations of a long cycle via biconditioned bitype random treesOn the Brownian separable permutonInverting the cut-tree transformThe dual tree of a recursive triangulation of the diskThe standard additive coalescentOn a functional contraction methodOn the Largest Common Subtree of Random Leaf-Labeled Binary TreesRayleigh processes, real trees, and root growth with re-grafting




This page was built for publication: Recursive self-similarity for random trees, random triangulations and Brownian excursion