SearcharxivSearch

arXiv · 2605.00657

Spectral Duality and Reset-Neutral Distributions in Random Walks with Multi-Site Geometric Resetting

Abstract

We study the gambler's ruin problem for a biased random walk on $\{0,1,\dots,a\}$ under multi-site geometric resetting: at each time step, the walker is reset with probability $\gamma\in(0,1)$ to a random position drawn from a distribution $\pi$ over $m$ interior sites. Using renewal theory, we derive an exact closed-form expression for the ruin probability $q_z(\gamma)$, showing that the effect of $\pi$ is fully encoded in a single scalar quantity, the \emph{coupling constant} $C(\pi,\gamma)=\bar{u}_\pi/\bar{s}_\pi$. A spectral analysis via Doob symmetrization reveals the structure of this coupling. Our main result is a general criterion -- valid for any absorbed Markov chain admitting a spectral decomposition -- for the existence of a \emph{reset-neutral} distribution $\pi^*$ such that $C(\pi^*,\gamma)$ is independent of $\gamma$. This occurs under a spectral duality condition: there exists an involution $\sigma$ on the reset sites and $\nu$-independent weights $\kappa(z)$ such that $B_\nu(z) = \kappa(z)\,A_\nu(\sigma(z))$ for all spectral modes $\nu$. When this condition holds, the invariant value is $C^* = q_{a/2}^{(0)}$, the classical ruin probability from the midpoint, independent of the choice of symmetric reset sites or resetting rate. For the biased random walk, the condition reduces to the geometric symmetry $z_i + z_i' = a$. This result holds for any $a$, any number of reset sites $m$, and any bias $p\in(0,1)$. Both analytical and Monte Carlo simulations confirm the theory with high precision, including tests of spectrally neutral sites. Numerical results also reveal a phase-like structure in the space of reset distributions, with $\pi^*$ acting as a separatrix between monotone regimes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan Antonio Vega Coso. 2026-05-01. Spectral Duality and Reset-Neutral Distributions in Random Walks with Multi-Site Geometric Resetting. https://arxiv.org/abs/2605.00657

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR