Related papers: On large deviation probabilities for self-normaliz…
In this paper, we establish the invariance principle and the large deviation for the biased random walk $RW_{\lambda}$ with $\lambda \in [0,1)$ on $\mathbb{Z}^d, d\geq 1$.
Let (S_n)_{n\in\N} be a Z-valued random walk with increments from the domain of attraction of some \alpha-stable law and let (\xi(i))_{i\in\Z} be a sequence of iid random variables. We want to investigate U-statistics indexed by the random…
We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…
Given the increments of a simple symmetric random walk $(X_n)_{n\ge0}$, we characterize all possible ways of recycling these increments into a simple symmetric random walk $(Y_n)_{n\ge0}$ adapted to the filtration of $(X_n)_{n\ge0}$. We…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq 1$, where $(g_n)_{n\geq 1}$ is a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group ${\rm GL}(V)$ with $V=\mathbb R^d$.…
We report on a closed-form expression for the survival probability of a discrete 1D biased random walk to not return to its origin after N steps. Our expression is exact for any N, including the elusive intermediate range, thereby allowing…
A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random…
We study one-dimensional nearest neighbour random walk in site-random environment. We establish precise (sharp) large deviations in the so-called ballistic regime, when the random walk drifts to the right with linear speed. In the…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…
We consider a random walk in an i.i.d. random environment on Zd and study properties of its large deviation rate function at the origin. It was proved by Comets, Gantert and Zeitouni in dimension d = 1 in 1999 and later by Varadhan in…
We obtain a large deviations principle for the self-intersection local times for a symmetric random walk in dimension d>4. As an application, we obtain moderate deviations for random walk in random sceneries in some region of parameters.
In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…
We investigate asymptotic behaviour of probabilities of large deviations for normalized combinatorial sums. We find a zone in which these probabilities are equivalent to the tail of the standard normal law. Our conditions are similar to the…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…