Related papers: A central limit theorem for a card shuffling probl…

Let $\xi_1,\xi_2,\ldots$ be independent, identically distributed random variables with infinite mean $\mathbf E[|\xi_1|]=\infty.$ Consider a random walk $S_n=\xi_1+\cdots+\xi_n$, a stopping time $\tau=\min\{n\ge 1: S_n\le 0\}$ and let…

Consider shuffling a deck of $n$ cards, labeled $1$ through $n$, as follows: at each time step, pick one card uniformly with your right hand and another card, independently and uniformly with your left hand; then swap the cards. How long…

The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…

In this article, we consider a sequence $(N_n)_{n \geq 1}$ of point processes, whose points lie in a subset $E$ of $\bR \verb2\2 \{0\}$, and satisfy an asymptotic independence condition. Our main result gives some necessary and sufficient…

We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…

The asymptotics of the first rows and columns of random Young diagrams corresponding to extremal characters of the infinite symmetric group is studied. We consider rows and columns with linear growth in $n$, the number of boxes of random…

In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the…

Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent centered stationary Gaussian processes with unit variance and almost surely continuous sample paths. For given positive constants $u,T$, define the set of conjunctions $C_{[0,T],u}:=\{t\in…

We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…

We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…

Consider a $N\times n$ random matrix $Y_n=(Y_{ij}^{n})$ where the entries are given by $$ Y_{ij}^{n}=\frac{\sigma_{ij}(n)}{\sqrt{n}} X_{ij}^{n} $$ the $X_{ij}^{n}$ being centered, independent and identically distributed random variables…

Given a Coxeter system of large type we prove a non--commutative central limit theorem: After normalisation with the square root of n the characteristic function of the set of the first n generators tends in distribution to Wigners…

Local increases in the mean of a random field are detected (conservatively) by thresholding a field of test statistics at a level $u$ chosen to control the tail probability or $p$-value of its maximum. This $p$-value is approximated by the…

We prove an asymptotic Cram\'er's theorem, that is, if the sequence $(X_{n}+ Y_{n})_{n\geq 1}$ converges in law to the standard normal distribution and for every $n\geq 1$ the random variables $X_{n}$ and $Y_{n}$ are independent, then…

Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent copies of a stationary process $\{X(t), t\ge0\}$. For given positive constants $u,T$, define the set of $r$th conjunctions $ C_{r,T,u}:= \{t\in [0,T]: X_{r:n}(t) > u\}$ with $X_{r:n}(t)$…

This paper provides central limit theorems for the wavelet packet decomposition of stationary band-limited random processes. The asymptotic analysis is performed for the sequences of the wavelet packet coefficients returned at the nodes of…

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…

We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…