Analysis of random walks in dynamic random environments via L2-perturbations

We consider random walks in dynamic random environments given by Markovian dynamics on ${\mathbb{Z}}^d$. We assume that the environment has a stationary distribution $\mu$ and satisfies the Poincaré inequality w.r.t. $\mu$. The random walk is a perturbation of another random walk (called “unperturbed”). We assume that also the environment viewed from the unperturbed random walk has stationary distribution $\mu$. Both perturbed and unperturbed random walks can depend heavily on the environment and are not assumed to be finite-range. We derive a law of large numbers, an averaged invariance principle for the position of the walker and a series expansion for the asymptotic speed. We also provide a condition for non-degeneracy of the diffusion, and describe in some details equilibrium and convergence properties of the environment seen by the walker. All these results are based on a more general perturbative analysis of operators that we derive in the context of $L^2$- bounded perturbations of Markov processes by means of the so-called Dyson–Phillips expansion.     

Branching random walks and contact processes on homogeneous trees

Summary. Branching random walks and contact processes on the homogeneous tree in which each site has d+1 neighbors have three possible types of behavior (for d≧ 2): local survival, local extinction with global survival, and global extinction. For branching random walks, we show that if there is local extinction, then the probability that an individual ever has a descendent at a site n units away from that individual’s location is at most d ^{− n/2} , while if there is global extinction, this probability is at most d ⁻ⁿ . Next, we consider the structure of the set of invariant measures with finite intensity for the system, and see how this structure depends on whether or not there is local and/or global survival. These results suggest some problems and conjectures for contact processes on trees. We prove some and leave others open. In particular, we prove that for some values of the infection parameter λ, there are nontrivial invariant measures which have a density tending to zero in all directions, and hence are different from those constructed by Durrett and Schinazi in a recent paper. Received: 26 April 1996/In revised form: 20 June 1996     

Correlation functions of the XX Heisenberg magnet and random walks of vicious walkers

We investigate a relation between random walks on a one-dimensional periodic lattice and correlation functions of the XX Heisenberg spin chain. Operator averages over the ferromagnetic state play the role of generating functions of the number of paths traveled by so-called vicious random walkers (vicious walkers annihilate each other if they arrive at the same lattice site). We show that the two-point correlation function of spins calculated over eigenstates of the XX magnet can be interpreted as the generating function of paths traveled by a single walker in a medium characterized by a variable number of vicious neighbors. We obtain answers for the number of paths traveled by the described walker from a fixed lattice site to a sufficiently remote site. We provide asymptotic estimates of the number of paths in the limit of a large number of steps. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 159, No. 2, pp. 179–193, May, 2009.     

Further results for semiregenerative phenomena

A theory of semiregenerative phenomena was developed by the author. The set of points at which such a phenomenon occurs is called a semi regenerative set. There is a correspondence between a semiregenerative set and the range of a Markov subordinator with a unit drift (or a Markov renewal process in the discrete time case). Prabhu, Tang, and Zhu showed that the properties of semiregenerative sets associated with Markov random walks completely characterize the fluctuation behaviour of these processes in the nondegenerate case and also established a Wiener-Hopf factorization based on these sets. These results are surveyed in this paper.     

Dynamics for the Brownian web and the erosion flow

The Brownian web is a random object that occurs as the scaling limit of an infinite system of coalescing random walks. Perturbing this system of random walks by, independently at each point in space–time, resampling the random walk increments, leads to some natural dynamics. In this paper we consider the corresponding dynamics for the Brownian web. In particular, pairs of coupled Brownian webs are studied, where the second web is obtained from the first by perturbing according to these dynamics. A stochastic flow of kernels, which we call the erosion flow, is obtained via a filtering construction from such coupled Brownian webs, and the N$N$-point motions of this flow of kernels are identified.     

Synchronization and functional central limit theorems for interacting reinforced random walks

We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks. Due to a reinforcement mechanism and interaction, the walks are strongly correlated and converge almost surely to the same, possibly random, limit. We study random walks interacting through a mean-field rule and compare the rate they converge to their limit with the rate of synchronization, i.e. the rate at which their mutual distances converge to zero. We show that, under certain conditions, synchronization is faster than convergence. Even if our focus is on theoretical results, we propose as main motivations two contexts in which such results could directly apply: urn models and opinion dynamics in a random network evolving via preferential attachment.     

Fluctuations of the front in a stochastic combustion model

We consider an interacting particle system on the one-dimensional lattice Z modeling combustion. The process depends on two integer parameters 2?a?M<∞. Particles move independently as continuous time simple symmetric random walks except that (i) when a particle jumps to a site which has not been previously visited by any particle, it branches into a particles, (ii) when a particle jumps to a site with M particles, it is annihilated. We start from a configuration where all sites to the left of the origin have been previously visited and study the law of large numbers and central limit theorem for rt, the rightmost visited site at time t. The proofs are based on the construction of a renewal structure leading to a definition of regeneration times for which good tail estimates can be performed.     

Exponential decay rate of survival probability in a disastrous random environment

Summary. We study the exponential decay rate of the survival probability up to time t>0 of a random walker moving in Zopf; ^d in a temporally and spatially fluctuating random environment. When the random walker has a speed parameter κ>0, we investigate the influence of κ on the exponential decay rate λ(d,κ). In particular we prove that for any fixed d≥1, λ(d,κ) behaves like as logκ as κ↘0. Received: 21 May 1996 / In revised form: 2 February 1997     

Dirichlet forms on fractals: Poincaré constant and resistance

Summary We study Dirichlet forms associated with random walks on fractal-like finite grahs. We consider related Poincaré constants and resistance, and study their asymptotic behaviour. We construct a Markov semi-group on fractals as a subsequence of random walks, and study its properties. Finally we construct self-similar diffusion processes on fractals which have a certain recurrence property and plenty of symmetries.Partly supported by the JSPS Program     

Persistent Random Walks. I. Recurrence Versus Transience

We consider a walker on the line that at each step keeps the same direction with a probability which depends on the time already spent in the direction the walker is currently moving. These walks with memories of variable length can be seen as generalizations of directionally reinforced random walks introduced in Mauldin et al. (Adv Math 117(2):239–252, 1996). We give a complete and usable characterization of the recurrence or transience in terms of the probabilities to switch the direction and we formulate some laws of large numbers. The most fruitful situation emerges when the running times both have an infinite mean. In that case, these properties are related to the behaviour of some embedded random walk with an undefined drift so that these features depend on the asymptotics of the distribution tails related to the persistence times. In the other case, the criterion reduces to a null-drift condition. Finally, we deduce some criteria for a wider class of persistent random walks whose increments are encoded by a variable length Markov chain having—in full generality—no renewal pattern in such a way that their study does not reduce to a skeleton RW as for the original model.     

Tree-indexed random walks on groups and first passage percolation

Summary Suppose that i.i.d. random variables are attached to the edges of an infinite tree. When the tree is large enough, the partial sumsS along some of its infinite paths will exhibit behavior atypical for an ordinary random walk. This principle has appeared in works on branching random walks, first-passage percolation, and RWRE on trees. We establish further quantitative versions of this principle, which are applicable in these settings. In particular, different notions of speed for such a tree-indexed walk correspond to different dimension notions for trees. Finally, if the labeling variables take values in a group, then properties of the group (e.g., polynomial growth or a nontrivial Poisson boundary) are reflected in the sample-path behavior of the resulting tree-indexed walk.Partially supported by a grant from the Landau Center for Mathematical AnalysisPartially supported by NSF grant DMS-921 3595     

Slowdown estimates and central limit theorem for random walks in random environment

This work is concerned with asymptotic properties of multi-dimensional random walks in random environment. Under Kalikow’s condition, we show a central limit theorem for random walks in random environment on ℤ ^d , when d≥2. We also derive tail estimates on the probability of slowdowns. These latter estimates are of special interest due to the natural interplay between slowdowns and the presence of traps in the medium. The tail behavior of the renewal time constructed in [25] plays an important role in the investigation of both problems. This article also improves the previous work of the author [24], concerning estimates of probabilities of slowdowns for walks which are neutral or biased to the right. Received May 31, 1999 / final version received January 18, 2000?Published online April 19, 2000     

Valleys and the Maximum Local Time for Random Walk in Random Environment

Let ξ (n, x) be the local time at x for a recurrent one-dimensional random walk in random environment after n steps, and consider the maximum ξ^*(n) = max _x ξ(n, x). It is known that lim sup is a positive constant a.s. We prove that lim inf is a positive constant a.s. this answers a question of P. Révész [5]. The proof is based on an analysis of the valleys in the environment, defined as the potential wells of record depth. In particular, we show that almost surely, at any time n large enough, the random walker has spent almost all of its lifetime in the two deepest valleys of the environment it has encountered. We also prove a uniform exponential tail bound for the ratio of the expected total occupation time of a valley and the expected local time at its bottom.     

Gene flow across geographical barriers — scaling limits of random walks with obstacles

We study a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. We obtain a non trivial scaling limit which behaves like reflected Brownian motion until its local time at zero reaches an exponential variable. It then follows reflected Brownian motion on the other side of the origin until its local time at zero reaches another exponential level, etc. These random walks are used in population genetics to trace the position of ancestors in the past near geographical barriers.     

Berry–Esseen estimates for regenerative processes under weak moment assumptions

We prove Berry–Esseen type rates of convergence for central limit theorems (CLTs) of regenerative processes which generalize previous results of Bolthausen under weaker moment assumptions. We then show how this general result can be applied to obtain rates of convergence for (1) CLTs for additive functionals of positive recurrent Markov chains under certain conditions on the strong mixing coefficients, and (2) annealed CLTs for certain ballistic random walks in random environments.     

Moderate deviations for a random walk in random scenery

We investigate the cumulative scenery process associated with random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramér’s condition. We prove moderate deviation principles in dimensions d≥2$d\ge 2$, covering all those regimes where rate and speed do not depend on the actual distribution of the scenery. For the case d≥4$d\ge 4$ we even obtain precise asymptotics for the probability of a moderate deviation, extending a classical central limit theorem of Kesten and Spitzer. For d≥3$d\ge 3$, an important ingredient in the proofs are new concentration inequalities for self-intersection local times of random walks, which are of independent interest, whilst for d=2$d=2$ we use a recent moderate deviation result for self-intersection local times, which is due to Bass, Chen and Rosen.     

On growth,recurrence and the Choquet-Deny Theorem for <Emphasis Type="Italic">p</Emphasis>-adic Lie groups

We first study the growth properties of p-adic Lie groups and its connection with p-adic Lie groups of type R and prove that a non-type R p-adic Lie group has compact neighbourhoods of identity having exponential growth. This is applied to prove the growth dichotomy for a large class of p-adic Lie groups which includes p-adic algebraic groups. We next study p-adic Lie groups that admit recurrent random walks and prove the natural growth conjecture connecting growth and the existence of recurrent random walks, precisely we show that a p-adic Lie group admits a recurrent random walk if and only if it has polynomial growth of degree at most two. We prove this conjecture for some other classes of groups also. We also prove the Choquet-Deny Theorem for compactly generated p-adic Lie groups of polynomial growth and also show that polynomial growth is necessary and sufficient for the validity of the Choquet-Deny for all spread-out probabilities on Zariski-connected p-adic algebraic groups. Counter example is also given to show that certain assumptions made in the main results can not be relaxed.     

Maximum likelihood estimator consistency for a ballistic random walk in a parametric random environment

We consider a one dimensional ballistic random walk evolving in an i.i.d. parametric random environment. We provide a maximum likelihood estimation procedure of the parameters based on a single observation of the path till the time it reaches a distant site, and prove that the estimator is consistent as the distant site tends to infinity. Our main tool consists in using the link between random walks and branching processes in random environments and explicitly characterising the limiting distribution of the process that arises. We also explore the numerical performance of our estimation procedure.     

Kinetic limits for a class of interacting particle systems

Summary We study one dimensional particle systems in which particles travel as independent random walks and collide stochastically. The collision rates are chosen so that each particle experiences finitely many collisions per unit time. We establish the kinetic limit and derive the discrete Boltzmann equation for the macroscopic particle density.     

Random walks in random environments without ellipticity

We consider random walks in random environments on Z^d${\mathbb{Z}}^d$. Under a transitivity hypothesis that is much weaker than the customary ellipticity condition, and assuming an absolutely continuous invariant measure on the space of the environments, we prove the ergodicity of the annealed process w.r.t. the dynamics “from the point of view of the particle”. This implies in particular that the environment viewed from the particle is ergodic. As an example of application of this result, we give a general form of the quenched Invariance Principle for walks in doubly stochastic environments with zero local drift (martingale condition).