We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.
We extend the notion of the associated random walk and the Wald martingale in random walks where the increments are independent and identically distributed to the more general case of stationary ergodic increments. Examples are given where the increments are Markovian or Gaussian, and an application in queueing is considered.
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 moving boundaries. Furthermore, we prove that a properly rescaled random walk conditioned to stay above the boundary up to time $n$ converges, as $n\to\infty$, towards the Brownian meander.
We study tail behaviour of the distribution of the area under the positive excursion of a random walk which has negative drift and heavy-tailed increments. We determine the asymptotics for tail probabilities for the area.
We study the asymptotics for the maximum on a random time interval of a random walk with a long-tailed distribution of its increments and negative drift. We extend to a general stopping time a result by Asmussen (1998), simplify its proof, and give some converses.
We continue the line of research of random walks with barrier initiated by Iksanov and M{ö}hle (2008). Assuming that the tail of the step of the underlying random walk has a power-like behavior at infinity with exponent $-α$, $α\in(0,1)$, we prove that the number $V_n$ of zero increments in the random walk with barrier, properly centered and normalized, converges weakly to the standard normal law. This refines previously known weak law of large numbers for $V_n$ proved in Iksanov and Negadailov (2008).
Let F be a distribution function with negative mean and regularly varying right tail. Under a mild smoothness condition we derive higher order asymptotic expansions for the tail distribution of the maxima of the random walk generated by F. An application to ruin probabilities is developed.
We consider asymptotics for the maximum of a modulated random walk whose increments $ξ_n^{X_n}$ are heavy-tailed. Of particular interest is the case where the modulating process $X$ is regenerative. Here we study also the maximum of the recursion given by $W_0=0$ and, for $n\ge1$, $W_n=\max(0,W_{n-1}+ξ_n^{X_n})$
We study the distribution of the maximum $M$ of a random walk whose increments have a distribution with negative mean and belonging, for some $γ>0$, to a subclass of the class $\mathcal{S}_γ$--see, for example, Chover, Ney, and Wainger (1973). For this subclass we give a probabilistic derivation of the asymptotic tail distribution of $M$, and show that extreme values of $M$ are in general attained through some single large increment in the random walk near the beginning of its trajectory. We also give some results concerning the ``spatially local'' asymptotics of the distribution of $M$, the m…
We present a random walk approximation to fractional Brownian motion where the increments of the fractional random walk are defined as a weighted sum of the past increments of a Bernoulli random walk.
We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our proofs we also make use of estimates for hitting probabilities and large deviations bounds. Our results are more general than existing results in the literature, which consider only the case of sums of independent (typically, identically distributed) random variables. We do not assume the Markov property. Existing results that we generalize include a circle of i…
Let $X$ be a Lévy process with regularly varying Lévy measure $ν$. We obtain sample-path large deviations for scaled processes $\bar X_n(t) \triangleq X(nt)/n$ and obtain a similar result for random walks. Our results yield detailed asymptotic estimates in scenarios where multiple big jumps in the increment are required to make a rare event happen; we illustrate this through detailed conditional limit theorems. In addition, we investigate connections with the classical large deviations framework. In that setting, we show that a weak large deviation principle (with logarithmic speed) holds, but…
Limit theorems for amnesic elephant Random walks with random increment sizes
UFABC - Centro de Matemática, Computação e Cognição(联邦圣保罗大学数学、计算与认知中心);UFRJ - Departamento de Métodos Estatísticos do Instituto de Matemática(里约热内卢联邦大学数学研究所统计方法系)
A catalytic branching random walk on a multidimensional lattice, with arbitrary finite number of catalysts, is studied in supercritical regime. The dynamics of spatial spread of the particles population is examined, upon normalization. The components of the vector random walk jump are assumed independent (or close to independent) and have semi-exponential distributions with, possibly, different parameters. A limit theorem on the almost sure normalized positions of the particles at the population ``front'' is established. Contrary to the case of the random walk increments with ``light'' distrib…
The choice of the increment distribution is crucial for the random-walk Metropolis-Hastings (RWM) algorithm. In this paper we study the optimal choice in high-dimension setting among all possible increment distributions. The conclusion is rather counter intuitive, but the optimal rate of convergence is attained by the usual choice, the normal distribution as the increment distribution. In particular, no heavy-tailed increment distribution can improve the rate.
We study sample-path large deviations for Lévy processes and random walks with heavy-tailed jump-size distributions that are of Weibull type. Our main results include an extended form of an LDP (large deviations principle) in the $J_1$ topology, and a full LDP in the $M_1'$ topology. The rate function can be represented as the solution to a quasi-variational problem. The sharpness and applicability of these results are illustrated by a counterexample proving the nonexistence of a full LDP in the $J_1$ topology, and by an application to a first passage problem.
We prove large deviations principles (LDPs) for the perimeter and the area of the convex hull of a planar random walk with finite Laplace transform of its increments. We give explicit upper and lower bounds for the rate function of the perimeter in terms of the rate function of the increments. These bounds coincide and thus give the rate function for a wide class of distributions which includes the Gaussians and the rotationally invariant ones. For random walks with such increments, large deviations of the perimeter are attained by the trajectories that asymptotically align into line segments.…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process is alpha-mixing and of finite second moment, then the twisted random walk is recurrent for every angle fixed choice of the angle out of a set of full Lebesgue measure, no matter how slow the mixing coefficients decay.
This paper considers the level-increment (LI) truncation approximation of M/G/1-type Markov chains. The LI truncation approximation is useful for implementing the M/G/1 paradigm, which is the framework for computing the stationary distribution of M/G/1-type Markov chains. The main result of this paper is a subgeometric convergence formula for the total variation distance between the original stationary distribution and its LI truncation approximation. Suppose that the equilibrium level-increment distribution is subexponential, and that the downward transition matrix is rank one. We then show t…
A {\it scenery} is a coloring $ξ$ of the integers. Let $\{S_t\}_{t\geq 0}$ be a recurrent random walk on the integers. Observing the scenery $ξ$ along the path of this random walk, one sees the color $χ_t:=ξ(S_t)$ at time $t$. The {\it scenery reconstruction problem} is concerned with recovering the scenery $ξ$, given only the sequence of observations $χ:=(χ_t)_{t\geq 0}$. The scenery reconstruction methods presented to date require the random walk to have bounded increments. Here, we present a new approach for random walks with unbounded increments which works when the tail of the increment d…
We consider a random walk $\tilde S$ which has different increment distributions in positive and negative half-planes. In the upper half-plane the increments are mean-zero i.i.d. with finite variance. In the lower half-plane we consider two cases: increments are positive i.i.d. random variables with either a slowly varying tail or with a finite expectation. For the distributions with a slowly varying tails, we show that $\{\frac{1}{\sqrt n} \tilde S(nt)\}$ has no weak limit in $\De$; alternatively, the weak limit is a reflected Brownian motion.
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk $(X,Y)=((X_n,Y_n))_{n\geq0}$. We show that it is recurrent and when suitably normalised converges to a two-dimensional Brownian motion with independent components; this independence occurs despite the functional dependence between the pre-limit processes. The process of recycling increments in this way is repeated and a multi-dimensional analog of this limit theorem together with a …
We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to -infinity and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the process S in continuous time reduces to a Levy process with heavy-tailed Levy measure. A central point of the paper is that we make ful…
We examine a new path transform on 1-dimensional simple random walks and Brownian motion, the quantile transform. This transformation relates to identities in fluctuation theory due to Wendel, Port, Dassios and others, and to discrete and Brownian versions of Tanaka's formula. For an n-step random walk, the quantile transform reorders increments according to the value of the walk at the start of each increment. We describe the distribution of the quantile transform of a simple random walk of n steps, using a bijection to characterize the number of pre-images of each possible transformed path. …
Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is relaxed, this is no longer true. We study a family of zero-drift spatially non-homogeneous random walks (Markov processes) whose increment covariance matrix is asymptotically constant along rays from the origin, and which, in any ambient dimension $d \geq 2$, can be adjusted so that the walk is either transient or recurrent. Natural examples are provided by rand…
Strong approximations of uniform transport processes to the standard Brownian motion rely on the Skorokhod embedding of random walk with centered double exponential increments. In this note we make such an embedding explicit by means of a Poissonian scheme, which both simplifies classic constructions of strong approximations of uniform transport processes (Griego et al. (1971)) and improves their rate of strong convergence (Gorostiza et al. (1980)). We finalise by providing an extension regarding the embedding of a random walk with asymmetric double exponential increments.
We prove distributional limit theorems for the length of the largest convex minorant of a one-dimensional random walk with independent identically distributed increments. Depending on the increment law, there are several regimes with different limit distributions for this length. Among other tools, a representation of the convex minorant of a random walk in terms of uniform random permutations is utilized.
We study the statistics of increments in record values in a time series $\{x_0=0,x_1, x_2, \ldots, x_n\}$ generated by the positions of a random walk (discrete time, continuous space) of duration $n$ steps. For arbitrary jump length distribution, including Lévy flights, we show that the distribution of the record increment becomes stationary, i.e., independent of $n$ for large $n$, and compute it explicitly for a wide class of jump distributions. In addition, we compute exactly the probability $Q(n)$ that the record increments decrease monotonically up to step $n$. Remarkably, $Q(n)$ is univer…
We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change over time macroscopically. We find the asymptotics of the maximum up to an $O_P(1)$ (stochastically bounded) error, and focus on the following phenomena: the profile of the variance matters, both to the leading (velocity) term and to the logarithmic correction term, and the latter exhibits a phase transition.
We develop importance sampling based efficient simulation techniques for three commonly encountered rare event probabilities associated with random walks having i.i.d. regularly varying increments; namely, 1) the large deviation probabilities, 2) the level crossing probabilities, and 3) the level crossing probabilities within a regenerative cycle. Exponential twisting based state-independent methods, which are effective in efficiently estimating these probabilities for light-tailed increments are not applicable when the increments are heavy-tailed. To address the latter case, more complex and …
We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments satisfying appropriate conditional increment moments conditions. We apply one of these results to deduce that a class of transient zero-drift Markov chains in $\mathbb{R}^d$, $d \geq 2$, possess infinitely many separating annuli, generalizing previous results on spatially homogeneous random walks.
In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was devoted to the case when the random walk is constructed by a fixed sequence of independent random variables which satisfies the classical Lindeberg condition. Now we consider a more general situation when we have a triangular array of independent random variables. Our main assumption is that the entries of every row are uniformly bounded by a constant, which tend…
We compute the exponential decay of the probability that a given multi-dimensional random walk stays in a convex cone up to time $n$, as $n$ goes to infinity. We show that the latter equals the minimum, on the dual cone, of the Laplace transform of the random walk increments. As an example, our results find applications in the counting of walks in orthants, a classical domain in enumerative combinatorics.
For a sequence in discrete time having stationary independent values (respectively, random walk) $X$, those random times $R$ of $X$ are characterized set-theoretically, for which the strict post-$R$ sequence (respectively, the process of the increments of $X$ after $R$) is independent of the history up to $R$. For a Lévy process $X$ and a random time $R$ of $X$, reasonably useful sufficient conditions and a partial necessary condition on $R$ are given, for the process of the increments of $X$ after $R$ to be independent of the history up to $R$.
This article extends the results of Fang & Zeitouni (2012a) on branching random walks (BRWs) with Gaussian increments in time inhomogeneous environments. We treat the case where the variance of the increments changes a finite number of times at different scales in [0,1] under a slight restriction. We find the asymptotics of the maximum up to an OP(1) error and show how the profile of the variance influences the leading order and the logarithmic correction term. A more general result was independently obtained by Mallein (2015b) when the law of the increments is not necessarily Gaussian. Howeve…
Let ${Z_n}_{n\ge 0}$ be a random walk with a negative drift and i.i.d. increments with heavy-tailed distribution and let $M=\sup_{n\ge 0}Z_n$ be its supremum. Asmussen & Kl{ü}ppelberg (1996) considered the behavior of the random walk given that $M>x$, for $x$ large, and obtained a limit theorem, as $x\to\infty$, for the distribution of the quadruple that includes the time $\rtreg=\rtreg(x)$ to exceed level $x$, position $Z_{\rtreg}$ at this time, position $Z_{\rtreg-1}$ at the prior time, and the trajectory up to it (similar results were obtained for the Cramér-Lundberg insurance risk process)…
We prove the power law decay $p(t,x) \sim t^{-ϕ(x,b)/2}$ in which $p(t,x)$ is the probability that the fraction of time up to $t$ in which a random walk $S$ of i.i.d. zero-mean increments taking finitely many values, is non-negative, exceeds $x$ throughout $s \in [1,t]$. Here $ϕ(x,b)= \mathbb{P}(\text{Lévy}(1/2,κ(x,b))<0)$ for $κ(x,b) = \frac{\sqrt{1-x} b - \sqrt{1+x}}{\sqrt{1-x} b + \sqrt{1+x}}$ and $b=b_S \geq 0$ measuring the asymptotic asymmetry between positive and negative excursions of the walk (with $b_s=1$ for symmetric increments).
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 zero and a finite fourth moment. This result complements the work of \citep{DKW13} where local central limit theorems are provided for the geometric area of the excursion of a symmetric random walk with finite second moments. Our result turns out to be a key tool to derive the scaling limit of the \emph{Interacting Partially-Directed Self-Avoiding Walk} at …
For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to random walks both with drift (the mean of random walk increments) and with no drift under mild moments assumptions on the increments. Assuming increments of the random walk have finite second moment and non-zero mean, Snyder and Steele showed that $n^{-1} L_n$ converges almost surely to a deterministic limit, and proved an upper bound on the variance Var$[ L_n…
For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove that if the increments of the walk have zero mean and finite second moment, $G_n$ is recurrent if $d=1$ and transient if $d \geq 2$. In the transient case we show that $G_n$ has diffusive rate of escape. These results extend work of Grill, who considered simple symmetric random walk. We also give a class of random walks with symmetric heavy-tailed increments …
Spitzer's identity describes the position of a reflected random walk over time in terms of a bivariate transform. Among its many applications in probability theory are congestion levels in queues and random walkers in physics. We present a new derivation of Spitzer's identity under the assumption that the increments of the random walk have bounded jumps to the left. This mild assumption facilitates a proof of Spitzer's identity that only uses basic properties of analytic functions and contour integration. The main novelty, believed to be of broader interest, is a reversed approach that recogni…
This article studies asymptotic approximations of ruin probabilities of multivariate random walks with heavy-tailed increments. Under our assumptions, the distributions of the increments are closely connected to multivariate subexponentiality and admit dependence between components. Keywords: subexponential distribution, ruin probability, multivariate random walk
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…
We prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above a fixed level converges in total variation to its stationary distribution. We find the explicit form of this distribution heuristically and then prove its invariance using a time-reversal argument. If, in addition, the increments of the walk are in the domain of attraction of a non-one-sided $α$-stable law with index $α\in(1,2)$ (resp. have finite variance)…
We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave majorant. This leads to a description of a walk of random geometric length as a Poisson point process of excursions away from its concave majorant, which is then used to find a complete description of the concave majorant for a walk of infinite length. In the case where subsets of increments may have the same arithmetic mean, we investigate three nested comp…
Consider a sequence of partial sums $S_i= ξ_1+\dots+ξ_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $ξ_1,\dots,ξ_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull $C_n:=\mathrm{Conv}(S_0,S_1,\dots,S_n)$. Assuming that the tuple $(ξ_1,\dots,ξ_n)$ is exchangeable and a certain general position condition holds, we prove that the expected number of $k$-dimensional faces of $C_n$ is given by the formula $$ \mathbb E [f_k(C_n)] = \frac{2\cdot k!}{n!} \sum_{l=0}^{\infty}\genfrac{[}{]}{0pt}{}{n+1}{d-2l} \genfrac{\{}{\}}{0pt}{}{d-2l}{…
Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise independence is required for all of these algorithms, by constructing a $3$-wise independent random walk with expected maximum distance $Ω(\sqrt{n} \lg n)$ from the origin. We prove that this bound is tight for the first and second moment, and also extract a surprising matrix inequality from these results. Next, we consider a generalization where the steps $X_i$ ar…
We analyze fluctuations of random walks with generally distributed increments. Integral representations for key performance measures are obtained by extending an inversion theorem of Hewitt [11] for Laplace-Stieltjes transforms. Another important part of the anal- ysis involves the so-called harmonic measures associated to the distribution of the increment of the walk. It is also pointed out that such representations can be explicitly calculated, if one assumes a form of rational structure for the increment transform. Applications include, but are not restricted to, queueing and insurance risk…
The joint distribution of value and local time for Brownian Motion has been reported by Borodin and Salminen. Its asymptotic behavior for recurrent random walk has been presented by Jain and Pruitt. Motivated by the need for queue size control during a pandemic (Hassin, Meilijson and Perlman), the current study presents closed form formulas for random walk and reflected random walk with $\pm 1$ increments, not necessarily fair.
In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times. In the regime where the increments of the resampling times diverge, which is referred to as the cooling regime, a weak law of large numbers and certain fluctuation properties were derived under the annealed measure. In the present paper we show that a strong law of large numbers and a quenched large deviation principle hold as well. In the cooling regime, the…
We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed as the "history window" $N\to\infty$.
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 study the long term behavior of a suitably normalized two-dimensional process $((X_n,Y_n))_{n\ge0}$. In particular, we provide necessary and sufficient conditions for the process to converge to a two-dimensional Brownian motion (possibly degenerate). We also discuss cases in which the limit is not Gaussian. Finally, we provide a simple necessary and sufficient …