English
Related papers

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

200 papers

Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…

Probability · Mathematics 2019-09-13 Mikhail Beliayeu , Petr Chmel , Bhargav Narayanan , Jan Petr

We consider the range of a one-parameter family of self-interacting walks on the integers up to the time of exit from an interval. We derive the weak convergence of an appropriately scaled range. We show that the distribution functions of…

Probability · Mathematics 2014-07-28 Kazuki Okamura

The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…

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

We prove an invariance principle for linearly edge reinforced random walks on $\gamma$-stable critical Galton-Watson trees, where $\gamma \in (1,2]$ and where the edge joining $x$ to its parent has rescaled initial weight $d(\rho,…

Probability · Mathematics 2025-09-30 George Andriopoulos , Eleanor Archer

We consider a broad class of Continuous Time Random Walks with large fluctuations effects in space and time distributions: a random walk with trapping, describing subdiffusion in disordered and glassy materials, and a L\'evy walk process,…

Statistical Mechanics · Physics 2015-06-23 R. Burioni , G. Gradenigo , A. Sarracino , A. Vezzani , A. Vulpiani

We define here a \textit{directed edge reinforced random walk} on a connected locally finite graph. As the name suggests, this walk keeps track of its past, and gives a bias towards directed edges previously crossed proportional to the…

Probability · Mathematics 2020-03-16 Dirk Erhard , Tertuliano Franco , Guilherme Reis

In this article we study a one dimensional model for a polymer in a poor solvent: the random walk on $\mathbb{Z}$ penalized by its range. More precisely, we consider a Gibbs transformation of the law of the simple symmmetric random walk by…

Probability · Mathematics 2022-07-21 Nicolas Bouchot

Suppose we are given an infinite, finitely generated group $G$ and a transient random walk on the wreath product $(\mathbb{Z}/ 2\mathbb{Z})\wr G$, such that its projection on $G$ is transient and has finite first moment. This random walk…

Probability · Mathematics 2008-10-02 Lorenz Gilch

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal

We are interested in the behaviour of the range of the Campanino and P\'etritis random walk, namely a simple random walk on the lattice $\mathbb Z^2$ with random orientations of the horizontal layers. We also study the range of random walks…

Probability · Mathematics 2015-08-12 Nadine Guillotin-Plantard , Françoise Pène

Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…

Probability · Mathematics 2007-05-23 Massimo Campanino , Dimitri Petritis

We consider a vertex reinforced random walk on the integer lattice with sub-linear reinforcement. Under some assumptions on the regular variation of the weight function, we characterize whether the walk gets stuck on a finite interval. When…

Probability · Mathematics 2012-07-18 Anne-Laure Basdevant , Bruno Schapira , Arvind Singh

We study the effect of a large obstacle on the so called residence time, i.e., the time that a particle performing a symmetric random walk in a rectangular (2D) domain needs to cross the strip. We observe a complex behavior, that is we find…

Statistical Mechanics · Physics 2018-05-23 Alessandro Ciallella , Emilio N. M. Cirillo , Julien Sohier

In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…

Probability · Mathematics 2017-06-13 Bastien Mallein

We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…

Statistical Mechanics · Physics 2008-08-28 A. N. Rogers , C. Richard , A. J. Guttmann

We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…

Statistical Mechanics · Physics 2007-05-23 Jae Dong Noh , Heiko Rieger

This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…

Probability · Mathematics 2018-12-11 Alan Hammond , Tyler Helmuth

Following similar analysis to that in Lacoin (PTRF 159, 777-808, 2014), we can show that the quenched critical point for self-avoiding walk on random conductors on the d-dimensional integer lattice is almost surely a constant, which does…

Probability · Mathematics 2016-05-04 Yuki Chino , Akira Sakai

We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the…

Probability · Mathematics 2011-08-25 Dmitry Ioffe , Yvan Velenik

Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…

Probability · Mathematics 2015-05-30 Tom Kennedy