It is shown in this paper that the transition kernel corresponding to a spatially inhomogeneous random walk on ${\mathbf{Z}}^d$ admits upper and lower Gaussian estimates.
Consider non-homogeneous zero-drift random walks in $\mathbb{R}^d$, $d \geq 2$, with the asymptotic increment covariance matrix $σ^2 (\mathbf{u})$ satisfying $\mathbf{u}^\top σ^2 (\mathbf{u}) \mathbf{u} = U$ and $\mathrm{tr}\ σ^2 (\mathbf{u}) = V$ in all in directions $\mathbf{u}\in\mathbb{S}^{d-1}$ for some positive constants $U<V$. In this paper we establish weak convergence of the radial component of the walk to a Bessel process with dimension $V/U$. This can be viewed as an extension of an invariance principle of Lamperti.
We consider the small deviation probability for random walk with time-inhomogeneous random environment. Compared with the result in Mogul'ski\uı (1974) for the i.i.d. random walk, the rate is smaller (due to the random environment), which is specified in terms of the quenched and annealed variance.
We consider a random walk $\{S_n\}_{n\in \mathbb{N}}$ in time-inhomogeneous random environment $ξ$. For almost each realization of $ξ$, we formulate a quenched harmonic function, based on which we can define the random walk in random environment conditioned to stay positive by the Doob's $h$-transform. Furthermore, we prove a quenched invariance principle for the conditioned random walk for almost each realization of $ξ$.
The greedy walk is a deterministic walk that always moves from its current position to the nearest not yet visited point. In this paper we consider the greedy walk on an inhomogeneous Poisson point process on the real line. Our primary interest is whether the walk visits all points of the point process, and we determine sufficient and necessary conditions on the mean measure of the point process for this to happen. Moreover, we provide precise results on threshold functions for the property of visiting all points.
Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$. The coefficient of the first (ballistic) order is obtained as the solution of an optimization problem, while the second term, of order $n^{1/3}$, comes from time-inhomogeneous random walk estimates, that may be of independent interest. This result partially answers a conjecture of Fang and Zeitouni. Same techniques are used to obtain the asymptotic of other…
We study a random walk $\mathbf{S}_n$ on $\mathbb{Z}^d$ ($d\geq 1$), in the domain of attraction of an operator-stable distribution with index $\boldsymbolα=(α_1,\ldots,α_d) \in (0,2]^d$: in particular, we allow the scalings to be different along the different coordinates. We prove a strong renewal theorem, $i.e.$ a sharp asymptotic of the Green function $G(\mathbf{0},\mathbf{x})$ as $\|\mathbf{x}\|\to +\infty$, along the "favorite direction or scaling": (i) if $\sum_{i=1}^d α_i^{-1} < 2$ (reminiscent of Garsia-Lamperti's condition when $d=1$ [Comm. Math. Helv. $\mathbf{37}$, 1962]); (ii) if a…
The behavior of the maximal displacement of a supercritical branching random walk has been a subject of intense studies for a long time. But only recently the case of time-inhomogeneous branching has gained focus. The contribution of this paper is to analyze a time-inhomogeneous model with two levels of randomness. In the first step a sequence of branching laws is sampled independently according to a distribution on the set of point measures' laws. Conditionally on the realization of this sequence (called environment) we define a branching random walk and find the asymptotic behavior of its ma…
We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of $\mathbf p$-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The theorems for the ICRT extend the ones by Bertoin and Miermont [Ann. Appl. Probab., vol. 23(4), pp. 1469--1493, 2013] about the cut tree of the Brownian continuum random tree.
Let $ξ_1,ξ_2,\ldots$ be independent, identically distributed random variables with infinite mean $\mathbf E[|ξ_1|]=\infty.$ Consider a random walk $S_n=ξ_1+\cdots+ξ_n$, a stopping time $τ=\min\{n\ge 1: S_n\le 0\}$ and let $M_τ=\max_{0\le i\le τ} S_i$. We study the asymptotics for $\mathbf P(M_τ>x),$ as $x\to\infty$.
We consider a branching random walk on $d$-dimensional real space with immigration in a time-dependent random environment. Let $Z_n(\mathbf t)$ be the so-called partition function of the process, namely, the moment generating function of the counting measure describing the dispersion of individuals at time $n$. For $\mathbf t$ fixed, the logarithm $\log Z_n(\mathbf t)$ satisfies a central limit theorem. By studying the logarithmic moments of the intrinsic submartingale of the system and its convergence rates, we establish the uniform and non-uniform Berry-Esseen bounds corresponding to the cen…
We provide a characterization for anti-concentration of inhomogeneous random walks in non-abelian groups. In application we extend the classical bounds by Erdos-Littlewood-Offord and Sarkozy-Szemeredi to non-abelian settings.
Given a simple transient random walk $(S_n)_{n\geq 0}$ in $\mathbf{Z}$ and a stationary sequence of real random variables $(ξ(s))_{s\in \mathbf{Z}}$, we investigate the extremes of the sequence $(ξ(S_n))_{n\geq 0}$. Under suitable conditions, we make explicit the extremal index and show that the point process of exceedances converges to a compound Poisson point process. We give two examples for which the cluster size distribution can be made explicit.
In this work, we consider a modification of time \emph{inhomogeneous} branching random walk, where the driving increment distribution changes over time macroscopically. Following Bandyopadhyay and Ghosh (2021), we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the last generation. We call this process \emph{last progeny modified time inhomogeneous branching random walk (LPMTI-BRW)}. Under very minimal assumptions on the underlying point processes of the displacements, we show that the maximum displacement converges to a limit after only an a…
This paper continues the discussion on the stability of time-inhomogeneous Markov chains. In particular, this paper defines a time-inhomogeneous, discrete-time Markov chain governed by a continuous evolution in the appropriate martrix space. This matrix space, $\mathcal{P}_{n}^{ia}$, is the space of all stochastic matrices that are irreducible and aperiodic. For this new type of evolution there is a definition of a specific type of stability called the stable adiabatic time. This measure is bounded by a function of the optimal mixing time over the evolution. Namely, for a time-inhomogeneous, d…
Consider a family of random walks $S_n^{(a)}=X_1^{(a)}+\cdots+X_n^{(a)}$ with negative drift $\mathbf E X_1^{(a)}=-a<0$ and finite variance $\mbox{var}(X_1^{(a)})=σ^2<\infty$.Let $M^{(a)}=\max_{n\ge 0} S_n^{(a)}$ be the maximums of the random walks. The exponential asymptotics $\mathbf P(aM^{(a)}>x)\sim e^{-2x/σ^2}$, as $a\to 0$, were found by Kingman and are known as heavy traffic approximation in the queueing theory. For subexponential random variables the large deviation asymptotics for $\mathbf P(M^{(a)}>x)\sim \frac{1}{a}\overline F^I(x)$ hold for fixed $a$ as $x\to\infty$. In this paper …
This article studies discrete height functions on the discrete hypertorus. These are functions on the vertices of this hypertorus graph for which the derivative satisfies a specific condition on each edge. We then perform a random walk on the set of such height functions, in the spirit of Diffusivity of a random walk on random walks, a work of Boissard, Cohen, Espinasse, and Norris. The goal is to estimate the diffusivity of this random walk in the mesh limit. It turns out that each height functions is characterised by a number of so-called fractures of the hypertorus. These fractures are then…
Let $\{ξ_1,ξ_2,\ldots\}$ be a sequence of independent but not necessarily identically distributed random variables. In this paper, the sufficient conditions are found under which the tail probability $\mathbb{P}(\sup_{n\geqslant0}\sum_{i=1}^nξ_i>x)$ can be bounded above by $\varrho_1\exp\{-\varrho_2x\}$ with some positive constants $\varrho_1$ and $\varrho_2$. A way to calculate these two constants is presented. The application of the derived bound is discussed and a Lundberg-type inequality is obtained for the ultimate ruin probability in the inhomogeneous renewal risk model satisfying the ne…
In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the calculation of the stability condition, extending the result of Neuts drift conditions [30] and connecting it with the result of Fayolle et al. which is based on Lyapunov functions [13]. Furthermore, we consider the sub-class of random walks with equilibrium distributions given as series of product-forms and, for this class of random walks, we calculate the eigen…
Let $\mathcal{U}$ be the uniform spanning tree on $\mathbb{Z}^3$, whose probability law is denoted by $\mathbf{P}$. For $\mathbf{P}$-a.s. realization of $\mathcal{U}$, the recurrence of the the simple random walk on $\mathcal{U}$ is proved in [5] and it is also demonstrated in [8] that two independent simple random walks on $\mathcal{U}$ collide infinitely often. In this article, we will give a quantitative estimate on the number of collisions of two independent simple random walks on $\mathcal{U}$, which provides another proof of the infinite collision property of $\mathcal{U}$.
If $\mathcal{W}$ is the simple random walk on the square lattice $\mathbb{Z}^2$, then $\mathcal{W}$ induces a random walk $\mathcal{W}_G$ on any spanning subgraph $G\subset \mathbb{Z}^2$ of the lattice as follows: viewing $\mathcal{W}$ as a uniformly random infinite word on the alphabet $\{\mathbf{x}, -\mathbf{x}, \mathbf{y}, -\mathbf{y} \}$, the walk $\mathcal{W}_G$ starts at the origin and follows the directions specified by $\mathcal{W}$, only accepting steps of $\mathcal{W}$ along which the walk $\mathcal{W}_G$ does not exit $G$. For any fixed subgraph $G \subset \mathbb{Z}^2$, the walk $\…
We consider the Pólya random walk in $\mathbb{Z}^2$. The paper establishes a number of results for the distributions and expectations of the number of usual (undirected) and specifically defined in the paper up- and down-directed state-crossings and different sets of states crossings. One of the most important results of this paper is that the expected number of undirected state-crossings $\mathbf{n}$ is equal to 1 for any state $\mathbf{n}\in\mathbb{Z}^2\setminus\{\mathbf{0}\}$. As well, the results of the paper are extended to $d$-dimensional random walks, $d\geq2$, in bounded areas.
We work under the A\"ıdékon-Chen conditions which ensure that the derivative martingale in a supercritical branching random walk on the line converges almost surely to a nondegenerate nonnegative random variable that we denote by $Z$. It is shown that $\mathbb{E} Z\mathbf{1}_{\{Z\le x\}}=\log x+o(\log x)$ as $x\to\infty$. Also, we provide necessary and sufficient conditions under which $\mathbb{E} Z\mathbf{1}_{\{Z\le x\}}=\log x+{\rm const}+o(1)$ as $x\to\infty$. This more precise asymptotics is a key tool for proving distributional limit theorems which quantify the rate of convergence of the …
Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I show that this is not the only way: I introduce a quantum walk driven by an inhomogeneous, time-dependent coin operator, which mimics the statistical properties of a random walk at all time scales. The quantum particle undergoes unitary evolution and, in fact, the high correlation evidenced by the components of the wave function can be used to revert the outc…
A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation of the stationary probability distribution is not available in general, the performance is approximated by a perturbed random walk, whose transition rates on the boundaries are changed such that its stationary probability distribution is known in closed form. A perturbed random walk for which the stationary distribution is a sum of geometric terms is consid…
In a Markov chain started at a state $x$, the hitting time $τ(y)$ is the first time that the chain reaches another state $y$. We study the probability $\mathbf{P}_x(τ(y) = t)$ that the first visit to $y$ occurs precisely at a given time $t$. Informally speaking, the event that a new state is visited at a large time $t$ may be considered a "surprise". We prove the following three bounds: 1) In any Markov chain with $n$ states, $\mathbf{P}_x(τ(y) = t) \le \frac{n}{t}$. 2) In a reversible chain with $n$ states, $\mathbf{P}_x(τ(y) = t) \le \frac{\sqrt{2n}}{t}$ for $t \ge 4n + 4$. 3) For random wal…
In this article, we consider a Branching Random Walk on the real line. The genealogical structure is assumed to be given through a supercritical branching process in the i.i.d. environment and satisfies the Kesten-Stigum condition. The displacements coming from the same parent are assumed to have jointly regularly varying tails. Conditioned on the survival of the underlying genealogical tree, we prove that the appropriately normalized (normalization depends on the quenched size of the $n$-th generation) maximum among positions at the $n$-th generation converges weakly to a scale-mixture of Fre…