English
Related papers

Related papers: Level-crossings of symmetric random walks and thei…

200 papers

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…

Probability · Mathematics 2007-05-23 Dimitrios Cheliotis

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

Probability · Mathematics 2015-08-18 Andrea Collevecchio , Kais Hamza , Meng Shi

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…

Probability · Mathematics 2014-08-13 Matija Vidmar

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

Let $R_n=\max_{0\leq j\leq n}S_j-S_n$ be a random walk $S_n$ reflected in its maximum. Except in the trivial case when $P(X\ge0)=1$, $R_n$ will pass over a horizontal boundary of any height in a finite time, with probability 1. We extend…

Probability · Mathematics 2009-09-29 Ron Doney , Ross Maller

We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…

Statistics Theory · Mathematics 2019-10-01 Yufan Li , Jeffery Rosenthal

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

Probability · Mathematics 2016-09-07 Cheng-Der Fuh

We consider a one-dimensional random walk (RW) with a continuous and symmetric jump distribution, $f(\eta)$, characterized by a L\'evy index $\mu \in (0,2]$, which includes standard random walks ($\mu=2$) and L\'evy flights ($0<\mu<2$). We…

Statistical Mechanics · Physics 2017-11-22 Satya N. Majumdar , Philippe Mounaix , Gregory Schehr

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…

Probability · Mathematics 2018-06-05 Kamil Demirberk Ünlü , Ali Devin Sezer

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 prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above…

Probability · Mathematics 2019-05-14 Aleksandar Mijatović , Vladislav Vysotsky

Take a centered random walk S_n and consider the sequence of its partial sums A_n = S_1 + ... + S_n. Suppose S_1 is in the domain of normal attraction of an \alpha-stable law with 1 < \alpha <= 2. Assuming that S_1 is either…

Probability · Mathematics 2012-03-19 Vladislav Vysotsky

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

Probability · Mathematics 2020-10-28 Marcelo R. Hilário , Daniel Kious , Augusto Teixeira

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

Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments $X_i$ of zero mean and finite variance. Assume that $X_i$ is non-lattice and has a moment of order $2+\delta$. For any $x\geq…

Probability · Mathematics 2021-10-12 Ion Grama , Hui Xiao

Let $W$ be an integer valued random variable satisfying $E[W] =: \delta \geq 0$ and $P(W<0)>0$, and consider a self-interacting random walk that behaves like a simple symmetric random walk with the exception that on the first visit to any…

Probability · Mathematics 2016-06-13 Burgess Davis , Jonathon Peterson

We consider the P\'olya random walk in $\mathbb{Z}^2$. The paper establishes a number of results for the distributions and expectations of the number of usual (undirected) and specifically defined in the paper up- and down-directed…

Probability · Mathematics 2023-03-30 Vyacheslav M. Abramov

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

Probability · Mathematics 2021-02-15 Jimmy He
‹ Prev 1 2 3 10 Next ›