English
Related papers

Related papers: First-passage times over moving boundaries for asy…

200 papers

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

Probability · Mathematics 2025-12-22 Satyaki Bhattacharya , Edward Crane , Tom Johnston

The distribution of the first positive position reached by a random walker starting from the origin is fundamental for understanding the statistics of extremes and records in one-dimensional random walks. We present a comprehensive study of…

Statistical Mechanics · Physics 2025-09-03 Claude Godrèche , Jean-Marc Luck

Let $(S_n)_{n \geq 0}$ be a transient random walk in the domain of attraction of a stable law and let $(\xi(s))_{s \in \mathbb{Z}}$ be a stationary sequence of random variables. In a previous work, under conditions of type $D(u_n)$ and…

Probability · Mathematics 2022-10-11 Nicolas Chenavier , Ahmad Darwiche

We consider reflecting random walks on the nonnegative integers with drift of order 1/x at height x. We establish explicit asymptotics for various probabilities associated to such walks, including the distribution of the hitting time of 0…

Probability · Mathematics 2015-03-13 Kenneth S. Alexander

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…

Probability · Mathematics 2011-12-06 Nadine Guillotin-Plantard , Françoise Pène

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 analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…

Statistical Mechanics · Physics 2024-01-31 Rosa Flaquer-Galmés , Daniel Campos , Vicenç Méndez

Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition…

Probability · Mathematics 2016-03-02 A. Agbor , S. Molchanov , B. Vainberg

We introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…

Probability · Mathematics 2022-09-27 Irina Ignatiouk-Robert , Irina Kourkova , Kilian Raschel

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Probability · Mathematics 2026-01-21 Ze-Chun Hu , Xue Peng , Renming Song , Yuan Tan

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

Discrete Mathematics · Computer Science 2022-01-19 Nobutaka Shimizu , Takeharu Shiraga

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…

Data Analysis, Statistics and Probability · Physics 2007-05-23 T. Antal , S. Redner

Let $h:[0,1]\to\mathbb{R}$ be $C^2$ and such that $\sup_{[0,1]} h''<0$. For a (large) positive integer $n$, set $h_n(k) = n h(k/n)$ for any $k\in\{0,\dots,n\}$. We consider a random walk $(S_k)_{k\geq 0}$ with i.i.d.\ centred increments…

Probability · Mathematics 2025-11-13 Sébastien Ott , Yvan Velenik

We consider the process $\{x-N(t):t\geq 0\}$, where $x\in\mathbb{R}_+$ and $\{N(t):t\geq 0\}$ is a renewal process with light-tailed distributed holding times. We are interested in the joint distribution of $(\tau(x),A(x))$ where $\tau(x)$…

Probability · Mathematics 2022-02-23 Claudio Macci , Barbara Pacchiarotti

We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…

Probability · Mathematics 2017-07-18 Anna Erschler , Balint Toth , Wendelin Werner

We present analytical results for the distribution of first hitting times of random walks (RWs) on random regular graphs (RRGs) of degree $c \ge 3$ and a finite size $N$. Starting from a random initial node at time $t=1$, at each time step…

Disordered Systems and Neural Networks · Physics 2021-03-22 Ido Tishby , Ofer Biham , Eytan Katzav

We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the…

Probability · Mathematics 2024-10-31 Deborshi Das

In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…

Probability · Mathematics 2017-06-13 Bastien Mallein

We revisit the problem of influencing the sex ratio of a population by subjecting reproduction of each family to some stopping rule. As an easy consequence of the strong law of large numbers, no such modification is possible in the sense…

Probability · Mathematics 2025-04-10 Stefan Gerhold , Friedrich Hubalek

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

Probability · Mathematics 2024-07-23 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang
‹ Prev 1 4 5 6 7 8 10 Next ›