Martingales and profile of binary search trees

From MaRDI portal
Publication:850350

DOI10.1214/EJP.v10-257zbMath1109.60059arXivmath/0410211OpenAlexW2035607334MaRDI QIDQ850350

N. E. Zubov

Publication date: 3 November 2006

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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




Related Items (23)

Limit Theorems for Subtree Size Profiles of Increasing TreesA sprouting tree model for random boolean functionsEdgeworth expansions for profiles of lattice branching random walksShape Measures of Random Increasing k-treesGeneral Edgeworth expansions with applications to profiles of random treesThe degree profile of random Pólya treesWeak convergence of the number of vertices at intermediate levels of random recursive treesCutting Edges at Random in Large Recursive TreesProcess convergence for the complexity of radix selection on Markov sourcesRandom walks with preferential relocations and fading memory: a study through random recursive treesA functional limit theorem for the profile of random recursive treesThe empirical mean position of a branching Lévy processSearch trees: metric aspects and strong limit theoremsInterplay of analysis and probability in applied mathematics. Abstracts from the workshop held February 11--17, 2018Complex Burgers Equation: A Probabilistic PerspectiveA functional limit theorem for the profile of search treesOn martingale tail sums for the path length in random treesA survey of max-type recursive distributional equationsA functional limit theorem for the profile of \(b\)-ary treesGeometry of weighted recursive and affine preferential attachment treesBranching random walks on binary search trees: convergence of the occupation measureThe height of Mallows treesA Strong Law for the Size of Yule M-Oriented Recursive Trees




This page was built for publication: Martingales and profile of binary search trees