English
Related papers

Related papers: On Statistical Estimation of Edge-Reinforced Rando…

200 papers

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

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

In order to serve better VR experiences to users, existing predictive methods of Redirected Walking (RDW) exploit future information to reduce the number of reset occurrences. However, such methods often impose a precondition during…

Human-Computer Interaction · Computer Science 2023-04-10 Sang-Bin Jeon , Jaeho Jung , Jinhyung Park , In-Kwon Lee

We study the Tree Builder Random Walk: a randomly growing tree, built by a walker as she is walking around the tree. Namely, at each time $n$, she adds a leaf to her current vertex with probability $p_n \asymp n^{-\gamma}$, $\gamma\in…

Probability · Mathematics 2024-12-09 Janos Engländer , Giulio Iacobelli , Gábor Pete , Rodrigo Ribeiro

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

Probability · Mathematics 2007-05-23 Robin Pemantle , Yuval Peres

This paper concerns the Vertex reinforced jump process (VRJP), the Edge reinforced random walk (ERRW) and their link with a random Schr\"odinger operator. On infinite graphs, we define a 1-dependent random potential $\beta$ extending that…

Probability · Mathematics 2018-07-20 Christophe Sabot , Xiaolin Zeng

Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states, for example those employed in…

Statistical Mechanics · Physics 2015-12-03 Michael Manhart , Willow Kion-Crosby , Alexandre V. Morozov

We consider one-dimensional excited random walks (ERWs) with i.i.d. markovian cookie stacks in the non-boundary recurrent regime. We prove that under diffusive scaling such an ERW converges in the standard Skorokhod topology to a multiple…

Probability · Mathematics 2020-08-18 Elena Kosygina , Thomas Mountford , Jonathon Peterson

A continuous time random walk (CTRW) is a random walk in which both spatial changes represented by jumps and waiting times between the jumps are random. The CTRW is coupled if a jump and its preceding or following waiting time are dependent…

Probability · Mathematics 2016-03-14 Adam Barczyk , Peter Kern

This paper deals with different models of random walks with a reinforced memory of preferential attachment type. We consider extensions of the Elephant Random Walk introduced by Sch\"utz and Trimper [2004] with a stronger reinforcement…

Probability · Mathematics 2020-10-16 Erich Baur

Self-interacting random walks (SIRWs) show long-range memory effects that result from the interaction of the random walker at time $t$ with the territory already visited at earlier times $t'<t$. This class of non-Markovian random walks has…

Statistical Mechanics · Physics 2024-04-25 Julien Brémont , Olivier Bénichou , Raphaël Voituriez

We consider a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory called the elephant random walk (ERW). We prove a strong invariance principle for the ERW. More specifically, we prove that, under a suitable…

Probability · Mathematics 2017-12-18 Cristian F. Coletti , Renato Gava , Gunter M. Schütz

The paper considers excited random walks (ERWs) on integers in i.i.d. environments with a bounded number of excitations per site. The emphasis is primarily on the critical case for the transition between recurrence and transience which…

Probability · Mathematics 2015-04-28 Dmitry Dolgopyat , Elena Kosygina

In this work, we discuss the smoothly amnesia-reinforced multidimensional elephant random walk (MARW). The scaling limit of the MARW is shown to exist in the diffusive, critical and superdiffusive regimes. We also establish the almost sure…

Probability · Mathematics 2023-01-23 Jiaming Chen , Lucile Laulin

Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…

Statistical Mechanics · Physics 2009-11-13 O. Benichou , R. Voituriez

We investigate the dynamics of a particle executing a general Continuous Time Random Walk (CTRW) in three dimensions under the influence of arbitrary time-varying external fields. Contrary to the general approach in recent works, our method…

Statistical Mechanics · Physics 2011-12-15 Shovan Dutta , Subhankar Ray , J. Shamanna

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

In this article, we consider the speed of the random walks in a (uniformly elliptic and i.i.d.) random environment (RWRE) under perturbation. We obtain the derivative of the speed of the RWRE w.r.t. the perturbation, under the assumption…

Probability · Mathematics 2016-02-24 Xiaoqin Guo

The combined Continuous Time Random Walk (CTRW) in position and momentum space is introduced, in the form of two coupled integral equations that describe the evolution of the probability distribution for finding a particle at a certain…

Chaotic Dynamics · Physics 2007-10-29 H. Isliker

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

Probability · Mathematics 2024-12-18 Sam Olesker-Taylor , Thomas Sauerwald , John Sylvester