Related papers: Time Dependent Biased Random Walks

The asymptotics of the probability that the self-intersection local time of a random walk on $\Z^d$ exceeds its expectation by a large amount is a fascinating subject because of its relation to some models from Statistical Mechanics, to…

A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability $\alpha$, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen…

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…

Let $X$ be a continuous time random walk on a weighted graph. Given the on-diagonal upper bounds of transition probabilities at two vertices $x_1$ and $x_2$, we use an adapted metric initiated by Davies, and obtain Gaussian upper estimates…

We study discounted random walks in directed graphs. In each step, the walk either terminates with a constant probability $\alpha$, or proceeds to a random out-neighbor. Our goal is to estimate the probability $\pi(s, t)$ that a discounted…

Step adjustment can improve the gait robustness of biped robots, however the adaptation of step timing is often neglected as it gives rise to non-convex problems when optimized over several footsteps. In this paper, we argue that it is not…

Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

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…

Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…

We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…

In this note we first consider local times of random walks killed at leaving positive half-axis. We prove that the distribution of the properly rescaled local time at point $N$ conditioned on being positive converges towards an exponential…

We present a new approach of topology biased random walks for undirected networks. We focus on a one parameter family of biases and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of…

We consider a system of asymmetric independent random walks on $\mathbb{Z}^d$, denoted by $\{\eta_t,t\in{\mathbb{R}}\}$, stationary under the product Poisson measure $\nu_{\rho}$ of marginal density $\rho>0$. We fix a pattern $\mathcal{A}$,…

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c. For b<b_c,…

Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led…