The balanced excited random walk, introduced by Benjamini, Kozma and Schapira in $2011$, is defined as a discrete time stochastic process in $\mathbb Z^d$, depending on two integer parameters $1\le d_1,d_2\le d$, which whenever it is at a site $x\in\mathbb Z^d$ at time $n$, it jumps to $x\pm e_i$ with uniform probability, where $e_1,\ldots,e_d$ are the canonical vectors, for $1\le i\le d_1$, if the site $x$ was visited for the first time at time $n$, while it jumps to $x\pm e_i$ with uniform probability, for $1+d-d_2\le i\le d$, if the site $x$ was already visited before time $n$. Here we give an overview of this model when $d_1+d_2=d$ and introduce and study the cases when $d_1+d_2>d$. In particular, we prove that for all the cases $d\ge 5$ and most cases $d=4$, the balanced excited random walk is transient.
We give non-trivial upper and lower bounds on the range of the so-called Balanced Excited Random Walk in two dimensions, and verify a conjecture of Benjamini, Kozma and Schapira. To the best of our knowledge these are the first non-trivial results for this 2-dimensional model
We consider random walks in a balanced random environment in $\mathbb{Z}^d$, $d\geq 2$. We first prove an invariance principle (for $d\ge2$) and the transience of the random walks when $d\ge 3$ (recurrence when $d=2$) in an ergodic environment which is not uniformly elliptic but satisfies certain moment condition. Then, using percolation arguments, we show that under mere ellipticity, the above results hold for random walks in i.i.d. balanced environments.
We prove a quenched central limit theorem for balanced random walks in time dependent ergodic random environments which is not necessarily nearest-neigbhor. We assume that the environment satisfies appropriate ergodicity and ellipticity conditions. The proof is based on the use of a maximum principle for parabolic difference operators.
We prove a Harnack inequality for the solutions of a difference equation with non-elliptic balanced i.i.d. coefficients. Along the way we prove a (weak) quantitative homogenisation result, which we believe is of some interest too.
The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk step. We prove that this process is almost surely transient. The lower dimensional versions are discussed and various generalizations and related questions are proposed.
We consider random walks in a balanced i.i.d. random environment in $Z^d$ for $d\ge2$ and the corresponding discrete non-divergence form difference operators. We first obtain an exponential integrability of the heat kernel bounds. We then prove the optimal diffusive decay of the semigroup generated by the heat kernel for $d\ge3$. As a consequence, we deduce a functional central limit theorem for the environment viewed from the particle.
We prove a quenched local central limit theorem for continuous-time random walks in $\mathbb Z^d, d\ge 2$, in a uniformly-elliptic time-dependent balanced random environment which is ergodic under space-time shifts. We also obtain Gaussian upper and lower bounds for quenched and (positive and negative) moment estimates of the transition probabilities and asymptotics of the discrete Green function.
We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is genuinely d-dimensional and balanced we show a quenched invariance principle: for P almost every environment, the diffusive rescaled random walk converges to a Brownian motion with deterministic non-degenerate diffusion matrix. Within the i.i.d. setting, our result extend both Lawler's uniformly elliptic result and Guo and Zeitouni's elliptic result to the genera…
We establish via a probabilistic approach the quenched invariance principle for a class of long range random walks in independent (but not necessarily identically distributed) balanced random environments, with the transition probability from $x$ to $y$ on average being comparable to $|x-y|^{-(d+α)}$ with $α\in (0,2]$. We use the martingale property to estimate exit time from balls and establish tightness of the scaled processes, and apply the uniqueness of the martingale problem to identify the limiting process. When $α\in (0,1)$, our approach works even for non-balanced cases. When $α=2$, un…
In this thesis, we study the diffusive and ballistic behaviors of random walk in random environment (RWRE) in an integer lattice with dimension at least 2. Our contributions are in three directions: a conditional law of large numbers and regeneration structures for RWRE in Gibbsian environments, quenched invariance principles for balanced elliptic (but non uniformly elliptic) environments, and a proof of the Einstein relation for balanced iid uniformly elliptic environments.
Random Walks in Dirichlet Environment (RWDE) correspond to Random Walks in Random Environment (RWRE) on $\Bbb{Z}^d$ where the transition probabilities are i.i.d. at each site with a Dirichlet distribution. Hence, the model is parametrized by a family of positive weights $(α_i)_{i=1, \ldots, 2d}$, one for each direction of $\Bbb{Z}^d$. In this case, the annealed law is that of a reinforced random walk, with linear reinforcement on directed edges. RWDE have a remarkable property of statistical invariance by time reversal from which can be inferred several properties that are still inaccessible f…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory modulating factor -- for such models have been obtained. In the one-dimensional nearest-neighbor case with i.i.d. transition probabilities, local limits of uniformly elliptic ballistic walks are now well understood. We complete the picture by proving a similar result for the only recurrent case, namely the balanced one, in which such a walk is diffusive. The…
We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $ε$-close to those of simple random walk. We assume that the environment is balanced in one fixed coordinate direction, and invariant under reflection in the coordinate hyperplanes. The invariance condition was used in Baur and Bolthausen (2014) as a weaker replacement of isotropy to study exit distributions. We obtain precise results on mean sojourn times in large balls and prove a quenched invariance principle, showing that for almost all environments, the random wal…
We identify a relationship between a random walk on a certain Euclidean lattice and incidence matrices of balanced incomplete block designs. We then compute the return probability of the random walk and use it to obtain the asymptotic number of BIBD incidence matrices (as the number of columns increases). Our strategy is similar in spirit to the one used by de Launey and Levin to count partial Hadamard matrices.
In this article, we consider the speed of the random walks in a (uniformly elliptic and i.i.d.) random environment (RWRE) under perturbation. We obtain the derivative of the speed of the RWRE w.r.t. the perturbation, under the assumption that one of the following holds: (i) the environment is balanced and the perturbation satisfies a Kalikow-type ballisticity condition, (ii) the environment satisfies Sznitman's ballisticity condition. This is a generalized version of the Einstein relation for RWRE. Our argument is based on a modification of Lebowitz-Rost's argument developed in [Stochastic Pro…
We consider discrete non-divergence form difference operators in a random environment and the corresponding process--the random walk in a balanced random environment in $\mathbb{Z}^d$ with a finite range of dependence. We first quantify the ergodicity of the environment from the point of view of the particle. As a consequence, we quantify the quenched central limit theorem of the random walk with an algebraic rate. Furthermore, we prove an algebraic rate of convergence for the homogenization of the Dirichlet problems for both elliptic and parabolic non-divergence form difference operators.
We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which the weak quenched limit is constructed as a function of the invariant measure of the environment viewed from the walk. We bypass the need to show the existence of this invariant measure. Instead, we find the limit of the quadratic variation of the walk and give an explicit formula for it.
The Bernoulli sieve is a version of the classical balls-in-boxes occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative random walk, also known as the residual allocation model or stick-breaking. We give an overview of the limit theorems concerning the number of boxes occupied by some balls out of the first $n$ balls thrown, and present some new results concerning the number of empty boxes within the occupancy range.
We prove that any $\ell$ positive definite $d \times d$ matrices, $M_1,\ldots,M_\ell$, of full rank, can be simultaneously spectrally balanced in the following sense: for any $k < d$ such that $\ell \leq \lfloor \frac{d-1}{k-1} \rfloor$, there exists a matrix $A$ satisfying $\frac{λ_1(A^T M_i A) }{ \mathrm{Tr}( A^T M_i A ) } < \frac{1}{k}$ for all $i$, where $λ_1(M)$ denotes the largest eigenvalue of a matrix $M$. This answers a question posed by Peres, Popov and Sousi and completes the picture described in that paper regarding sufficient conditions for transience of self-interacting random wa…
In the standard ball-in-bins experiment, a well-known scheme is to sample $d$ bins independently and uniformly at random and put the ball into the least loaded bin. It can be shown that this scheme yields a maximum load of $\log\log n/\log d+O(1)$ with high probability. Subsequent work analyzed the model when at each time, $d$ bins are sampled through some correlated or non-uniform way. However, the case when the sampling for different balls are correlated are rarely investigated. In this paper we propose three schemes for the ball-in-bins allocation problem. We assume that there is an underly…
A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of characterization of cyclic random walks in some special cases showing that it is related to several remarkable and classical results. In particular we introduce the notion of balanced measure and show that a translation invariant random walk on $\mathbb Z^d$ is cyclic if and only if its transition probability is balanced. The characterization of the extremal elements…
In this paper we propose algorithms for allocating $n$ sequential balls into $n$ bins that are interconnected as a $d$-regular $n$-vertex graph $G$, where $d\ge3$ can be any integer.Let $l$ be a given positive integer. In each round $t$, $1\le t\le n$, ball $t$ picks a node of $G$ uniformly at random and performs a non-backtracking random walk of length $l$ from the chosen node.Then it allocates itself on one of the visited nodes with minimum load (ties are broken uniformly at random). Suppose that $G$ has a sufficiently large girth and $d=ω(\log n)$. Then we establish an upper bound for the m…
We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on their result by Teyssier
We consider the limiting behaviour of the point processes associated with a branching random walk with supercritical branching mechanism and balanced regularly varying step size. Assuming that the underlying branching process satisfies Kesten-Stigum condition, it is shown that the point process sequence of properly scaled displacements coming from the n-th generation converges weakly to a Cox cluster process. In particular, we establish that a conjecture of Brunet and Derrida (2011) remains valid in this setup, investigate various other issues mentioned in their paper and recover the main resu…
This article provides an overview of recent work on descriptions and properties of the convex minorant of random walks and Lévy processes which summarize and extend the literature on these subjects. The results surveyed include point process descriptions of the convex minorant of random walks and Lévy processes on a fixed finite interval, up to an independent exponential time, and in the infinite horizon case. These descriptions follow from the invariance of these processes under an adequate path transformation. In the case of Brownian motion, we note how further special properties of this pro…
We give a short overview on our work on ancestral lineages in spatial population models with local regulation. We explain how an ancestral lineage can be interpreted as a random walk in a dynamic random environment. Defining regeneration times allows to prove central limit theorems for such walks. We also consider several ancestral lineages in the same population and show for one prototypical example that in one dimension the corresponding system of coalescing walks converges to the Brownian web.
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 introduce via perturbation a class of random walks in reversible dynamic environments having a spectral gap. In this setting one can apply the mathematical results derived in http://arxiv.org/abs/1602.06322. As first results, we show that the asymptotic velocity is antisymmetric in the perturbative parameter and, for a subclass of random walks, we characterize the velocity and a stationary distribution of the environment seen from the walker as suitable series in the perturbative parameter. We then consider as a special case a random walk on the East model that tends to follow dynamical int…
We study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform nearest neighbour random walks which are balanced in all but one direction. This gives a model with two parameters. We present conditions on the parameters for recurrence and transience, revealing interesting differences between dimension $d=2$ and dimension $d \geq 3$. Our proofs make use of (refined) couplings with branching random walks for the transience, and …
Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been introduced in a series of papers by Chernov and Temkin as a model for DNA chain replication and crystal growth, and also as a model for turbulent behavior in fluids through a Lorentz gas description by Sinai. It is a simple but powerful model for a variety of complex large-scale disordered phenomena arising from fields such as physics, biology and engineering. …
We consider an online network routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between the two endpoints of a call, via an intermediate node, and assigns the call to the first route with spare capacity on each link, if there is such a route. The balanced dynamic alternative routing algorithm simultaneously selects $d$ random two-link routes, and the call is accepted on a route minimising the maximum of the loads on its two links, provided nei…
We survey the properties of the log-correlated Gaussian field (LGF), which is a centered Gaussian random distribution (generalized function) $h$ on $\mathbb R^d$, defined up to a global additive constant. Its law is determined by the covariance formula $$\mathrm{Cov}\bigl[ (h, ϕ_1), (h, ϕ_2) \bigr] = \int_{\mathbb R^d \times \mathbb R^d} -\log|y-z| ϕ_1(y) ϕ_2(z)dydz$$ which holds for mean-zero test functions $ϕ_1, ϕ_2$. The LGF belongs to the larger family of fractional Gaussian fields obtained by applying fractional powers of the Laplacian to a white noise $W$ on $\mathbb R^d$. It takes the f…
In this paper, we establish a quenched invariance principle for the random walk on a certain class of infinite, aperiodic, oriented random planar graphs called "T-graphs" [Kenyon-Sheffield04]. These graphs appear, together with the corresponding random walk, in a work [Kenyon07] about the lozenge tiling model, where they are used to compute correlations between lozenges inside large finite domains. The random walk in question is balanced, i.e. it is automatically a martingale. Our main ideas are inspired by the proof of a quenched central limit theorem in stationary ergodic environment on $\ma…
We study a model of competition between two types evolving as branching random walks on $\mathbb{Z}^d$. The two types are represented by red and blue balls respectively, with the rule that balls of different colour annihilate upon contact. We consider initial configurations in which the sites of $\mathbb{Z}^d$ contain one ball each, which are independently coloured red with probability $p$ and blue otherwise. We address the question of \emph{fixation}, referring to the sites eventually settling for a given colour, or not. Under a mild moment condition on the branching rule, we prove that the p…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced replacement schemes associated with bounded increment random walks on it. We prove central and local limit theorems for the random color of the $n$-th selected ball and show that irrespective of the null recurrent or transient behavior of the underlying random walks, the asymptotic distribution is Gaussian after appropriate centering and scaling. We show tha…
We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never collide. We study the asymptotic behavior of local statistics of this process started from an arbitrary initial configuration on short times $T\ll N$ as $N\to+\infty$. We show that if the particle density of the initial configuration is bounded away from $0$ and $1$ down to scales $\mathsf{D}\ll T$ in a neighborhood of size $\mathsf{Q}\gg T$ of some locatio…
The present paper provides an overview of results obtained in four recent papers by the authors. These papers address the problem of intermittency for the Parabolic Anderson Model in a \emph{time-dependent random medium}, describing the evolution of a ``reactant'' in the presence of a ``catalyst''. Three examples of catalysts are considered: (1) independent simple random walks; (2) symmetric exclusion process; (3) symmetric voter model. The focus is on the annealed Lyapunov exponents, i.e., the exponential growth rates of the successive moments of the reactant. It turns out that these exponent…
