Random cutting and records in deterministic and random trees
From MaRDI portal
Publication:3419586
DOI10.1002/rsa.20086zbMath1120.05083MaRDI QIDQ3419586
Publication date: 7 February 2007
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20086
Galton-Watson tree; continuum random tree; random cutting; random records; height of a random tree; width of a random tree
05C80: Random graphs (graph-theoretic aspects)
60B10: Convergence of probability measures
60F99: Limit theorems in probability theory
Related Items
A new combinatorial representation of the additive coalescent, Simply Generated Unrooted Plane Trees, Unnamed Item, Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees, Accessibility percolation on random rooted labeled trees, Cutting Edges at Random in Large Recursive Trees, The distance profile of rooted and unrooted simply generated trees, The distribution of the number of automorphisms of random trees, A modification of the random cutting model, The uncover process for random labeled trees, Scaling Limits of Markov-Branching Trees and Applications, Models of random subtrees of a graph, Asymptotic behaviour of the first positions of uniform parking functions, On moment sequences and mixed Poisson distributions, The cut-tree of large Galton-Watson trees and the Brownian CRT, Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, Cutting down trees with a Markov chainsaw, Condensation in nongeneric trees, Precise logarithmic asymptotics for the right tails of some limit random variables for random trees, The total path length of split trees, Generalized gamma approximation with rates for urns, walks and trees, Percolation on random triangulations and stable looptrees, A decorated tree approach to random permutations in substitution-closed classes, Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process, Random enriched trees with applications to random graphs, Scaling limit of a limit order book model via the regenerative characterization of Lévy trees, Fires on trees, Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees, Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey, \(k\)-cut model for the Brownian continuum random tree, The sum of powers of subtree sizes for conditioned Galton-Watson trees, Distinct fringe subtrees in random trees, The \(k\)-cut model in deterministic and random trees, Cutting resilient networks -- complete binary trees, A central limit theorem for almost local additive tree functionals, Inverting the cut-tree transform, The cut-tree of large recursive trees, The vertex-cut-tree of Galton-Watson trees converging to a stable tree, Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees, Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent, Fringe analysis of plane trees related to cutting and pruning, Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees, \(k\)-cut on paths and some trees, Diameters of random circulant graphs, The forest associated with the record process on a Lévy tree, THE RANGE OF TREE-INDEXED RANDOM WALK, Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees, A Construction of a β-Coalescent via the Pruning of Binary Trees, Sizes of the largest clusters for supercritical percolation on random recursive trees, A weakly 1-stable distribution for the number of random records and cuttings in split trees, Random Records and Cuttings in Binary Search Trees, A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
Cites Work
