Related papers: Functional CLT for the range of stable random walk…

We show that the centred occupation time process of the origin of a system of critical binary branching random walks in dimension $d\ge 3$, started off either from a Poisson field or in equilibrium, when suitably normalized, converges to a…

We consider the existence of the integrated density of states (IDS) of the Anderson model on the Hilbert space $\ell^2(\mathbb{Z}^d)$ as analogues to the law of large numbers (LLN). In this work, we prove the analogues central limit theorem…

We consider the branching random walks in $d$-dimensional integer lattice with time--space i.i.d. offspring distributions. Then the normalization of the total population is a nonnegative martingale and it almost surely converges to a…

We extend the theory of discrete capacity to critical branching random walk. We introduce branching capacity for any finite subset of $\Z^d, d\geq5$. Analogous to the regular discrete capacity, branching capacity is closely related to the…

We provide complementary results for a family of models with dependence on their previous $k$-sum. Using a martingale-based approach, we establish a functional central limit theorem and analyze the limiting behavior of the center of mass.…

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…

In this paper we will prove a functional central limit theorems for "nonconventional" sums indexed by polynomial arrays.

We consider the random walk among random conductances on Z^d. We assume that the conductances are independent, identically distributed and uniformly bounded away from 0 and infinity. We obtain a quantitative version of the central limit…

We consider a symmetric random walk on the $\nu$-dimensional lattice, whose exit probability from the origin is modified by an antisymmetric perturbation and prove the local central limit theorem for this process. A short-range correction…

We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…

Buraczewski et al (2023) proved a functional limit theorem (FLT) and a law of the iterated logarithm (LIL) for a random Dirichlet series $\sum_{k\geq 2}(\log k)^\alpha k^{-1/2-s}\eta_k$ as $s\to 0+$, where $\alpha>-1/2$ and $\eta_1$,…

Customers arrive at rate N times alpha on a network of N single server infinite buffer queues, choose L queues uniformly, join the shortest one, and are served there in turn at rate beta. We let N go to infinity.We prove a functional…

We consider random walks in a balanced i.i.d. random environment in $Z^d$ for $d\ge2$ and the corresponding discrete non-divergence form difference operators. We first obtain an exponential integrability of the heat kernel bounds. We then…

We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…

Using the regenerative scheme of Comets, Fern\'andez and Ferrari (2002), we establish a functional central limit theorem (FCLT) for discrete time stochastic processes (chains) with summable memory decay. Furthermore, under stronger…

We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…

We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…

We prove a functional central limit theorem for subgraph counts in a dynamic version of the random connection model. To establish tightness, we develop a dynamic extension of the cumulant method.

We consider a random field, defined on an integer-valued d-dimensional lattice, with covariance function satisfying a condition more general than summability. Such condition appeared in the well-known Newman's conjecture concerning the…