Related papers: Randomly growing braid on three strands and the ma…
We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d.\ random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
In the book [FIM], original methods were proposed to determine the invariant measure of random walks in the quarter plane with small jumps, the general solution being obtained via reduction to boundary value problems. Among other things, an…
We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different…
The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…
Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…
We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…
In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature,…
Consider a discrete-time supercritical discounted branching random walk, in which increments at depth $k$ are independent and identically distributed with the same law as $m^{-kH}Y$, where $Y$ has a fixed law, $H>0$, and $m>1$ is the…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
We consider a random walk in random environment in the low disorder regime on $\mathbb Z^d$. That is, the probability that the random walk jumps from a site $x$ to a nearest neighboring site $x+e$ is given by $p(e)+\epsilon \xi(x,e)$, where…
In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
We consider the symplectic representation $\rho_n$ of a braid group $B(n)$ in $Sp(2l,\mathbb{Z})$, for $l=\Big[\dfrac{n-1}{2}\Big]$. If $P$ is a polynomial on the $4l^2$ coefficients of the matrices in $Sp(2l,\mathbb{Z})$, we show that the…
The branching annihilating random walk is studied on a random graph whose sites have uniform number of neighbors (z). The Monte Carlo simulations in agreement with the generalized mean-field analysis indicate that the concentration decreses…
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…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…