Novel characteristics of split trees by use of renewal theory
From MaRDI portal
Publication:428606
DOI10.1214/EJP.v17-1723zbMath1244.05058arXiv1005.4594OpenAlexW2081564088MaRDI QIDQ428606
Publication date: 22 June 2012
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.4594
Analysis of algorithms (68W40) Trees (05C05) Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Data structures (68P05)
Related Items (12)
Tree limits and limits of random trees ⋮ The asymptotic distribution of cluster sizes for supercritical percolation on random split trees ⋮ \(k\)-cut on paths and some trees ⋮ The \(k\)-cut model in deterministic and random trees ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ The total path length of split trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ Random Recursive Trees and Preferential Attachment Trees are Random Split Trees ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey ⋮ Renewal theory in the analysis of tries and strings
This page was built for publication: Novel characteristics of split trees by use of renewal theory