• Corpus ID: 245704294

# The oscillating random walk on \$\mathbb{Z}\$

```@inproceedings{Vo2022TheOR,
title={The oscillating random walk on \\$\mathbb\{Z\}\\$},
author={Dl Vo},
year={2022}
}```
• D. Vo
• Published 5 January 2022
• Mathematics
The paper is concerned with a new approach for the recurrence property of the oscillating process on Z in Kemperman’s sense. In the case when the random walk is ascending on Z− and descending on Z+, we determine the invariant measure of the embedded process of successive crossing times and then prove a necessary and sufficient condition for recurrence. Finally, we make use of this result to show that the general oscillating process is recurrent under some Hölder-typed moment assumptions.

## References

SHOWING 1-10 OF 16 REFERENCES

### On homogeneous and oscillating random walks on the integers

We study the recurrence of homogeneous and oscillating random walks on the integers, simplifying former works of Spitzer and Kemperman, respectively. We add general remarks and discuss some links

### Functional Central Limit Theorems for Random Walks Conditioned to Stay Positive

Let {(k: k ? 1} be a sequence of independent, identically distributed random variables with E{J1} = 0 and E{e12} = a2, 0 n. The limit process, W+, is identified in terms of standard Brownian motion.

### Limit theorem for perturbed random walks

• Mathematics
• 2019
We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at 0 whenever they cross that point. We show that

### Local behaviour of first passage probabilities

Suppose that S is an asymptotically stable random walk with norming sequence cn and that Tx is the time that S first enters (x, ∞), where x ≥ 0. The asymptotic behaviour of P(T0 = n) has been

### Stationary entrance Markov chains, inducing, and level-crossings of random walks

• Mathematics
• 2018
For a Markov chain \$Y\$ with values in a Polish space, consider the entrance Markov chain obtained by sampling \$Y\$ at the moments when it enters a fixed set \$A\$ from its complement \$A^c\$. Similarly,

### Random walk on countably infinite Abelian groups

• Mathematics
• 1965
Here 0 is the identi ty element of the (additive) group g~, #~0> is the probabili ty measure all of whose mass is concentrated at O, #~1~=# and #~> is the n-fold convolution of # with itself. Roughly

### Stochastic dynamical systems with weak contractivity properties I. Strong and local contractivity

• Mathematics
• 2011
Consider a proper metric space X and a sequence (Fn)n≥0 of i.i.d. random continuous mappings X → X. It induces the stochastic dynamical system (SDS) X n = Fn ◦ · · · ◦ F1(x) starting at x ∈ X. In

### Convergence of probability measures

The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the

### On the absolute difference chains

Let F(x), F ( 0 ) = 0 , be a fixed probability distribution function on R § with measure F(dx), and let X 1, X 2 .. . . be a sequence of independent and identically distributed random variables with

### Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules

• Mathematics
Journal of Applied Probability
• 1986
It is shown that the recent decomposition results for exhaustive service extend to the more general class of Bernoulli schedules and all three schedules on a state space incorporating server vacations is presented.