Related papers: On a functional contraction method
The local (central) limit theorem precisely describes the behavior of iterated convolution powers of a probability distribution on the $d$-dimensional integer lattice, $\mathbb{Z}^d$. Under certain mild assumptions on the distribution, the…
We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…
Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in this paper. While the performance of radix sort and tries under…
We establish effective convergence rates in the Doeblin-Lenstra law, describing the limiting distribution of approximation coefficients arising from continued fraction convergents of a typical real number. More generally, we prove…
The main result of this paper is a functional limit theorem for the sine-process. In particular, we study the limit distribution, in the space of trajectories, for the number of particles in a growing interval. The sine-process has the…
We study the convergence of centered and normalized sums of i.i.d. random elements of the space $\mathcal{D}$ of c{{\'a}}dl{{\'a}}g functions endowed with Skorohod's $J\_1$ topology, to stable distributions in $\mathcal D$. Our results are…
Under an appropriate regular variation condition, the affinely normalized partial sums of a sequence of independent and identically distributed random variables converges weakly to a non-Gaussian stable random variable. A functional version…
Skorokhod's J1 and M1 topologies are standard tools in proving limit theorems for stochastic processes. Motivated by applications, we extend these topologies so that they are capable of describing the convergence of a sequence of functions…
Stochastic Approximation (SA) is a popular approach for solving fixed-point equations where the information is corrupted by noise. In this paper, we consider an SA involving a contraction mapping with respect to an arbitrary norm, and show…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…
A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…
Stochastic policies (also known as relaxed controls) are widely used in continuous-time reinforcement learning algorithms. However, executing a stochastic policy and evaluating its performance in a continuous-time environment remain open…
We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…
We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which…
This paper provides convergence analysis for the approximation of a class of path-dependent functionals underlying a continuous stochastic process. In the first part, given a sequence of weak convergent processes, we provide a sufficient…
In this article we derive a self-normalized functional limit theorem for strictly stationary linear processes with i.i.d. heavy-tailed innovations and random coefficients under the condition that all partial sums of the series of…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of…
\noindent The paper establishes weak convergence in $C[0,1]$ of normalized stochastic processes, generated by Toeplitz type quadratic functionals of a continuous time Gaussian stationary process, exhibiting long-range dependence. Both…