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
•Posted Content
Process convergence for the complexity of Radix Selection on Markov sources
TL;DR: In this article, the rank complexity of Radix Selection is studied as a stochastic process indexed by the set of infinite strings over the given alphabet, and a limit theorem with a centered Gaussian process as limit is derived.
A Limit Theorem for Radix Sort and Tries with
Kevin Leckey,Ralph Neininger,Wojciech Szpankowski,W. Lafayette +3 more
- 01 Jan 2015
TL;DR: In this article, the authors consider a more realistic model where words are generated by a Markov source and prove a central limit theorem for the complexity of radix sort and for the external path length in a trie.
The Brownian continuum random tree as the unique solution to a fixed point equation
TL;DR: In this paper, a new characterization of Aldous' Brownian continuum random tree as the unique fixed point of a certain natural operation on continuum trees is given, which gives rise to a recursive distributional equation.
A Limit Theorem for Radix Sort and Tries with Markovian Input
Kevin Leckey,Ralph Neininger,Wojciech Szpankowski +2 more
TL;DR: This paper proves a central limit theorem for radix sort and trie complexity under Markovian input, using a novel combination of contraction method and moment transfer techniques, providing a significant analysis breakthrough for these fundamental data structures and algorithms.
•Posted Content
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
TL;DR: A novel use of the contraction method combined with analytic techniques is used to prove a central limit theorem for the external path length of a trie under a general Markov source.
References
An introduction to probability theory and its applications - 3/E. volume 3
William Feller
- 22 Mar 2002
Abstract: The classic text for understanding complex statistical probability An Introduction to Probability Theory and Its Applications offers comprehensive explanations to complex statistical problems. Delving deep into densities and distributions while relating critical formulas, processes and approaches, this rigorous text provides a solid grounding in probability with practice problems throughout. Heavy on application without sacrificing theory, the discussion takes the time to explain difficult topics and how to use them. This new second edition includes new material related to the substitution of probabilistic arguments for combinatorial artifices as well as new sections on branching processes, Markov chains, and the DeMoivreLaplace theorem.
21.5K
•Book
Stochastic processes
J. L. Doob,Joseph L. Doob +1 more
- 01 Jan 1953
TL;DR: Stochastic processes are probabilistic models of data streams such as speech, audio and video signals, stock market prices, and measurements of physical phenomena by digital sensors such as medical instruments, GPS receivers, or seismographs that are essential for understanding phenomena and processing information.
10.6K
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
8.2K
•Book
Limit Theorems for Stochastic Processes
Jean Jacod,Albert N. Shiryaev +1 more
- 01 Jan 1987
TL;DR: In this article, the General Theory of Stochastic Processes, Semimartingales, and Stochastically Integrals is discussed and the convergence of Processes with Independent Increments is discussed.
6.4K
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