English
Related papers

Related papers: Self-repelling random walk with directed edges on …

200 papers

A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…

Networking and Internet Architecture · Computer Science 2017-08-24 Vinod Kulathumani , Masahiro Nakagawa , Anish Arora

We study sequences of random numbers {Z[1],Z[2],Z[3],...,Z[n]} -- which can be considered random walks with reflecting barriers -- and define their "types" according to whether Z[i] > Z[i+1], (a down-movement), or Z[i] < Z[i+1]…

adap-org · Physics 2008-02-03 George G. Szpiro

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

Probability · Mathematics 2011-01-24 Gerard Ben Arous , Alan Hammond

The critical behaviour of directed self-avoiding walks is studied on parabolic-like systems with a free boundary at x=\pm Ct^\alpha. Using a scaling argument, 1/C is shown to be a marginal variable when \alpha=\nu_\perp/\nu_\parallel=1/2,…

Statistical Mechanics · Physics 2007-05-23 L. Turban

In this paper, we study a transient spatially inhomogeneous random walk with asymptotically zero drifts on the lattice of the positive half line. We give criteria for the finiteness of the number of points having exactly the same local time…

Probability · Mathematics 2024-06-04 Hua-Ming Wang

We consider elliptic random walks in i.i.d. random environments on $\mathbb{Z}^d$. The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for…

Probability · Mathematics 2015-06-30 Alexander Fribergh , Daniel Kious

We consider the motion of a discrete random surface interacting by exclusion with a random wall. The heights of the wall at the sites of $\Z^d$ are i.i.d.\ random variables. Fixed the wall configuration, the dynamics is given by the serial…

Probability · Mathematics 2007-05-23 L. R. G. Fontes , M. Vachkovskaia , A. Yambartsev

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

Probability · Mathematics 2007-05-23 L. R. G. Fontes , P. Mathieu

We study an homogeneous irreducible markovian random walk in a square lattice of arbitrary dimension, with an antisymmetric perturbation acting only in one point. We compute exactly spatial correction to the diffusive behaviour in the…

Probability · Mathematics 2016-05-24 Giuseppe Genovese , Renato Lucà

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…

Probability · Mathematics 2024-01-30 Vishwaraj Doshi , Jie Hu , Do Young Eun

We consider a continuous-time random walk which is defined as an interpolation of a random walk on a point process on the real line. The distances between neighboring points of the point process are i.i.d. random variables in the normal…

Probability · Mathematics 2020-01-08 Alessandra Bianchi , Marco Lenci , Françoise Pène

We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…

Probability · Mathematics 2020-12-24 Kohei Uchiyama

We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…

Probability · Mathematics 2025-11-13 Sébastien Ott , Yvan Velenik

We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…

Probability · Mathematics 2017-03-30 Janos Englander , Yuval Peres

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

Probability · Mathematics 2026-05-04 Tuan-Minh Nguyen

We study a class of nearest-neighbor discrete time integer random walks introduced by Zerner, the so called multi-excited random walks. The jump probabilities for such random walker have a drift to the right whose intensity depends on a…

Probability · Mathematics 2011-08-15 Thomas Mountford , Leandro P. R. Pimentel , Glauco Valle

For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…

Probability · Mathematics 2019-04-24 Kohei Uchiyama

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

Probability · Mathematics 2014-01-31 Massimo Campanino , Dimitri Petritis

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Probability · Mathematics 2012-05-03 Alan Hammond
‹ Prev 1 3 4 5 6 7 10 Next ›