On a functional contraction method
From MaRDI portal
Publication:2354151
DOI10.1214/14-AOP919zbMath1372.60045arXiv1202.1370OpenAlexW2144905577MaRDI QIDQ2354151
Ralph Neininger, Henning Sulzbach
Publication date: 10 July 2015
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.1370
functional limit theoremcontraction methodDonsker's invariance principlerecursive distributional equationZolotarev metric
Combinatorial probability (60C05) Self-similar stochastic processes (60G18) Functional limit theorems; invariance principles (60F17)
Related Items (15)
The Weighted Branching Process ⋮ Parameterised branching processes: a functional version of Kesten \& Stigum theorem ⋮ Higher moments of Banach space valued random variables ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ The quicksort process ⋮ Process convergence for the complexity of radix selection on Markov sources ⋮ On densities for solutions to stochastic fixed point equations ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Self-similar real trees defined as fixed points and their geometric properties ⋮ All solutions of the stochastic fixed point equation of the Quicksort process ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks ⋮ Stochastic fixed-point equations ⋮ An optimal Berry-Esseen type theorem for integrals of smooth functions ⋮ Partial match queries in random quadtrees ⋮ The dual tree of a recursive triangulation of the disk
Cites Work
- A limit process for partial match queries in random quadtrees and 2-d trees
- The size of random fragmentation trees
- A functional combinatorial central limit theorem
- Stein's method for diffusion approximations
- A fixed point theorem for distributions
- Analytic variations on quadtrees
- Recursive self-similarity for random trees, random triangulations and Brownian excursion
- 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
- On the contraction method with degenerate limit equation.
- Measurability of linear operators in the Skorokhod topology
- A functional limit theorem for the profile of search trees
- On a multivariate contraction method for random recursive structures with applications to Quicksort
- Higher moments of Banach space valued random variables
- Partial match queries in two-dimensional quadtrees: a probabilistic approach
- IDEAL METRICS IN THE PROBLEMS OF PROBABILITY THEORY AND MATHEMATICAL STATISTICS
- Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables
- Partial Match Queries in Random Quadtrees
- Probability metrics and recursive algorithms
- A limit theorem for recursively defined processes in Lp
- A limit theorem for “quicksort”
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On a functional contraction method
