Random cutting and records in deterministic and random trees
From MaRDI portal
Recommendations
Cites work
- Brownian excursion conditioned on its local time
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 1245556 (Why is no real title available?)
- scientific article; zbMATH DE number 1246231 (Why is no real title available?)
- scientific article; zbMATH DE number 1349990 (Why is no real title available?)
- scientific article; zbMATH DE number 2046075 (Why is no real title available?)
- scientific article; zbMATH DE number 1552322 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- On the Altitude of Nodes in Random Trees
- Probability: A Graduate Course
- Semi-martingales et grossissement d'une filtration
Cited in
(68)- Applications of the theory of records in the study of random trees
- 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
- A construction of a -coalescent via the pruning of binary trees
- Record process on the continuum random tree
- Fluctuations for the number of records on subtrees of the continuum random tree
- Sizes of the largest clusters for supercritical percolation on random recursive trees
- scientific article; zbMATH DE number 6683495 (Why is no real title available?)
- A weakly 1-stable distribution for the number of random records and cuttings in split trees
- Random records and cuttings in binary search trees
- On moment sequences and mixed Poisson distributions
- scientific article; zbMATH DE number 2127735 (Why is no real title available?)
- scientific article; zbMATH DE number 5560473 (Why is no real title available?)
- A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
- The cut-tree of large Galton-Watson trees and the Brownian CRT
- Cut-Set Sums and Tree Processes
- A note on the probability of cutting a Galton-Watson tree
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Simply generated unrooted plane trees
- A new combinatorial representation of the additive coalescent
- Cutting down trees with a Markov chainsaw
- Asymptotic normality of almost local functionals in conditioned Galton-Watson trees
- Iterative cutting and pruning of planar trees
- Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
- Accessibility percolation on random rooted labeled trees
- The cut-tree of large trees with small heights
- 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
- Condensation in nongeneric trees
- Conditioned Galton-Watson trees: the shape functional, and more on the sum of powers of subtree sizes and its mean
- Invasion percolation on power-law branching processes
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent
- Polynomial invariants for rooted trees related to their random destruction
- Random planar trees and the Jacobian conjecture
- The total path length of split trees
- Quenched worst-case scenario for root deletion in targeted cutting of random recursive 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
This page was built for publication: Random cutting and records in deterministic and random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419586)
