English
Related papers

Related papers: Hitting times for random walks with restarts

200 papers

We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…

Probability · Mathematics 2009-06-18 Kevin Ford

We consider a system of asymmetric independent random walks on $\mathbb{Z}^d$, denoted by $\{\eta_t,t\in{\mathbb{R}}\}$, stationary under the product Poisson measure $\nu_{\rho}$ of marginal density $\rho>0$. We fix a pattern $\mathcal{A}$,…

Probability · Mathematics 2007-05-23 Amine Asselah , Pablo A. Ferrari

An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…

Statistical Mechanics · Physics 2007-05-23 Luis Acedo , Santos B. Yuste

The distribution of the first positive position reached by a random walker starting at the origin is central to the analysis of extremes and records in one-dimensional random walks. In this work, we present a detailed and self-contained…

Statistical Mechanics · Physics 2025-10-21 Claude Godrèche , Jean-Marc Luck

In this paper we define new Monte Carlo type classical and quantum hitting times, and we prove several relationships among these and the already existing Las Vegas type definitions. In particular, we show that for some marked state the two…

Quantum Physics · Physics 2018-03-22 Frederic Magniez , Ashwin Nayak , Peter C. Richter , Miklos Santha

We study the first passage times of discrete-time branching random walks in ${\mathbb R}^d$ where $d\geq 1$. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage…

Probability · Mathematics 2026-01-06 Jose Blanchet , Wei Cai , Shaswat Mohanty , Zhenyuan Zhang

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

Probability · Mathematics 2014-01-31 Massimo Campanino , Dimitri Petritis

To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various…

Probability · Mathematics 2025-12-02 Michael J. Larsen

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

Statistical Mechanics · Physics 2019-09-02 Reza Sepehrinia , Abbas Ali Saberi , Hor Dashti-Naserabadi

We make use of the Open Quantum Random Walk setting due to S. Attal, F. Petruccione, C. Sabot and I. Sinayskiy [J. Stat. Phys. (2012) 147:832-852] in order to discuss hitting times and a quantum version of the Mean Hitting Time Formula from…

Mathematical Physics · Physics 2017-01-04 Carlos F. Lardizabal

Let $F$ be a distribution function on the integer lattice $\mathbb{Z}$ and $S=(S_n)$ the random walk with step distribution $F$. Suppose $S$ is oscillatory and denote by $U_{\rm a}(x)$ and $u_{\rm a}(x)$ the renewal function and sequence,…

Probability · Mathematics 2021-05-12 Kohei Uchiyama

Consider a sequence {X(i,0) : i = 1, ..., n} of i.i.d. random variables. Associate to each X(i,0) an independent mean-one Poisson clock. Every time a clock rings replace that X-variable by an independent copy. In this way, we obtain i.i.d.…

Probability · Mathematics 2007-05-23 Davar Khoshnevisan , David A. Levin , Pedro J. Mendez-Hernandez

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

Probability · Mathematics 2014-08-06 Eviatar B. Procaccia , Eric Shellef

Let $S_n$ be a lattice random walk with mean zero and finite variance, and let $\Lambda^a_n$ be its occupation measure at level $a$. In this note, we prove local limit theorems for $\Pr[S_n=x,\Lambda^a_n=\ell]$ and…

Probability · Mathematics 2019-01-28 Pierre Yves Gaudreau Lamarre

We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…

Probability · Mathematics 2017-11-03 Oliver Sargent

We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…

Mathematical Physics · Physics 2017-11-10 Ivan Bardet , Denis Bernard , Yan Pautrat

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…

Probability · Mathematics 2009-12-29 Alain-Sol Sznitman

Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…

High Energy Physics - Lattice · Physics 2009-09-25 Carl M. Bender , Stefan Boettcher , Peter N. Meisinger

We consider a discrete-time random walk on a one-dimensional lattice with space and time-dependent random jump probabilities, known as the Beta random walk. We are interested in the probability that, for a given realization of the jump…

Statistical Mechanics · Physics 2023-07-28 Alexander K. Hartmann , Alexandre Krajenbrink , Pierre Le Doussal

We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also…

Probability · Mathematics 2011-04-11 Itai Benjamini , Ori Gurel-Gurevich , Oded Schramm