Kemperman's Oscillating Random Walk Model

• Kemperman's Model of Oscillating Random Walk is a discrete-time stochastic process on ℤ with regime-switching dynamics driven by distinct jump distributions for negative, zero, and positive positions.
• Renewal theory and operator techniques rigorously characterize its recurrence, limit theorems, and phase transitions, providing explicit formulas for invariant measures and local limit behavior.
• Extensions incorporating memory, intermittency, and spatial heterogeneity expand its applications to statistical mechanics, biological transport, and combinatorial models.

Kemperman’s Model of Oscillating Random Walk refers to a class of discrete-time stochastic processes on the integer lattice ℤ where the walker’s transition probabilities alternate between two regimes depending on its current position. Specifically, the jump distribution depends on whether the current location is in $\mathbb{Z}^{-}$ (negative integers), zero, or $\mathbb{Z}^{+}$ (positive integers), resulting in regime-switching dynamics that fundamentally affect recurrence, limit laws, and diffusive properties. This oscillatory structure leads to behavior distinct from homogeneous or reflected random walks, with nontrivial phase transitions and asymptotic properties that can be rigorously characterized using renewal theory and operator techniques.

1. Model Structure and Regime Switching

Kemperman's oscillating random walk is defined by the prescription that, at each discrete time $n$, the increment $\xi_n$ of the walk is drawn from one probability law $\mu$ when the position $X_n$ is negative, and from a different law $\mu'$ when $X_n$ is positive. At the interface (typically at zero), a third distribution $\mu_0$ may be used. The dynamic alternation between regimes is encoded as:

• $X_{n+1} = X_n + \xi_n$ if $X_n < 0$ ($\xi_n \sim \mu$)
• $X_{n+1} = X_n + \xi'_n$ if $X_n > 0$ ($\xi'_n \sim \mu'$)
• $X_{n+1} = X_n + \xi^0_n$ if $X_n = 0$ ($\xi^0_n \sim \mu_0$)

The "oscillating" descriptor denotes that the random walk’s local movement rule depends on which side of the origin it currently occupies. This inhomogeneity induces distinct statistical behaviors in long-time properties, including recurrence, transience, and local limit laws.

2. Renewal Theory and Embedded Switching Subprocess

Analysis of Kemperman's model leverages the concept of "switching times" or crossing epochs, denoted $(C_k)_{k \ge 0}$, marking successive transitions between $\mathbb{Z}^-$ and $\mathbb{Z}^+$. The embedded subprocess $(X_{C_k})$ forms a Markov chain whose transition kernel depends explicitly on the ladder heights and renewal functions of the corresponding jump distributions.

For example, the transition probability for crossing from $x < 0$ to $y \ge 0$ is given by:

$C(x,y) = \sum_{t=-x-1}^0 \mu(y - x - t) U(t)$

where $U(t)$ is the potential kernel associated with the ladder process constructed from $\mu$. Similar formulas hold for crossings from positive to negative.

This refined renewal structure is central to both recurrence analysis and limit theorem proofs. In particular, necessary and sufficient conditions for recurrence (i.e., infinite returns to the origin) are expressed in terms of products of renewal functions, such as

$\sum_{h=1}^\infty C(h)\,C'(-h) = +\infty$

where $C(h)$ and $C'(-h)$ are renewal functions for the respective regimes (Vo, 2022).

3. Recurrence, Transience, and Invariant Measures

The recurrence criterion in Kemperman's oscillating model fundamentally couples the renewal behavior of both side processes. Using Fourier and Wiener–Hopf factorization, the Green function at zero is written as:

$$G_Z(0, 0) = \lim_{s \uparrow 1} \frac{1}{2\pi} \int_0^{2\pi} \operatorname{Re} \left[ \frac{1}{(1 - s\hat{p}_+(t))(1 - s\hat{v}_-(t))} \right] \, dt$$

where $\hat{p}_+(t), \hat{v}_-(t)$ are the Fourier transforms of the ladder height measures of each regime (Brémont, 2021).

The chain is recurrent iff $G_Z(0, 0)$ diverges. For the embedded crossing process, explicit expressions for invariant measures exist, given by tail probabilities of the jump distributions (see (Vo, 2022), (2.4), (3.6)).

Hölder-type moment conditions, such as

$$E[(\xi_1)^+] < +\infty, \quad E[((\xi_1)^-)^\beta] < +\infty$$

for some $\beta > 0$, provide practical sufficient conditions for recurrence by controlling tail behaviors and guaranteeing the finiteness of the invariant measure on the essential class.

4. Functional and Local Limit Theorems

Recent advances have rigorously established functional limit theorems for Kemperman’s oscillating walks by employing renewal operator techniques on weighted Banach spaces (Peigné et al., 2023). Under appropriate normalization, the interpolated trajectory converges in law in $C([0,1])$ to a skew Brownian motion $W_\gamma(\cdot)$, with the skewness parameter $\gamma$ determined by deep renewal quantities:

$$\gamma = \frac{c' \nu(h_d')}{c \nu(\hat{h}_a) + c' \nu(h_d')}$$

Here, $c, c'$ are explicit drift-variance terms tied to the ladder process statistics, and $\nu$ is the invariant measure for the crossing kernel.

The local limit theorem (Peigné et al., 19 Sep 2025) details asymptotics for return probabilities:

• In recurrent cases (e.g., zero drift), there exists $C_y$ with

$\mathbb{P}_x[X_n=y] \sim \frac{C_y}{\sqrt{n}}$

where $C_y$ depends on the invariant measure and local renewal characteristics.

• In transient cases, one observes exponential and polynomial decay:

$$\mathbb{P}_x[X_n=y] \sim C_{x,y} \frac{\rho^n}{n^{3/2}}$$

with $\rho$ a spectral parameter extracted from Laplace transforms of $\mu$, $\mu'$.

The proof strategy hinges on operator renewal theorems (extension of Gouëzel’s Theorem 1.4) and a decomposition of trajectories into switching epochs and excursions, enabling sharp asymptotic control even in inhomogeneous settings.

5. Extensions: Memory, Intermittency, and Non-Markovian Variants

There exist extensions incorporating memory and intermittency, in which the random walk’s update depends on past steps or waiting times (Kumar et al., 2010, Chung et al., 2023). For instance, in memory-induced models, the next step is determined by a randomly selected previous step, introducing persistence or rebellion with probabilities $p, q$, and an intermittency parameter $r$ for no movement.

Mean-squared displacement scaling reveals subdiffusion for $r>0$, normal diffusion for balanced persistence, and superdiffusion in the high-persistence regime:

$\langle x_t^2 \rangle \sim t^{1-r}$

Additionally, spatial heterogeneity in sojourn times leads to non-Markovian but tractable processes whose scaling limits are continuum-space diffusion equations incorporating the local waiting time function $\tau(x)$:

$u_t = \frac{1}{2}(u/\tau(x))_{xx}$

with the Green’s function explicitly constructed in (Chung et al., 2023).

6. Connections to Biological, Physical, and Combinatorial Models

The oscillating random walk framework captures physical situations where particles alternate between distinct regions or motility states, such as run-and-tumble models for bacterial chemotaxis (Datta et al., 21 Jun 2024), Lévy walks with velocity reversal (Das et al., 2021), and random walks with switchable sojourn times.

Combinatorial structures, e.g., oscillating tableaux, have area statistics described by position-dependent oscillating random walks (Keating, 2020). In these models, alternating upward/downward moves with weights depending on current position yield Gaussian fluctuations in the continuum limit, further reinforcing connections with universality in oscillating random walks.

Table 1: Key Features Across Model Classes

Model Variant	Regime Switching	Limit Law/Asymptotic
Kemperman’s Original	$\mathbb{Z}^-$ vs $\mathbb{Z}^+$	Skew Brownian, Local Limit Thm
Memory-Induced (with $p,q,r$)	Persistence/Rebellion/Rest	Sub/superdiffusion
Hetero-Sojourn (variable $\tau$)	Fast/slow spatial phases	Diffusion PDE
Run-and-Tumble, Lévy, Intermittent	Active/Passive or forward/backward	Superdiffusive, ballistic

7. Analytical Methods and Operator Techniques

The rigorous paper of oscillating random walks employs a blend of renewal theory, spectral analysis of Banach-space operators, and Wiener–Hopf factorization. Aperiodic renewal operator sequences permit the control of embedded Markovian switching chains, yielding spectral gap phenomena requisite for limit theorems. Tail conditions and moment assumptions ensure the applicability of these analyses, and decompositions into excursions and switching events facilitate explicit asymptotic evaluations for probabilities and distributions.

Relevant formulas synthesized for the oscillating setting include:

• Green function at 0:

$$G_Z(0,0) = \frac{1}{2\pi} \int_0^{2\pi} |1 - \hat{p}_+(t)|^{-2} dt$$

• Local limit (recurrent case):

$\mathbb{P}_x[X_n=y] \sim \frac{C_y}{\sqrt{n}}$

• Skewness parameter in functional limit:

$$\gamma = \frac{c' \nu(h_d')}{c \nu(\hat{h}_a) + c' \nu(h_d')}$$

---

Kemperman's Model of Oscillating Random Walk provides a canonical and analytically tractable structure for understanding how regime-dependent stochastic dynamics induce phase transitions, modify recurrence, and generate rich scaling limits, with applications across probability theory, statistical mechanics, and complex systems. Its generalizations and modern analytical techniques establish a unified framework for spatially inhomogeneous transport phenomena and underpin recent advances in the limit theory of stochastic processes on discrete and continuous media.