Related papers: Noise sensitivity of random walks on groups
The paper analyzes a specific class of random walks on quotients of $X:=\text{SL}(k,{\Bbb R})/ \Gamma$ for a lattice $\Gamma$. Consider a one parameter diagonal subgroup, $\{g_t\}$, with an associated abelian expanding horosphere, $U\cong…
Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.
The times of Brownian local minima, maxima and their union are three distinct examples of local, stationary, dense, random countable sets associated with classical Wiener noise. Being local means, roughly, determined by the local behavior…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
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 consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
This is an introductory level survey of some topics from a new branch of fractal analysis -- the theory of self-similar groups. We discuss recent works on random walks on self-similar groups and their applications to the problem of…
We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters…
We introduce a new type of random walk where the definition of edge reinforcement is very different from the one in the reinforced random walk models studied so far, and investigate its basic properties, such as null/positive recurrence,…
In experiments, the dynamical behavior of systems is reflected in time series. Due to the finiteness of the observational data set it is not possible to reconstruct the invariant measure up to arbitrary fine resolution and arbitrary high…
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…
Given a pair of isolated devices that accept random binary inputs and return binary outputs, a user can deduce from the observed data alone if the underlying mechanism can be explained classically. Bell's theorem further states that a…
Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…
The purpose of this paper is to establish, via a martingale approach, some refinements on the asymptotic behavior of the one-dimensional elephant random walk (ERW). The asymptotic behavior of the ERW mainly depends on a memory parameter $p$…
We consider the $1$-dimensional reflected Brownian motion and $3$-dimensional Bessel process and the general models. By decomposing the hitting times of consecutive sites into loops, we obtain identities, called loop identities, for the…
We define a random walk of a particle in $\mathbb{R}^3$ where the space is rotating. The particle is not glued to the space and will collide with it at random times, resulting in changes in its velocity and direction. After many collisions,…
The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…
The noise of signals or currents consisting from a sequence of pulses, elementary events or moving discrete objects (particles) is analyzed. A simple analytically solvable model is investigated in detail both analytically and numerically.…
This document contains supplementary material for the main articles in our Random Cayley Graphs project. We prove refined results about simple random walks on the integers and on the cycle. We are primarily interested in the entropy of…