Related papers: Moderate deviations and laws of the iterated logar…

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

We study the quenched behaviour of a perturbed version of the simple symmetric random walk on the set of integers. The random walker moves symmetrically with an exception of some randomly chosen sites where we impose a random drift. We show…

We study the mean number of encounters up to time t, E_N(t), taking place in a subspace with dimension d* of a d-dimensional lattice, for N independent random walkers starting simultaneously from the same origin. E_N is first evaluated…

Let $(X_t,t\geq 0)$ be a random walk on $\mathbb{Z}^d$. Let $ l_t(x)= \int_0^t \delta_x(X_s)ds$ be the local time at site $x$ and $ I_t= \sum\limits_{x\in\mathbb{Z}^d} l_t(x)^p $ the p-fold self-intersection local time (SILT). Becker and…

Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are…

Let $L_n^{X}(x)$ denote the number of visits to $x \in {\bf Z}^2$ of the simple planar random walk $X$, up till step $n$. Let $X'$ be another simple planar random walk independent of $X$. We show that for any $0<b<1/(2 \pi)$, there are…

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

Let $A_n= \varepsilon_n \cdots \varepsilon_1$, where $(\varepsilon_n)_{n \geq 1}$ is a sequence of independent random matrices taking values in $ GL_d(\mathbb R)$, $d \geq 2$, with common distribution $\mu$. In this paper, under standard…

We study discrepancy minimization for vectors in $\mathbb{R}^n$ under various settings. The main result is the analysis of a new simple random process in multiple dimensions through a comparison argument. As corollaries, we obtain bounds…

Let $\{(X_t)_{t\geq 0}, \mathbb{P}_{\delta_x}, x\in E\}$ be a supercritical branching Markov process (which is not necessary symmetric) on a locally compact metric measure space $(E,\mu)$ with spatially dependent local branching mechanism.…

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

We revisit the multifractal analysis of $\R^d$-valued branching random walks averages by considering subsets of full Hausdorff dimension of the standard level sets, over each infinite branch of which a quantified version of the…

In one-dimensional random walks, the waiting time for each direction transitions is the same, even in the presence of bias, as a consequence of the microscopic-reversibility. We study the symmetry breaking of forward/ backward transition…

Consider $(Z_n)_{n\geq0}$ a supercritical branching process in an independent and identically distributed environment. Based on some recent development in martingale limit theory, we established law of the iterated logarithm, strong law of…

This article is devoted to the analysis of a Monte Carlo method to approximate effective coefficients in stochastic homogenization of discrete elliptic equations. We consider the case of independent and identically distributed coefficients,…

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…

We establish a moderate deviations principle (MDP) for the log-determinant $\log | \det (M_n) |$ of a Wigner matrix $M_n$ matching four moments with either the GUE or GOE ensemble. Further we establish Cram\'er--type moderate deviations and…

We quantify the elementary Borel-Cantelli Lemma by higher moments of the overlap count statistic in terms of the weighted summability of the probabilities. Applications include mean deviation frequencies in the Strong Law and the Law of the…

We analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\sqrt{|G|\log |G| \log \log |G|})$ steps, not far…

The points of the closed range of a drift-free subordinator with no killing are used for separating into blocks the elements of a sample of size $n$ from the standard exponential distribution. This gives rise to a random composition of $n$.…