Related papers: Maximal Entropy Random Walks in Z: Random and non-…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…
Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…
We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex
Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…
Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest to sociologists, computer scientists and marketeers alike.…
In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…
The physics of glass has been a significant topic of interest for decades. Dynamical facilitation is widely believed to be an important characteristic of glassy dynamics, but the precise mechanism is still under debate. We propose a lattice…
We consider a special case of random walk in random environment (RWRE) on Z^d where the environment is periodic (RWPE). Under natural conditions, we show that law of large numbers and central limit theorem holds. In the ballistic nearest…
We revisit an old minor topic in algorithms, the deterministic walk on a finite graph which always moves toward the nearest unvisited vertex until every vertex is visited. There is an elementary connection between this cover time and…
We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…
We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…
We study asymptotic properties of the Green metric associated with transient random walks on countable groups. We prove that the rate of escape of the random walk computed in the Green metric equals its asymptotic entropy. The proof relies…
There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…
This work is motivated by the study of some two-dimensional random walks in random environment (RWRE) with transition probabilities independent of one coordinate of the walk. These are non-reversible models and can not be treated by…
We consider a family of one-dimensional self interacting walks whose dynamics characterized by a monotone weight function $w$ on $\mathbb{N}\cup \{0\}$. The weight function takes the form $w(n) = (1 + 2^p Bn^{-p} + O(n^{-1-\kappa}))^{-1}$,…
Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its…
Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the $n \to 0$ limit of…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…