English
Related papers

Related papers: Exit time for anchored expansion

200 papers

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

Data Structures and Algorithms · Computer Science 2021-02-16 Amartya Shankha Biswas , Edward Pyne , Ronitt Rubinfeld

We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted graph with marked "in" and "out" vertices. Suppose a random walker begins at the in-vertex, steps to neighbors of vertices with…

Combinatorics · Mathematics 2009-05-28 Joshua N. Cooper

We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…

Probability · Mathematics 2007-07-06 Endre Csáki , Antónia Földes , Pál Révész

We study a continuous-time simple random walk on a regular rooted tree of depth $n$ in two settings: either the walk is started from a leaf vertex and run until the tree root is first hit or it is started from the root and run until it has…

Probability · Mathematics 2025-06-17 Yoshihiro Abe , Marek Biskup

Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…

Optimization and Control · Mathematics 2021-05-03 Guillaume O. Berger , Maben Rabi

This article investigates the behavior of the continuous-time simple random walk on $\mathbb{Z}^d$, $d \geq 3$. We derive an asymptotic lower bound on the principal exponential rate of decay for the probability that the average value over a…

Probability · Mathematics 2025-07-24 Alberto Chiarini , Maximilian Nitzschner

Consider a random walk $S_n=\sum_{i=0}^n X_i$ with negative drift. This paper deals with upper bounds for the maximum $M=\max_{n\ge 1}S_n$ of this random walk in different settings of power moment existences. As it is usual for deriving…

Probability · Mathematics 2011-07-28 Johannes Kugler , Vitali Wachtel

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

Probability · Mathematics 2007-12-03 Iddo Ben-Ari , Mathieu Merle , Alexander Roitershtein

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 prove a quenched local central limit theorem for continuous-time random walks in $\mathbb Z^d, d\ge 2$, in a uniformly-elliptic time-dependent balanced random environment which is ergodic under space-time shifts. We also obtain Gaussian…

Probability · Mathematics 2019-12-04 Jean-Dominique Deuschel , Xiaoqin Guo

We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

Probability · Mathematics 2017-02-01 Siva Athreya , Alexander Drewitz , Rongfeng Sun

We study the gambler's ruin problem for the Elephant Random Walk, focusing on escape time from a symmetric interval of the form $\{-N, \ldots, N\}$. As our main result, we derive tight exponential bounds for the tail of this escape time. We…

Probability · Mathematics 2026-02-24 Morgan André , Leonel Zuaznábar

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Probability · Mathematics 2023-07-13 Ben Morris , Hamilton Samraj Santhakumar

We study exit times from a set for a family of multivariate autoregressive processes with normally distributed noise. By using the large deviation principle, and other methods, we show that the asymptotic behavior of the exit time depends…

Probability · Mathematics 2012-11-12 Brita Jung

We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for…

Probability · Mathematics 2019-03-05 Amine Helali , Matthias Löwe

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Probability · Mathematics 2018-10-09 Ruojun Huang

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 consider the exit problem for a one-dimensional system with random switching near an unstable equilibrium point of the averaged drift. In the infinite switching rate limit, we show that the exit time satisfies a limit theorem with a…

Probability · Mathematics 2019-11-12 Yuri Bakhtin , Alexisz Gaál

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

Probability · Mathematics 2019-09-10 Kazuki Okamura

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

Probability · Mathematics 2025-02-06 Giulio Iacobelli , Guilherme Ost , Daniel Y. Takahashi