English
Related papers

Related papers: "True" self-avoiding walks on general trees

200 papers

In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit…

Probability · Mathematics 2017-08-23 Daniel Kious , Vladas Sidoravicius

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

Statistical Mechanics · Physics 2011-08-25 Zhongzhi Zhang , Xintong Li , Yuan Lin , Guanrong Chen

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…

Probability · Mathematics 2018-12-21 Pierre Andreoletti , Roland Diel

We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…

Probability · Mathematics 2007-05-23 Mikhail Menshikov , Dimitri Petritis , Serguei Popov

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Probability · Mathematics 2023-07-13 Ben Morris , Hamilton Samraj Santhakumar

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

Probability · Mathematics 2012-05-08 Amir Dembo , Nike Sun

This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent…

Probability · Mathematics 2007-05-23 Robin Pemantle

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Probability · Mathematics 2020-01-06 Marek Biskup , Pierre-François Rodriguez

The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $\lambda$. There is a threshold for $\lambda$, which is called $\lambda_w$, that separates almost sure global extinction from global…

Probability · Mathematics 2017-04-28 Daniela Bertacchi , Cristian F. Coletti , Fabio Zucca

We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…

Probability · Mathematics 2007-05-23 Mikhail Menshikov , Dimitri Petritis

We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…

Statistical Mechanics · Physics 2012-08-27 Ronald Dickman , Francisco Fontenele Araujo, , Daniel ben-Avraham

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…

Disordered Systems and Neural Networks · Physics 2009-11-10 Carlos P. Herrero

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

Condensed Matter · Physics 2009-10-28 C. Godreche , J. M. Luck , M. R. Evans , D. Mukamel , S. Sandow , E. R. Speer

The simple random walk on $\mathbb{Z}^p$ shows two drastically different behaviours depending on the value of $p$: it is recurrent when $p\in\{1,2\}$ while it escapes (with a rate increasing with $p$) as soon as $p\geq3$. This classical…

Data Structures and Algorithms · Computer Science 2023-08-22 Farah Ben Naoum , Christophe Godin , Romain Azaïs

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

Probability · Mathematics 2022-06-22 Hua-Ming Wang , Lanlan Tang

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

We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…

Probability · Mathematics 2015-03-17 Nina Gantert , Sebastian Müller , Serguei Popov , Marina Vachkovskaia

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

Probability · Mathematics 2018-09-20 Andrea Collevecchio , Paul Jung

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

Probability · Mathematics 2007-05-23 Francis Comets , Serguei Popov