SearcharxivSearch

arXiv · 2603.24803

Critical Spectral Invariants in Random Walks with Geometric Resetting

Abstract

Stochastic resetting -- the intermittent restart of random processes -- has profoundly reshaped first-passage theory, providing a mechanism to control and optimize completion times. While the influence of resetting on mean first-passage times is now well understood, its impact on absorption probabilities in confined domains remains comparatively unexplored. We present a complete analysis of the classical gambler's ruin problem under geometric resetting. At each time step, the walker is reset to its initial position with probability gamma, or otherwise performs a biased nearest-neighbor step. Our approach proceeds in three stages. First, we derive a renewal equation for the ruin probability q_z(gamma) by conditioning on the first step. Second, we develop a spectral representation on a weighted Hilbert space that diagonalizes the transition operator and yields explicit closed-form expressions. Third, this representation enables a precise critical-point analysis in state space. Our central result is a striking geometric invariance: when the domain size a is even, the ruin

Explore related subjects

Keep this discovery

BibTeXRIS

Juan Antonio Vega Coso. 2026-03-25. Critical Spectral Invariants in Random Walks with Geometric Resetting. https://arxiv.org/abs/2603.24803

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