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