English
Related papers

Related papers: Range of (1,2) random walk in random environment

200 papers

The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…

Quantum Physics · Physics 2013-05-29 Alex D. Gottlieb

We study quenched distributions on random walks in a random potential on integer lattices of arbitrary dimension and with an arbitrary finite set of admissible steps. The potential can be unbounded and can depend on a few steps of the walk.…

Probability · Mathematics 2011-12-15 Firas Rassoul-Agha , Timo Seppalainen , Atilla Yilmaz

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

Probability · Mathematics 2013-03-07 Mikko Stenlund

We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…

Probability · Mathematics 2016-12-01 Anastasios Matzavinos , Alexander Roitershtein , Youngsoo Seol

We consider a random walk with transition probabilities weakly dependent on an environment with a deterministic, but strongly chaotic, evolution. We prove that for almost all initial conditions of the environment the walk satisfies the CLT.

Probability · Mathematics 2008-04-23 Dmitry Dolgopyat , Carlangelo Liverani

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

Probability · Mathematics 2013-09-20 Christophe Sabot , Laurent Tournier

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

Probability · Mathematics 2018-05-25 Oriane Blondel , Marcelo R. Hilario , Augusto Teixeira

Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…

Probability · Mathematics 2007-05-23 Nina Gantert , Wolfgang König , Zhan Shi

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…

Probability · Mathematics 2024-09-20 Pierre Andreoletti , Alexis Kagan

We study a self-attractive random walk such that each trajectory of length $N$ is penalised by a factor proportional to $\exp ( - |R_N|)$, where $R_N$ is the set of sites visited by the walk. We show that the range of such a walk is close…

Probability · Mathematics 2020-03-04 Nathanael Berestycki , Raphael Cerf

A particle moves randomly over the integer points of the real line. Jumps of the particle outside the membrane (a fixed "locally perturbating set") are i.i.d., have zero mean and finite variance, whereas jumps of the particle from the…

Probability · Mathematics 2015-04-28 Alexander Iksanov , Andrey Pilipenko

We consider transient nearest-neighbor random walks in random environment on Z. For a set of environments whose probability is converging to 1 as time goes to infinity, we describe the fluctuations of the hitting time of a level n, around…

Probability · Mathematics 2013-04-16 Nathanaël Enriquez , Christophe Sabot , Laurent Tournier , Olivier Zindy

This paper explores a conditional Gibbs theorem for a random walkinduced by i.i.d. (X_{1},..,X_{n}) conditioned on an extreme deviation of its sum (S_{1}^{n}=na_{n}) or (S_{1}^{n}>na_{n}) where a_{n}\rightarrow\infty. It is proved that when…

Statistics Theory · Mathematics 2012-07-04 Michel Broniatowski , Zhansheng Cao

We consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…

Probability · Mathematics 2008-12-18 Bruno Schapira

Suppose we are given a homogeneous tree $\mathcal{T}_q$ of degree $q\geq 3$, where at each vertex sits a lamp, which can be switched on or off. This structure can be described by the wreath product $(\mathbb{Z}/2)\wr \Gamma$, where…

Probability · Mathematics 2007-08-29 Lorenz Gilch

We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. Homogenization and regeneration techniques combine to prove a law of large numbers and an averaged invariance…

Probability · Mathematics 2007-06-13 F. Rassoul-Agha , T. Seppalainen

In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk…

Mathematical Physics · Physics 2015-06-22 Maurizio Serva

Suppose that $k$ runners having different constant speeds run laps on a circular track of unit length. The Lonely Runner Conjecture states that, sooner or later, any given runner will be at distance at least $1/k$ from all the other…

Combinatorics · Mathematics 2012-02-07 Sebastian Czerwiński
‹ Prev 1 8 9 10 Next ›