On a functional contraction method
Ralph Neininger,Henning Sulzbach +1 more
TL;DR: This approach is an extension of the so-called contraction method to the space C[0,1] of continuous functions endowed with uniform topology and the space D[ 0,1) of cadlag functions with the Skorokhod topology, and develops the use of the Zolotarev metrics on the spaces C and D.
read more
Abstract: Methods for proving functional limit laws are developed for sequences of stochastic processes which allow a recursive distributional decomposition either in time or space. Our approach is an extension of the so-called contraction method to the space C[0,1] of continuous functions endowed with uniform topology and the space D[0,1] of cadlag functions with the Skorokhod topology. The contraction method originated from the probabilistic analysis of algorithms and random trees where characteristics satisfy natural distributional recurrences. It is based on stochastic fixed-point equations, where probability metrics can be used to obtain contraction properties and allow the application of Banach’s fixed-point theorem. We develop the use of the Zolotarev metrics on the spaces C[0,1] and D[0,1] in this context. Applications are given, in particular, a short proof of Donsker’s functional limit theorem is derived and recurrences arising in the probabilistic analysis of algorithms are discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Polya urns via the contraction method
Margarete Knape,Ralph Neininger +1 more
TL;DR: An approach to analysing the asymptotic behaviour of Pólya urns based on the contraction method is proposed and a new combinatorial discrete-time embedding of the evolution of the urn into random rooted trees is developed.
Pólya Urns Via the Contraction Method
Margarete Knape,Ralph Neininger +1 more
TL;DR: In this paper, a new combinatorial discrete-time embedding of the evolution of the P.olya urn into random rooted trees is developed, which leads to a system of recursive distributional equations which capture the distributions of the numbers of balls of each colour.
•Posted Content
Partial match queries in random quadtrees
TL;DR: An approach is developed based on the analysis of the cost of any fixed query, which permits to describe a limit process for the costs $C_n(x)$ as $x$ varies in $[0,1]$; one of the consequences is that $E{\max_{x\in [ 0,1]} C_n (x)} \sim \gamma n^\beta$.
•Posted Content
Higher moments of Banach space valued random variables
Svante Janson,Sten Kaijser +1 more
TL;DR: In this article, the authors define the moment of a random variable as the expectation of its tensor power, and prove various preliminary results on e.g. measurability in D[0,1]$ that we need.
16
The dual tree of a recursive triangulation of the disk
Nicolas Broutin,Henning Sulzbach +1 more
TL;DR: It is proved that, when properly rescaled, the planar dual of the discrete lamination converges almost surely in the Gromov-Hausdorff sense to a limit real tree $\mathscr{T}$, which is encoded by $\mathScr{M}$.
14
References
Heuristic Approach to the Kolmogorov-Smirnov Theorems
TL;DR: In this article, the authors present a heuristic reasoning approach to prove the existence of limiting distributions for large samples of various measures of the discrepancy between empirical and true distribution functions, which are then used for the numerical evaluation of these limiting distributions.
Stein's method for diffusion approximations
TL;DR: In this article, an appropriate analogue of the one-dimensional Stein equation is derived, and the necessary properties of its solutions are established, applied to the partial sums of stationary sequences and of dissociated arrays, to a process version of the Wald-Wolfowitz theorem and to the empirical distribution function.
302
The contraction method for recursive algorithms
Uwe Rösler,Ludger Rüschendorf +1 more
TL;DR: A new quite general model for branching dynamical systems is introduced and the contraction method can be applied in this model and this model includes many classical examples of random trees and gives a general frame for further applications.
193
Related Papers (5)
Uwe Rösler,Ludger Rüschendorf +1 more
Patrick Billingsley
- 01 Jan 1968
Philippe Flajolet,Robert Sedgewick +1 more
- 01 Jan 2009