Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees

From MaRDI portal
Publication:521300

DOI10.1214/16-PS272zbMath1406.60120arXiv1601.03691OpenAlexW2962939975MaRDI QIDQ521300

Svante Janson, Cecilia Holmgren

Publication date: 7 April 2017

Published in: Probability Surveys (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03691




Related Items (24)

Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment treesTree limits and limits of random treesCentral limit theorems for additive functionals and fringe trees in triesON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREESCondensation phenomena in preferential attachment trees with neighbourhood influenceRenewal theory for iterated perturbed random walks on a general branching process tree: intermediate generationsLocal weak convergence for PageRankSharp bound on the truncated metric dimension of treesDistributions of cherries and pitchforks for the Ford modelA model for an epidemic with contact tracing and cluster isolation, and a detection paradoxRandom matrices and random graphsDegree distributions in recursive trees with fitnessesOn several properties of a class of hybrid recursive treesDegree centrality and root finding in growing random networksFluctuation bounds for continuous time branching processes and evolution of growing trees with a change pointModels of random subtrees of a graphOn the independence number of some random treesThe existence of a giant cluster for percolation on large Crump–Mode–Jagers treesThe fluctuations of the giant cluster for percolation on random split treesMetric dimension of critical Galton-Watson trees and linear preferential attachment treesLocal convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)Random Recursive Trees and Preferential Attachment Trees are Random Split TreesLimiting probabilities for vertices of a given rank in 1-2 treesA decorated tree approach to random permutations in substitution-closed classes




This page was built for publication: Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees