Critical beta-splitting, via contraction

DOI10.1214/25-ECP658MaRDI QIDQ7012660zbMATH OpenFDO

Authors Brett Kolesnik

Publication date 17 March 2025

Published in Electronic Communications in Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1214/25-ECP658

zbMATH Keywords

beta-coalescentbeta-splitting treebranching processcentral limit theoremcontraction methoddistributional recurrencephylogenetic treerandom tree

Mathematics Subject Classification ID

Trees (05C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Coalescent processes (60J90) Taxonomy, cladistics, statistics in mathematical biology (92B10)

Cites work

• -coalescents: a survey
• A fixed point theorem for distributions
• A general limit theorem for recursive algorithms and combinatorial structures
• A limit theorem for “quicksort”
• Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
• Asymptotic hitting probabilities for the Bolthausen-Sznitman coalescent
• Asymptotic laws for regenerative compositions: gamma subordinators and the like
• Coalescents with multiple collisions
• scientific article; zbMATH DE number 850224 (Why is no real title available?)
• Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables
• Normal convergence problem? Two moments and a recurrence may be the clues
• On the contraction method with degenerate limit equation.
• On the contraction method with reduced independence assumptions
• On the number of collisions in beta(2, b)-coalescents
• Probability metrics and recursive algorithms
• Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
• Regenerative composition structures
• Regenerative compositions in the case of slow variation: a renewal theory approach
• The contraction method for recursive algorithms
• The general coalescent with asynchronous mergers of ancestral lines
• The harmonic descent chain

Cited in

(2)

• The critical beta-splitting random tree. IV: Mellin analysis of leaf height
• An infinite balls-in-boxes approach to the critical beta-splitting tree: some central limit theorems

This page was built for publication: Critical beta-splitting, via contraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012660)