On the contraction method with degenerate limit equation.
From MaRDI portal
Publication:1889801
DOI10.1214/009117904000000171zbMath1060.60005arXivmath/0410177OpenAlexW1970018516MaRDI QIDQ1889801
Ralph Neininger, Ludger Rüschendorf
Publication date: 10 December 2004
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0410177
Related Items (13)
One-sided variations on binary search trees ⋮ Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent ⋮ Directional differentiability for supremum-type functionals: statistical applications ⋮ On the number of collisions in beta(\(2, b\))-coalescents ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ On the number of jumps of random walks with a barrier ⋮ On the number of segregating sites for populations with large family sizes ⋮ Asymptotic laws for regenerative compositions: gamma subordinators and the like ⋮ On stochastic recursive equations of sum and max type ⋮ A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree ⋮ One-sided variations on interval trees ⋮ Partial match queries in random quadtrees ⋮ On a functional contraction method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to select a loser
- A fixed point theorem for distributions
- On the distribution for the duration of a randomized leader election algorithm
- A general limit theorem for recursive algorithms and combinatorial structures
- The contraction method for recursive algorithms
- On the analysis of stochastic divide and conquer algorithms
- Distribution of distances in random binary search trees.
- Quickselect and the Dickman Function
- Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
- Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables
- Rates of convergence for Quicksort
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
- Probability metrics and recursive algorithms
- A limit theorem for “quicksort”
This page was built for publication: On the contraction method with degenerate limit equation.