Voronoi cells in random split trees

DOI10.5802/ahl.195zbMATH Open1545.05198MaRDI QIDQ6584605

Alexander Drewitz, Markus Heydenreich, Cécile Mailler

Publication date: 8 August 2024

Published in: Annales Henri Lebesgue (Search for Journal in Brave)

zbMATH Keywords

profilefringe treescompetition processesrandom split treesVoronoi cells in graphs

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• The winner takes it all
• Novel characteristics of split trees by use of renewal theory
• Measure-valued Pólya urn processes
• Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
• The total path length of split trees
• Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
• The profile of binary search trees
• On a conjecture by Chapuy about Voronoï cells in large maps
• Width of a scale-free tree
• Universal Limit Laws for Depths in Random Trees
• On the profile of random trees
• Probability: A Graduate Course
• Competing first passage percolation on random regular graphs
• The fluctuations of the giant cluster for percolation on random split trees
• Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
• On tessellations of random maps and the \(t_g\)-recurrence
• The asymptotic distribution of cluster sizes for supercritical percolation on random split trees

This page was built for publication: Voronoi cells in random split trees