English
Related papers

Related papers: On some random walk problems

200 papers

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

We study discrete-time stochastic processes $(X_t)$ on $[0,\infty)$ with asymptotically zero mean drifts. Specifically, we consider the critical (Lamperti-type) situation in which the mean drift at $x$ is about $c/x$. Our focus is the…

Probability · Mathematics 2013-02-27 Ostap Hryniv , Mikhail V. Menshikov , Andrew R. Wade

Let $(\Omega,\mathcal{F}, \mathbb{P})$ be a probability space and $E$ be a finite set. Assume that $X=(X_n)$ is an irreducible and aperiodic Markov chain, defined on $(\Omega,\mathcal{F}, \mathbb{P})$, with values in $E$ and with transition…

Probability · Mathematics 2017-12-05 Yinna Ye

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

Numerical Analysis · Computer Science 2018-01-08 Austin R. Benson , David F. Gleich , Lek-Heng Lim

Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…

Probability · Mathematics 2020-08-26 Cécile Mailler , Gerónimo Uribe Bravo

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

Probability · Mathematics 2026-04-08 Antal A. Járai , Christian Mönch , Lorenzo Taggi

We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes…

Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…

Number Theory · Mathematics 2021-05-25 Bob Hough

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ having increments $(1,0)$, $(-1,1)$, $(0,-1)$ with jump probabilities $\lambda(M_k)$, $\mu_1(M_k)$, and $\mu_2(M_k)$ where $M$ is an irreducible aperiodic finite state Markov…

Probability · Mathematics 2019-09-17 Fatma Başoğlu Kabran , Ali Devin Sezer

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

Probability · Mathematics 2022-06-22 Hua-Ming Wang , Lanlan Tang

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

Physics and Society · Physics 2024-11-14 Lasko Basnarkov , Miroslav Mirchev , Ljupco Kocarev

We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…

Statistical Mechanics · Physics 2015-11-30 Satya N. Majumdar , Sanjib Sabhapandit , Gregory Schehr

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

Probability · Mathematics 2011-10-18 M. V. Menshikov , Andrew R. Wade

Consider the real Markov walk $S_n = X_1+ \dots+ X_n$ with increments $\left(X_n\right)_{n\geq 1}$ defined by a stochastic recursion starting at $X_0=x$. For a starting point $y>0$ denote by $\tau_y$ the exit time of the process $\left(…

Probability · Mathematics 2016-01-13 Ion Grama , Ronan Lauvergnat , Émile Le Page

In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…

Probability · Mathematics 2025-10-28 Hindy Drillick , Shalin Parekh

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

Probability · Mathematics 2012-04-12 Olivier Raimond , Bruno Schapira

We study a random walk (Markov chain) in an unbounded planar domain whose boundary is described by two curves of the form $x_2 = a^+ x_1^{\beta^+}$ and $x_2 = -a^- x_1^{\beta^-}$, with $x_1 \geq 0$. In the interior of the domain, the random…

Probability · Mathematics 2022-02-15 Mikhail V. Menshikov , Aleksandar Mijatović , Andrew R. Wade

We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments…

Probability · Mathematics 2022-03-21 Chak Hei Lo , Mikhail V. Menshikov , Andrew R. Wade

Let $(A_i)_{i \geq 0}$ be a finite state irreducible aperiodic Markov chain and $f$ a lattice score function such that the average score is negative and positive scores are possible. Define $S_0:=0$ and $S_k:=\sum_{i=1}^k f(A_i)$ the…

Probability · Mathematics 2018-03-08 Simona Grusea , Sabine Mercier

We develop criteria for recurrence and transience of one-dimensional Markov processes which have jumps and oscillate between $+\infty$ and $-\infty$. The conditions are based on a Markov chain which only consists of jumps (overshoots) of…

Probability · Mathematics 2020-04-17 Björn Böttcher