SearcharxivSearch

arXiv · 2606.01683

Singular-value gap of nonreversible Markov processes

Abstract

We consider a generalization of the spectral gap of reversible Markov generators to nonreversible processes, following the recent work arXiv:2310.10876 on nonreversible finite-state Markov chains. Extending Chatterjee's observations, we find that this spectral quantity that we call the \textit{singular-value gap} characterizes the convergence of empirical averages, providing upper and lower bounds for finite-time variance uniformly over $L^2$-functions. A key observation is that when the singular-value gap is positive, the generator is invertible on the $L^2$-orthogonal complement of constant functions. In particular, the Poisson equation $-Lf = g$ can be solved, which enables our proof and connects our results to asymptotic variance and associated central limit theorems. We also compare the singular-value gap with the spectral gap of the reversibilized process, the mixing time in total-variation distance, and the Cheeger constant. Several examples are provided throughout the text. Among other potential applications of the singular-value gap, these examples illustrate that a positive singular-value gap can help with variance reduction for observable classes in MCMC sampling, uncover slow-mixing mechanisms, and certify convergence of empirical averages for diffusion operators with complicated spectrum.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruochuan Xu. 2026-06-01. Singular-value gap of nonreversible Markov processes. https://arxiv.org/abs/2606.01683

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