Related papers: Annealed invariance principle for random walks on …
The node2vec random walk is a non-Markovian random walk on the vertex set of a graph, widely used for network embedding and exploration. This random walk model is defined in terms of three parameters which control the probability of,…
We consider the random walk on a simple point process on $\Bbb{R}^d$, $d\geq2$, whose jump rates decay exponentially in the $\alpha$-power of jump length. The case $\alpha =1$ corresponds to the phonon-induced variable-range hopping in…
We derive an annealed large deviation principle (LDP) for the normalised and rescaled local times of a continuous-time random walk among random conductances (RWRC) in a time-dependent, growing box in $\Z^d$. We work in the interesting case…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
Contrary to the theory of Markov processes, no general theory exists for the so called nonlinear Markov processes. We study an example of "nonlinear Markov process" related to classical probability theory, merely to random walks. This model…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
In recent years, graph neural networks (GNNs) have gained increasing popularity and have shown very promising results for data that are represented by graphs. The majority of GNN architectures are designed based on developing new…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit…
We study variable-speed random walks on $\mathbb Z$ driven by a family of nearest-neighbor time-dependent random conductances $\{a_t(x,x+1)\colon x\in\mathbb Z, t\ge0\}$ whose law is assumed invariant and ergodic under space-time shifts. We…
In this paper we revise the theory of turnpikes in discounted Markov decision processes, prove the turnpike theorem for the undiscounted model and apply the results to the specific random walk.
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
We consider a random walk on $\R^d$ in a polynomially mixing random environment that is refreshed at each time step. We use a martingale approach to give a necessary and sufficient condition for the almost-sure functional central limit…
We study a continuous-time random walk, $X$, on $\mathbb{Z}^d$ in an environment of dynamic random conductances taking values in $(0, \infty)$. We assume that the law of the conductances is ergodic with respect to space-time shifts. We…
We consider transient random walks on a strip in a random environment. The model was introduced by Bolthausen and Goldsheid [Comm. Math. Phys. 214 (2000) 429--447]. We derive a strong law of large numbers for the random walks in a general…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…