Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
type: Item
instance of: scholarly article
title: Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
zbMATH Open document ID: 1484.68057
DOI: 10.1007/978-3-030-76657-3_2
author: Cecilia Holmgren
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 60J85
Mathematics Subject Classification ID: 60K05
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 7450102
zbMATH Keywords: random trees
zbMATH Keywords: split trees
zbMATH Keywords: sorting algorithms
zbMATH Keywords: Quicksort
zbMATH Keywords: binary search tree
zbMATH Keywords: renewal theory
zbMATH Keywords: contraction method
zbMATH Keywords: limit laws
zbMATH Keywords: size
zbMATH Keywords: depths
zbMATH Keywords: height
zbMATH Keywords: total path length
zbMATH Keywords: inversions
zbMATH Keywords: cuttings
zbMATH Keywords: bond percolation
MaRDI profile type: Publication
full work available at URL: 978-3-030-76657-3 2
OpenAlex ID: W3160283760
cites work: Cutting down trees with a Markov chainsaw
cites work: Embedding small digraphs and permutations in binary trees and split trees
cites work: Q3026011
cites work: Emergence of Scaling in Random Networks
cites work: Percolation on random recursive trees
cites work: Almost giant clusters for percolation on large trees with logarithmic heights
cites work: On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
cites work: Sizes of the largest clusters for supercritical percolation on random recursive trees
cites work: Supercritical percolation on large scale-free random trees
cites work: Yule processes with rare mutation and their applications to percolation on \(b\)-ary trees
cites work: The \(k\)-cut model in deterministic and random trees
cites work: Percolation
cites work: Asymptotic normality of the size of the giant component in a random hypergraph
cites work: Q3266051
cites work: Large deviations for the weighted height of an extended class of trees
cites work: Weighted height of random trees
cites work: The total path length of split trees
cites work: Inversions in Split Trees and Conditional Galton–Watson Trees
cites work: \(k\)-cut on paths and some trees
cites work: Cutting resilient networks -- complete binary trees
cites work: A note on the height of binary search trees
cites work: Applications of the theory of records in the study of random trees
cites work: On the height of random m‐ary search trees
cites work: Q4226454
cites work: Universal Limit Laws for Depths in Random Trees
cites work: Random Trees
cites work: A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
cites work: Q5624436
cites work: Random recursive trees and the Bolthausen-Sznitman coalescent
cites work: Quicksort
cites work: Random Records and Cuttings in Binary Search Trees
cites work: A weakly 1-stable distribution for the number of random records and cuttings in split trees
cites work: Novel characteristics of split trees by use of renewal theory
cites work: Q3154684
cites work: Random cutting and records in deterministic and random trees
cites work: Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
cites work: Q2774021
cites work: Q4349924
cites work: Cutting down random trees
cites work: On the internal path length ofd-dimensional quad trees
cites work: A limit theorem for “quicksort”
cites work: On the analysis of stochastic divide and conquer algorithms
cites work: Dynamics of the evolving Bolthausen-Sznitman coalescent
cites work: On the normality of giant components

Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey (cites work)
cites work: Q5615819