The Skorokhod Embedding problem is well understood when the underlying process is a Brownian motion. We examine the problem when the underlying is the simple symmetric random walk and when no external randomisation is allowed. We prove that any measure on Z can be embedded by means of a minimal stopping time. However, in sharp contrast to the Brownian setting, we show that the set of measures which can be embedded in a uniformly integrable way is strictly smaller then the set of centered probability measures: specifically it is a fractal set which we characterise as an iterated function system. Finally, we define the natural extension of several known constructions from the Brownian setting and show that these constructions require us to further restrict the sets of target laws.
Motivated by problems in behavioural finance, we provide two explicit constructions of a randomized stopping time which embeds a given centered distribution $μ$ on integers into a simple symmetric random walk in a uniformly integrable manner. Our first construction has a simple Markovian structure: at each step, we stop if an independent coin with a state-dependent bias returns tails. Our second construction is a discrete analogue of the celebrated Azéma-Yor solution and requires independent coin tosses only when excursions away from maximum breach predefined levels. Further, this construction…
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 that the local time process of a planar simple random walk, when time is scaled logarithmically, converges to a non-degenerate pure jump process. The convergence takes place in the Skorokhod space with respect to the $M1$ topology and fails to hold in the $J1$ topology.
We prove a strong duality result for a linear programming problem which has the interpretation of being a discretised optimal Skorokhod embedding problem, and we recover this continuous time problem as a limit of the discrete problems. With the discrete setup we show that for a suitably chosen objective function, the optimiser takes the form of a hitting time for a random walk. In the limiting problem we then reprove the existence of the Root, Rost, and cave embedding solutions of the Skorokhod embedding problem. The main strength of this approach is that we can derive properties of the discre…
In this paper, martingales related to simple random walks and their maximum process are investigated. First, a sufficient condition under which a function with three arguments, time, the random walk, and its maximum process becomes a martingale is presented, and as an application, an alternative way of deriving the Kennedy martingale is provided. Then, a complete characterization of a function with two arguments, the random walk and its maximum, being a martingale is presented. This martingale can be regarded as a discrete version of the Azéma--Yor martingale. As applications of discrete Azéma…
We consider one-dimensional excited random walks (ERWs) with periodic cookie stacks in the recurrent regime. We prove functional limit theorems for these walks which extend the previous results of D. Dolgopyat and E. Kosygina for excited random walks with "boundedly many cookies per site." In particular, in the non-boundary recurrent case the rescaled excited random walk converges in the standard Skorokhod topology to a Brownian motion perturbed at its extrema (BMPE). While BMPE is a natural limiting object for excited random walks with boundedly many cookies per site, it is far from obvious w…
We prove that when a sequence of Lévy processes $X^{(n)}$ or a normed sequence of random walks $S^{(n)}$ converges a.s. on the Skorokhod space toward a Lévy process $X$, the sequence $L^{(n)}$ of local times at the supremum of $X^{(n)}$ converges uniformly on compact sets in probability toward the local time at the supremum of $X$. A consequence of this result is that the sequence of (quadrivariate) ladder processes (both ascending and descending) converges jointly in law towards the ladder processes of $X$. As an application, we show that in general, the sequence $S^{(n)}$ conditioned to stay…
Consider a random walk whose (light-tailed) increments have positive mean. Lower and upper bounds are provided for the expected maximal value of the random walk until it experiences a given drawdown d. These bounds, related to the Calmar ratio in Finance, are of the form (exp{alpha d}-1)/alpha and (K exp{alpha d}-1)/alpha for some K>1, in terms of the adjustment coefficient alpha (E[exp{-alpha X}]=1) of the insurance risk literature. Its inverse 1/alpha has been recently derived by Aumann and Serrano as an index of riskiness of the random variable X. This article also complements the Lundberg …
An improved version of the functional limit theorem is proved establishing weak convergence of random walks generated by compound doubly stochastic Poisson processes (compound Cox processes) to L{é}vy processes in the Skorokhod space under more realistic moment conditions. As corollaries, theorems are proved on convergence of random walks with jumps having finite variances to L{é}vy processes with variance-mean mixed normal distributions, in particular, to stable L{é}vy processes, generalized hyperbolic and generalized variance-gamma L{é}vy processes.
We consider one-dimensional excited random walks (ERWs) with i.i.d. markovian cookie stacks in the non-boundary recurrent regime. We prove that under diffusive scaling such an ERW converges in the standard Skorokhod topology to a multiple of Brownian motion perturbed at its extrema (BMPE). All parameters of the limiting process are given explicitly in terms of those of the cookie markov chain at a single site. While our results extend the results of Dolgopyat and Kosygina (2012, ERWs with boundedly many cookies per site) and Kosygina and Peterson (2016, ERWs with periodic cookie stacks), the a…
Let $\big(M_k, Q_k\big)_{k\in\mathbb{N}}$ be independent copies of an $\mathbb{R}^2$-valued random vector. It is known that if $Y_n:=Q_1+M_1Q_2+...+M_1\cdot...\cdot M_{n-1}Q_n$ converges a.s. to a random variable $Y$, then the law of $Y$ satisfies the stochastic fixed-point equation $Y \overset{d}{=} Q_1+M_1Y$, where $(Q_1, M_1)$ is independent of $Y$. In the present paper we consider the situation when $|Y_n|$ diverges to $\infty$ in probability because $|Q_1|$ takes large values with high probability, whereas the multiplicative random walk with steps $M_k$'s tends to zero a.s. Under a regula…
We derive a nonlinear integral equation to calculate Root's solution of the Skorokhod embedding problem for atom-free target measures. We then use this to efficiently generate bounded time-space increments of Brownian motion and give a parabolic version of Muller's classic "Random walk over spheres" algorithm.
We study a random walk on a point process given by an ordered array of points $(ω_k, \, k \in \mathbb{Z})$ on the real line. The distances $ω_{k+1} - ω_k$ are i.i.d. random variables in the domain of attraction of a $β$-stable law, with $β\in (0,1) \cup (1,2)$. The random walk has i.i.d. jumps such that the transition probabilities between $ω_k$ and $ω_\ell$ depend on $\ell-k$ and are given by the distribution of a $\mathbb{Z}$-valued random variable in the domain of attraction of an $α$-stable law, with $α\in (0,1) \cup (1,2)$. Since the defining variables, for both the random walk and the po…
Let $(ξ_1,η_1)$, $(ξ_2,η_2),\ldots$ be a sequence of i.i.d. two-dimensional random vectors. In the earlier article Iksanov and Pilipenko (2014) weak convergence in the $J_1$-topology on the Skorokhod space of $n^{-1/2}\underset{0\leq k\leq \cdot}{\max}\,(ξ_1+\ldots+ξ_k+η_{k+1})$ was proved under the assumption that contributions of $\underset{0\leq k\leq n}{\max}\,(ξ_1+\ldots+ξ_k)$ and $\underset{1\leq k\leq n}{\max}\,η_k$ to the limit are comparable and that $n^{-1/2}(ξ_1+\ldots+ξ_{[n\cdot]})$ is attracted to a Brownian motion. In the present paper, we continue this line of research and inves…
The reciprocal class of a Markov path measure is the set of all mixtures of its bridges. We give characterizations of the reciprocal class of a continuous-time Markov random walk on a graph. Our main result is in terms of some reciprocal characteristics whose expression only depends on the jump intensity. We also characterize the reciprocal class by means of Taylor expansions in small time of some conditional probabilities. Our measure-theoretical approach allows to extend significantly already known results on the subject. The abstract results are illustrated by several examples.
We use generalized Ray-Knight theorems introduced by Bálint Tóth in 1996 together with techniques developed for excited random walks as main tools for establishing positive and negative results concerning convergence of some classes of diffusively scaled self-interacting random walks (SIRWs) to Brownian motions perturbed at extrema (BMPE). Tóth's work studied two classes of SIRWs: asymptotically free and polynomially self-repelling walks. For both classes Toth has shown, in particular, that the distribution function of a scaled SIRW observed at independent geometric times converges to that of …
In this paper, the local asymptotic estimation for the supremum of a random walk and its applications are presented. The summands of the random walk have common long-tailed and generalized strong subexponential distribution. This distribution class and the corresponding generalized local subexponential distribution class are two new distribution classes with some good properties. Further, some long-tailed distributions with intuitive and concrete forms are found, which show that the intersection of the two above-mentioned distribution classes with long-tailed distribution class properly contai…
We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of ergodic behavior, decomposition into irreducible subsystems, and characterization of stationary states.
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of trees. A sufficient condition is established for Galton-Watson trees.
We develop a criterion for transience for a general model of branching Markov chains. In the case of multi-dimensional branching random walk in random environment (BRWRE) this criterion becomes explicit. In particular, we show that \emph{Condition L} of Comets and Popov is necessary and sufficient for transience as conjectured. Furthermore, the criterion applies to two important classes of branching random walks and implies that the critical branching random walk is transient resp. dies out locally.
Examples of interacting particle systems on $\mathbb{Z}$ as Pfaffian point processes: coalescing branching random walks and annihilating random walks with immigration
In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions involving relations with entrance times. We apply the developed methodology to some classes of random walks with bounded integer-valued jumps.
We point out a connection between fusion coefficients and random walks in a fixed level alcove associated to the root system of an affine Lie algebra and use this connection to solve completely the Dirichlet problem on such an alcove for a large class of simple random walks. We establish a correspondence between the hypergroup of conjugacy classes of a compact Lie group and the fusion hypergroup. We prove that a random walk in an alcove, obtained with the help of fusion coefficients, converges, after a proper normalization, towards the radial part of a Brownian motion on a compact Lie group.
This paper explores the mixing time of the random transposition walk on the symmetric group. While it has long been known that this walk mixes in order n*log(n) time, this result has not previously been attained using coupling. A coupling argument showing the correct order mixing time is presented. This is accomplished by first projecting to conjugacy classes, and then using the Bubley-Dyer path coupling construction. In order to obtain appropriate bounds on the time it takes the path coupling to meet, ideas from Schramm's paper "Compositions of Random Transpositions" are used.
The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and attached to the current position of the walker. These processes share similarities with other important classes of markovian and non-markovian random walks presenting a large variety of behaviors according to parameters specifications. We show that for a large and most significant class of tree builder random walks, the process is either null recurrent or trans…
We consider the problem, as suggested by Dembo ($2003$, $2006$), of late points of a simple random walk in two dimensions. It has been shown that the exponents for the numbers of pairs of late points coincide with those of nearly favorite points and high points in the Gaussian free field, whose exact values are known. We estimate the exponents for the numbers of a multipoint set of late points in average. While there have been observed certain similarities between among three classes of points, our results exhibit a difference.
This article rigorously analyzes the meeting time between pursuers and evaders performing random walks on digraphs. There exist several bounds on the expected meeting time between random walkers on graphs in the literature, however, closed-form expressions are limited in scope. By utilizing the notion that multiple random walks on a common graph can be understood as a single random walk on the Kronecker product graph, we are able to provide the first analytic expression for the meeting time in terms of the transition matrices of the random walkers when modeled by either discrete-time Markov ch…
The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups $Γ$ endowed with a rich boundary. The starting point is the Strip Criterion of identification of the Poisson boundary for random walks on discrete groups due to Kaimanovich. A geometrical method for constructing the strip as a subset of the lamplighter group starting with a smaller strip in the base group $Γ$ is developed. Then, this method is applied to several classes of base groups $Γ$: groups with infinitely many ends, hyperbolic groups in the sense of Gromov…
The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The processes are Markov processes in the usual sense. Their structure is similar to perpetuity or autoregressive model. We prove theorem, which describes the magnitude of the fluctuations of random walks generated by generalized convolutions. We give a construction and basic properties of random walks with respect to the Kendall convolution. We show that they a…
We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many linear groups over local fields supports a recurrent random walk if and only if it has at most quadratic growth. We give also a detailed analysis of ergodicity properties for special classes of random walks on homogeneous spaces. The structure of closed subgroups of linear groups over local fields and the properties of group actions with respect to stationary me…
The Pólya urn scheme is a discrete-time process concerning the addition and removal of colored balls. There is a known embedding of it in continuous-time, called the Pólya process. We deal with a generalization of this stochastic model, where the initial values and the entries of the transition matrix (corresponding to additions or removals) are not necessarily fixed integer values as in the standard Pólya process. In one of the scenarios, we even allow the entries of the matrix to be random variables. As a result, we no longer have a combinatorial model of "balls in an urn," but a broader int…
In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the radius of convergence when one walk is averaged over and the other is kept fixed; z2, the radius of convergence when both walks are averaged over. While z2 can be easily computed, no explicit expression is available for z1. In [3] it was conjectured that z1 > z2 under a weak regularity assumption on the random walk. However, this gap was only proved for strongl…
We show analogs of the classical arcsine theorem for the occupation time of a random walk in $(-\infty,0)$ in the case of a small positive drift. To study the asymptotic behavior of the total time spent in $(-\infty,0)$ we consider parametrized classes of random walks, where the convergence of the parameter to zero implies the convergence of the drift to zero. We begin with shift families, generated by a centered random walk by adding to each step a shift constant $a>0$ and then letting $a$ tend to zero. Then we study families of associated distributions. In all cases we arrive at the same lim…
Let $V$ be a two sided random walk and let $X$ denote a real valued diffusion process with generator ${1/2}e^{V([x])}\frac{d}{dx}(e^{-V([x])}\frac{d}{dx})$. This process is known to be the continuous equivalent of the one dimensional random walk in random environment with potential $V$. Hu and Shi (1997) described the Lévy classes of $X$ in the case where $V$ behaves approximately like a Brownian motion. In this paper, based on some fine results on the fluctuations of random walks and stable processes, we obtain an accurate image of the almost sure limiting behavior of $X$ when $V$ behaves asy…
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $λ$. There is a threshold for $λ$, which is called $λ_w$, that separates almost sure global extinction from global survival. Analogously, there exists another threshold $λ_s$ below which any site is visited almost surely a finite number of times (i.e.~local extinction) while above it there is a positive probability of visiting every site infinitely many times. The local critical parameter $λ_s$ is completely understood and can be computed as a function of the reproduction rates. On the oth…
In this paper, we study the discrete-time quantum random walks on a line subject to decoherence. The convergence of the rescaled position probability distribution $p(x,t)$ depends mainly on the spectrum of the superoperator $\mathcal{L}_{kk}$. We show that if 1 is an eigenvalue of the superoperator with multiplicity one and there is no other eigenvalue whose modulus equals to 1, then $\hat {P}(\fracν {\sqrt t},t)$ converges to a convex combination of normal distributions. In terms of position space, the rescaled probability mass function $p_t (x, t) \equiv p(\sqrt t x, t)$, $ x \in Z/\sqrt t$,…
We answer an open question of Grigorchuk and Zuk about amenability using random walks. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct limits; these classes are separated even within the realm of finitely presented groups.
Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds sufficient time for the orders to hold. This partially answers a conjecture that the n-cycles are the least likely elements of the transposition walk on the symmetric group. A likelihood order contributes to understanding the total variation distance and separation distance for a random walk.
We study the cut-off phenomenon for random walks on free unitary quantum groups coming from quantum conjugacy classes of classical reflections. We obtain in particular a quantum analogue of the result of U. Porod concerning certain mixtures of such reflections. We also study random walks on quantum reflection groups and more generally free wreath products of finite group by quantum permutation groups.
We start by introducing avoidance coupling of Markov chains, with an overview of existing results. We then introduce and motivate a new notion, uniform avoidance coupling. We show that the only Markovian avoidance coupling on a cycle is of this type, and that uniform avoidance coupling of simple random walks is impossible on trees, and prove that it is possible on several classes of graphs. We also derive a condition on the vertex neighborhoods in a graph equivalent to that graph admitting a uniform avoidance coupling of simple random walks, and an algorithm that tests this with run time polyn…
We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of exponential volume growth. For smaller classes, we give solutions among solvable groups. As corollaries, we prove a recent conjecture of Amir on joint evaluation of speed and entropy exponents and we obtain a new proof of the existence of uncountably many pairwise non-quasi-isometric solvable groups, originally due to Cornulier and Tessera. We also obtain a formula …
