Motivated by the recent work of Benjamini, Haggstrom, Peres, and Steif (2003) on dynamical random walks, we: Prove that, after a suitable normalization, the dynamical Gaussian walk converges weakly to the Ornstein-Uhlenbeck process in classical Wiener space; derive sharp tail-asymptotics for the probabilities of large deviations of the said dynamical walk; and characterize (by way of an integral test) the minimal envelop(es) for the growth-rate of the dynamical Gaussian walk. This development also implies the tail capacity-estimates of Mountford (1992) for large deviations in classical Wiener space. The results of this paper give a partial affirmative answer to the problem, raised in Benjamini et al (2003, Question 4), of whether there are precise connections between the OU process in classical Wiener space and dynamical random walks.
We consider a weighted lattice $Z^d$ with conductance $μ_e=|e|^{-α}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using an intrinsic metric. We also show that when $d=2$ and $α\in (-1,0)$, two independent random walks on such weighted lattice will collide infinite many times while they are transient.
We construct a coupling between the random walk composed of Lévy area increments from a $d$-dimensional Brownian motion and a random walk composed of quadratic polynomials of Gaussian random variables. This coupling construction is used to produce a new pathwise approximation scheme for stochastic differential equations in the preprint [Flint-Lyons-2015]. The coupling arguments of the present paper are based extensively on the recent coupling results of Davie concerning a multidimensional variant of the Komlós-Major-Tusnády theorem and Wasserstein estimates for polynomial perturbations of Gaus…
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.
We consider time-dependent random walks among time-dependent conductances. For discrete time random walks, we show that, unlike the time-independent case, two-sided Gaussian heat kernel estimates are not stable under perturbations. This is proved by giving an example of a ballistic and transient time-dependent random walk on Z among uniformly elliptic time-dependent conductances. For continuous time random walks, we show the instability when the holding times are i.i.d. exp(1), and in contrast, we prove the stability when the holding times change by sites in such a way that the base measure is…
Elephant random walk is a kind of one-dimensional discrete-time random walk with infinite memory: For each step, with probability $α$ the walker adopts one of his/her previous steps uniformly chosen at random, and otherwise he/she performs like a simple random walk (possibly with bias). It admits phase transition from diffusive to superdiffusive behavior at the critical value $α_c=1/2$. For $α\in (α_c, 1)$, there is a scaling factor $a_n$ of order $n^α$ such that the position $S_n$ of the walker at time $n$ scaled by $a_n$ converges to a nondegenerate random variable $W$, whose distribution is…
We initiate the study on chemical distances of percolation clusters for level sets of two-dimensional discrete Gaussian free fields as well as loop clusters generated by two-dimensional random walk loop soups. One of our results states that the chemical distance between two macroscopic annuli away from the boundary for the random walk loop soup at the critical intensity is of dimension 1 with positive probability. Our proof method is based on an interesting combination of a theorem of Makarov, isomorphism theory and an entropic repulsion estimate for Gaussian free fields in the presence of a h…
We consider continuous time simple random walks with arbitrary speed measure $θ$ on infinite weighted graphs. Write $p_t(x,y)$ for the heat kernel of this process. Given on-diagonal upper bounds for the heat kernel at two points $x_1,x_2$, we obtain a Gaussian upper bound for $p_t(x_1,x_2)$. The distance function which appears in this estimate is not in general the graph metric, but a new metric which is adapted to the random walk. Long-range non-Gaussian bounds in this new metric are also established. Applications to heat kernel bounds for various models of random walks in random environments…
Random walks on $\mathbb{Z}$ with metastable Gaussian distribution caused by linear drift with application to the contact process on the complete graph
We consider the thick points of random walk, i.e. points where the local time is a fraction of the maximum. In two dimensions, we answer a question of Dembo, Peres, Rosen and Zeitouni and compute the number of thick points of planar random walk, assuming that the increments are symmetric and have a finite moment of order two. The proof provides a streamlined argument based on the connection to the Gaussian free field and works in a very general setting including isoradial graphs. In higher dimensions, we study the scaling limit of the thick points. In particular, we show that the rescaled numb…
We prove an invariance principle for continuous-time random walks in a dynamically averaging environment on $\mathbb Z$. In the beginning, the conductances may fluctuate substantially, but we assume that as time proceeds, the fluctuations decrease according to a typical diffusive scaling and eventually approach constant unit conductances. The proof relies on a coupling with the standard continuous time simple random walk.
Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that {S_n(t)} returns to the origin infinitely often. In this paper we consider a dynamical random walk on Z^2. We show that with probability one there exists t such that {S_n(t)} never returns to the origin. This exceptional set of times has dimension one. This proves a conjecture of Benjamini et. al.
We consider random walk on dynamical percolation on the discrete torus $\mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(\mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical percolation environment. Here we study exit times in the quenched setting, where we condition on a typical dynamical percolation environment. We obtain an upper bound for all $p$ which for $p<p_c$ matches the known lower bound.
Benjamini,Haggstrom, Peres and Steif introduced the model of dynamical random walk on Z^d. This is a continuum of random walks indexed by a parameter t. They proved that for d=3,4 there almost surely exist t such that the random walk at time t visits the origin infinitely often, but for d > 4 there almost surely do not exist such t. Hoffman showed that for d=2 there almost surely exists t such that the random walk at time t visits the origin only finitely many times. We refine the results of Hoffman for dynamical random walk on Z^2, showing that with probability one there are times when the or…
We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already known results about the convex hull of a single Gaussian random walk and the $d$-dimensional Gaussian polytope with or without the origin.
In this article, we study special points of a simple random walk and a Gaussian free field, such as (nearly) favorite points, late points and high points. In section $2$, we extend results of [19] and suggest open problems for $d=2$. In section $3$, we give a survey on the geometric structures of (nearly) favorite points and late points of a simple random walk and high points of a Gaussian free field in two dimension.
We investigate the asymptotic variance of Gaussian nodal excursions in the Euclidean space, focusing on the case where the spectral measure has incommensurable atoms. This study requires to establish fine recurrence properties in 0 for the associated irrational random walk on the torus. We show in particular that the recurrence magnitude depends strongly on the diophantine properties of the atoms, and the same goes for the variance asymptotics of nodal excursions. More specifically, if the spectral measures contains atoms which ratios are well approximable by rationals, the variance is likely …
We consider a nearest-neighbor, one-dimensional random walk $\{X_n\}_{n\geq 0}$ in a random i.i.d. environment, in the regime where the walk is transient with speed v_P > 0 and there exists an $s\in(1,2)$ such that the annealed law of $n^{-1/s} (X_n - n v_P)$ converges to a stable law of parameter s. Under the quenched law (i.e., conditioned on the environment), we show that no limit laws are possible. In particular we show that there exist sequences {t_k} and {t_k'} depending on the environment only, such that a quenched central limit theorem holds along the subsequence t_k, but the quenched …
Random Walks in Cooling Random Environments (RWCRE) is a model of random walks in dynamic random environments where the entire environment is resampled along a fixed sequence of times, called the "cooling sequence," and is kept fixed in between those times. This model interpolates between that of a homogenous random walk, where the environment is reset at every step, and Random Walks in (static) Random Environments (RWRE), where the environment is never resampled. In this work we focus on the limiting distributions of one-dimensional RWCRE in the regime where the fluctuations of the correspond…
We consider dynamical percolation on the complete graph $K_n$, where each edge refreshes its state at rate $μ\ll 1/n$, and is then declared open with probability $p = λ/n$ where $λ> 1$. We study a random walk on this dynamical environment which jumps at rate $1/n$ along every open edge. We show that the mixing time of the full system exhibits cutoff at $\log n/μ$. We do this by showing that the random walk component mixes faster than the environment process; along the way, we control the time it takes for the walk to become isolated.
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate μ while at the same time a random walker moves on G at rate 1 but only along edges which are open. On the d-dimensional torus with side length n, we prove that in the subcritical regime, the mixing times for both the full system and the random walker are n^2/μ up to constants. We also obtain results concerning mean squared displacement and hitting times. Finally, we show that the usual recurrence transience dichotomy for the lattice Z^d…
Given any $γ>0$ and for $η=\{η_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random conductances where the conductance of edge $(u, v)$ is given by $\mathrm{e}^{γ(η_u + η_v)}$. We show that, for almost every~$η$, this random walk is recurrent and that, with probability tending to~1 as $T\to \infty$, the return probability at time~$2T$ decays as $T^{-1+o(1)}$. In addition, we prove a version of subdiffusive behavior by showing that the expected exit time from…
We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of the increments of the resulting random process is time dependent. We prove a strong law of large numbers for the DERW and, in a particular case, we provide an explicit expression for its speed. Finally, we give sufficient conditions for the central limit theorem and the law of the iterated logarithm to hold.
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random walks widely studied in the literature. The model we consider lends itself to a detailed treatment, making it possible to study deviations from normality due to finite time effects.
We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
Consider a sequence of i.i.d. random variables $X_n$ where each random variable is refreshed independently according to a Poisson clock. At any fixed time $t$ the law of the sequence is the same as for the sequence at time 0 but at random times almost sure properties of the sequence may be violated. If there are such \emph{exceptional times} we say that the property is \emph{dynamically sensitive}, otherwise we call it \emph{dynamically stable}. In this note we consider branching random walks on Cayley graphs and prove that recurrence and transience are dynamically stable in the sub-and superc…
We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index governing the tail heaviness (or jump index) equals the escape time exponent (or walk dimension) of the sub-Gaussian estimate. In a certain sense, this generalizes the classical threshold corresponding to the second moment condition.
In a system made up of independent random walks, fluctuations of order $n^{1/4}$ from the hydrodynamic limit come from particle current across characteristics. We show that a two-parameter space-time particle current process converges to a two-parameter Gaussian process. These Gaussian processes also appear as the limit for the one-dimensional random average process. The final section of this paper looks at large deviations of the current process.
We consider on-diagonal heat kernel estimates and the laws of the iterated logarithms for a switch-walk-switch random walk on a lamplighter graph under the condition that the random walk on the underlying graph enjoys sub-Gaussian heat kernel estimates.
Let $X_1,X_2,...$ be independent variables, each having a normal distribution with negative mean $-β<0$ and variance 1. We consider the partial sums $S_n=X_1+...+X_n$, with $S_0=0$, and refer to the process $\{S_n:n\geq0\}$ as the Gaussian random walk. We present explicit expressions for the mean and variance of the maximum $M=\max\{S_n:n\geq0\}.$ These expressions are in terms of Taylor series about $β=0$ with coefficients that involve the Riemann zeta function. Our results extend Kingman's first-order approximation [Proc. Symp. on Congestion Theory (1965) 137--169] of the mean for $β\downarr…
We obtain the leading orders of the maximum and the minimum of local times for the simple random walk on the two-dimensional torus at time proportional to the cover time. We also estimate the number of points with large (or small) values of the local times. These are analogues of estimates on the two-dimensional Gaussian free fields by Bolthausen, Deuschel, and Giacomin [Ann. Probab., 29 (2001)] and Daviaud [Ann. Probab., 34 (2006)], but we have different exponents from the case of the Gaussian free field.
We consider the model of random walk on dynamical percolation introduced by Peres, Stauffer and Steif (2015). We obtain comparison results for this model for hitting and mixing times and for the spectral-gap and log-Sobolev constant with the corresponding quantities for simple random walk on the underlying graph $G$, for general graphs. When $G$ is the torus $\mathbb{Z}_n^d$, we recover the results of Peres et al. and we also extend them to the critical case. We also obtain bounds in the cases where $G$ is a transitive graph of moderate growth and also when it is the hypercube.
We consider Gaussian fields of real symmetric, complex Hermitian or quaternionic Hermitian matrices over an electrical network, and describe how the isomorphisms between these fields and random walks give rise to topological expansions encoded by ribbon graphs. We further consider matrix-valued Gaussian fields twisted by an orthogonal, unitary or symplectic connection. In this case the isomorphisms involve traces of holonomies of the connection along random walk loops parametrized by boundary cycles of ribbon graphs.
We consider laws of the iterated logarithm and the rate function for sample paths of random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a rather classical asymptotic behavior, as opposed to the quantum random walks usually considered in Quantum Information Theory (such as the well-known Hadamard random walk). Typically, in the case of Open Quantum Random Walks on lattices, their distribution seems to always converge to a Gaussian distribution or a mixture of Gaussian distributions. In the case of …
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a concentration inequality around the asymptotic speed. The mixing hypothesis imposes a polynomial decay rate of covariances on the environment with sufficiently high exponent but does not impose uniform mixing. Examples of environments for which our methods apply include the contact process and Markovian environments with a positive spectral gap, such as the …
This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed descriptions of the limit process are given in the case of simple symmetric walks and Gaussian walks. Some open problems are also presented.
This paper studies particle propagation in a one-dimensional inhomogeneous medium where the laws of motion are generated by chaotic and deterministic local maps. Assuming that the particle's initial location is random and uniformly distributed, this dynamical system can be reduced to a random walk in a one-dimensional inhomogeneous environment with a forbidden direction. Our main result is a local limit theorem which explains in detail why, in the long run, the random walk's probability mass function does not converge to a Gaussian density, although the corresponding limiting distribution over…
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the environment viewed from the random walker as derived by Berger and Biskup.
In this note, we design a discrete random walk on the real line which takes steps $0, \pm 1$ (and one with steps in $\{\pm 1, 2\}$) where at least $96\%$ of the signs are $\pm 1$ in expectation, and which has $\mathcal{N}(0,1)$ as a stationary distribution. As an immediate corollary, we obtain an online version of Banaszczyk's discrepancy result for partial colorings and $\pm 1, 2$ signings. Additionally, we recover linear time algorithms for logarithmic bounds for the Komlós conjecture in an oblivious online setting.
Fluctuations for diameter and perimeter of convex hulls of multiple random walks
Institute of Mathematics, University of Wrocław（弗罗茨瓦夫大学数学研究所）；University of Zagreb Faculty of Science（萨格勒布大学理学院）；University of Zagreb Faculty of Electrical Engineering and Computing（萨格勒布大学电气工程和计算学院）；Department of Mathematical Sciences, Durham University（杜伦大学数学科学系）；Department of Mathematics, The University of Hong Kong（香港大学数学系）
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.…
In this paper we derive weak limits for the discretization errors of sampling barrier-hitting and extreme events of Brownian motion by using the Euler discretization simulation method. Specifically, we consider the Euler discretization approximation of Brownian motion to sample barrier-hitting events, i.e. hitting for the first time a deterministic "barrier" function; and to sample extreme events, i.e. attaining a minimum on a given compact time interval or unbounded closed time interval. For each case we study the discretization error between the actual time the event occurs versus the time t…
The dynamical discrete web (DyDW),introduced in recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical time parameter τ. The evolution is by independent updating of the underlying Bernoulli variables indexed by discrete space-time that define the discrete web at any fixed τ. In this paper, we study the existence of exceptional (random) values of τwhere the paths of the web do not behave like usual random walks and the Hausdorff dimension of the set of exceptional such τ. Our results are motivated b…
We study persistence probabilities for random walks in correlated Gaussian random environment first studied by Oshanin, Rosso and Schehr. From the persistence results, we can deduce properties of critical branching processes with offspring sizes geometrically distributed with correlated random parameters. More precisely, we obtain estimates on the tail distribution of its total population size, of its maximum population, and of its extinction time.
