English
Related papers

Related papers: Random walk with random resetting to the maximum

200 papers

We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…

Probability · Mathematics 2011-07-20 Itai Benjamini , Ori Gurel-Gurevich , Boris Solomyak

We prove that the law of a random walk $X_n$ is determined by the one-dimensional distributions of $\max(X_n, 0)$ for $n = 1, 2, \ldots$, as conjectured recently by Lo\"ic Chaumont and Ron Doney. Equivalently, the law of $X_n$ is determined…

Probability · Mathematics 2019-02-25 Mateusz Kwaśnicki

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

The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and…

Probability · Mathematics 2021-02-05 Giulio Iacobelli , Rodrigo Ribeiro , Glauco Valle , Leonel Zuaznabar

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

Probability · Mathematics 2011-06-21 Francis Comets , Mikhail V. Menshikov , Stanislav Volkov , Andrew R. Wade

One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…

High Energy Physics - Lattice · Physics 2009-10-22 Carl M. Bender , Stefan Boettcher , Lawrence R. Mead

We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…

Probability · Mathematics 2011-12-07 Ofer Zeitouni , Ming Fang

Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…

Probability · Mathematics 2014-02-11 Ross G. Pinsky

A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…

Probability · Mathematics 2022-07-05 Jean Bertoin

We study one-dimensional discrete as well as continuous time random walks, either with a fixed number of steps (for discrete time) $n$ or on a fixed time interval $T$ (for continuous time). In both cases, we focus on symmetric probability…

Statistical Mechanics · Physics 2017-04-03 Philippe Mounaix , Gregory Schehr

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been…

Probability · Mathematics 2013-09-11 Alexander Drewitz , Alejandro F. Ramírez

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

Probability · Mathematics 2022-05-12 Tuan-Minh Nguyen

We consider a random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice. The walk starts at the origin and is conditioned to hit a remote location y on the lattice. We prove that the expected time under the…

Probability · Mathematics 2012-01-04 Elena Kosygina , Thomas Mountford

A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…

Statistical Mechanics · Physics 2010-07-28 G. Le Caer

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

Probability · Mathematics 2023-02-14 E. Filichkina , E. Yarovaya

We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…

High Energy Physics - Lattice · Physics 2009-10-22 S. Boettcher

We consider a one dimensional ballistic random walk evolving in a parametric independent and identically distributed random environment. We study the asymptotic properties of the maximum likelihood estimator of the parameter based on a…

Statistics Theory · Mathematics 2014-04-29 Mikael Falconnet , Dasha Loukianova , Catherine Matias

We consider an exactly solvable model of branching random walk with random selection, which describes the evolution of a population with $N$ individuals on the real line. At each time step, every individual reproduces independently, and its…

Probability · Mathematics 2018-10-09 Aser Cortines , Bastien Mallein

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

Data Structures and Algorithms · Computer Science 2010-07-20 John Alexandris , Gregory Karagiorgos 'and' Ioannis Stavrakakis