Probability metrics and recursive algorithms
From MaRDI portal
Publication:4850089
DOI10.2307/1428133zbMath0829.60094OpenAlexW2038681797MaRDI QIDQ4850089
Ludger Rüschendorf, Svetlozar T. Rachev
Publication date: 15 January 1996
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1428133
Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (46)
Distribution of distances in random binary search trees. ⋮ Limit laws for partial match queries in quadtrees ⋮ One-sided variations on binary search trees ⋮ On the contraction method with degenerate limit equation. ⋮ Limit theorems for recursive algorithms ⋮ The Weighted Branching Process ⋮ Distances in random digital search trees ⋮ Greedy Search on the Binary Tree with Random Edge-Weights ⋮ Normal limiting distribution of the size of binary interval trees ⋮ Convergence of a branching type recursion with non-stationary immigration ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ Limit laws for two distance-based indices in random recursive tree models ⋮ On the size of paged recursive trees ⋮ DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS ⋮ Kinetic models with randomly perturbed binary collisions ⋮ Limit distribution of the quartet balance index for Aldous’s $(\beta \ge 0)$-model ⋮ Heavy tailed solutions of multivariate smoothing transforms ⋮ On densities for solutions to stochastic fixed point equations ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Weighted height of random trees ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ Perpetuities in Fair Leader Election Algorithms ⋮ The total path length of split trees ⋮ Self-similar solutions in one-dimensional kinetic models: a probabilistic view ⋮ Limiting theorems for the nodes in binary search trees ⋮ Elementary fixed points of the BRW smoothing transforms with infinite number of summands ⋮ Convergence of two-dimensional branching recursions ⋮ A steady-state model for the spread of HIV among drug users ⋮ Weighted branching and a pathwise renewal equation ⋮ On stochastic recursive equations of sum and max type ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Stochastic approximation algorithms: overview and recent trends. ⋮ The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance ⋮ Asymptotic joint normality of counts of uncorrelated motifs in recursive trees ⋮ Limit laws for the Randić index of random binary tree models ⋮ Stochastic fixed-point equations ⋮ Partial match queries in random quadtrees ⋮ Limit distribution of distances in biased random tries ⋮ Random additions in urns of integers ⋮ On the asymptotic behaviour of random recursive trees in random environments ⋮ The dual tree of a recursive triangulation of the disk ⋮ The Smoothing Transform: A Review of Contraction Results ⋮ On a functional contraction method ⋮ Selection by rank inK-dimensional binary search trees ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm ⋮ On binary search tree recursions with monomials as toll functions
This page was built for publication: Probability metrics and recursive algorithms
