SearcharxivSearch

arXiv · 2607.10717

Separatrix structure and the geometry of reset distributions

Abstract

We study the geometry of reset distributions for absorbed Markov processes with geometric resetting, working at an abstract level that isolates the structural mechanism underlying reset-neutral invariance. We show that the spectral duality endows the simplex of reset distributions with a non-trivial spectral response geometry: the simplex $\Delta_{m-1}$ carries a foliation by level sets of the coupling functional $C$, organized around a critical manifold $\Sigma$ that acts as a global orientation boundary for the reset response. Under four structural conditions (S1)--(S4) on the coupling functional, we establish the existence and explicit characterization of the separatrix $\Sigma$, derive the invariant value $C^* = 1/(1+\sqrt{K})$, identify a projective structure in the spectral coefficients, and prove a global sign principle in the two-site case. The linear functional $\psi(\gamma)$ emerges as a global orientation field: numerical evidence suggests $\operatorname{sgn}(\partial_\gamma C) = \operatorname{sgn}\langle\pi-\pi^*,\psi(\gamma)\rangle$ for all $\pi \in \Delta_{m-1}^\circ$. The biased random walk with multi-site geometric resetting provides a canonical realization. This is the third paper in a program connecting stochastic resetting with spectral theory and information geometry.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan Antonio Vega coso. 2026-07-12. Separatrix structure and the geometry of reset distributions. https://arxiv.org/abs/2607.10717

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