English
Related papers

Related papers: First-passage times for random walks with non-iden…

200 papers

We study the asymptotic behaviour of additive functionals of random walks in random scenery. We establish bounds for the moments of the local time of the Kesten and Spitzer process.These bounds combined with a previous moment convergence…

Dynamical Systems · Mathematics 2021-01-05 Françoise Pene

We introduce the notion of \emph{localization at the boundary} for conditioned random walks in i.i.d. and uniformly elliptic random environment on $\mathbb{Z}^d$, in dimensions two and higher. Informally, this means that the walk spends a…

Probability · Mathematics 2020-10-29 Rodrigo Bazaes

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

Probability · Mathematics 2018-11-27 Amir Dembo , Ryoki Fukushima , Naoki Kubota

The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random…

Probability · Mathematics 2018-01-16 Luca Avena , Hakan Guldas , Remco van der Hofstad , Frank den Hollander

We present a unified framework for first-passage time and residence time of random walks in finite one-dimensional disordered biased systems. The derivation is based on exact expansion of the backward master equation in cumulants. The…

Statistical Mechanics · Physics 2009-11-07 Pedro A. Pury , Manuel O. Caceres

We consider one-dimensional Brownian motion conditioned (in a suitable sense) to have a local time at every point and at every moment bounded by some fixed constant. Our main result shows that a phenomenon of entropic repulsion occurs: that…

Probability · Mathematics 2010-04-22 Itai Benjamini , Nathanael Berestycki

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

Probability · Mathematics 2024-07-10 Daniela Bertacchi , Elisabetta Candellero , Fabio Zucca

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

Probability · Mathematics 2018-06-05 Vadim Gorin , Leonid Petrov

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

Probability · Mathematics 2026-05-19 Ngo P. N. Ngoc , Tuan-Minh Nguyen

A random walk (or a Wiener process), possibly with drift, is observed in a noisy or delayed fashion. The problem considered in this paper is to estimate the first time \tau the random walk reaches a given level. Specifically, the p-moment…

Information Theory · Computer Science 2012-03-22 Marat V. Burnashev , Aslan Tchamkerten

Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker visited twice or more. This simple model has…

Probability · Mathematics 2012-10-30 Noam Berger , Eviatar B. Procaccia

Given a discrete-time non-lattice supercritical branching random walk in $\mathbb{R}^d$, we investigate its first passage time to a shifted unit ball of a distance $x$ from the origin, conditioned upon survival. We provide precise…

Probability · Mathematics 2026-04-10 Jose Blanchet , Zhenyuan Zhang

In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same…

Statistical Mechanics · Physics 2011-07-01 C. Mejia-Monasterio , G. Oshanin , G. Schehr

We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias…

Statistical Mechanics · Physics 2007-05-23 Govindan Rangarajan , Mingzhou Ding

We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit…

Probability · Mathematics 2025-08-04 Alicja Kołodziejska

We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this…

Probability · Mathematics 2013-06-20 Gideon Amir , Omer Angel , Gady Kozma

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

Probability · Mathematics 2026-02-10 Tuan Anh Nguyen , Vitali Wachtel

First passage time plays a fundamental role in dynamical characterization of stochastic processes. Crucially, our current understanding on the problem is almost entirely relies on the theoretical formulations, which assume the processes…

Statistical Mechanics · Physics 2023-02-01 Yuta Sakamoto , Takahiro Sakaue

We consider a 1-dimensional Brownian motion whose diffusion coefficient varies when it crosses the origin. We study the long time behavior and we establish different regimes, depending on the variations of the diffusion coefficient:…

Probability · Mathematics 2016-11-28 Nicolas Meunier , Clément Mouhot , Raphaël Roux

We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…

Disordered Systems and Neural Networks · Physics 2025-02-14 Oleg Evnin , Weerawit Horinouchi
‹ Prev 1 4 5 6 7 8 10 Next ›