SearcharxivSearch

arXiv · 2507.07587

Distance to stationarity and open set recurrence for ergodic processes on the unit interval with a Bernstein or a Siegmund dual

Abstract

We use duality techniques - specifically Siegmund and Bernstein duality - as tools to analyse ergodic and recurrence properties of $[0,1]$-valued Markov processes. These dualities enable the derivation of sharp bounds on the distance to stationarity and allow for a novel approach to establishing topological recurrence, whereby ergodicity implies recurrent visits to neighbourhoods of points in the stationary distribution's support. We first relate Siegmund and Bernstein duality in cases where both apply, such as $\Lambda$-Wright--Fisher processes. We then exploit the dual processes to derive bounds on the distance to stationarity and simple criteria for open set recurrence. Our results apply to a broad class of $\Lambda$-Wright--Fisher processes with frequency-dependent selection, mutation, and random environmental effects. In many cases, Bernstein duals can be constructed from the same ancestral structures underlying moment duals, allowing our methods to extend and strengthen existing results based on moment duality. This framework provides a robust approach to studying the long-term behaviour of complex population models beyond the classical moment dual setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Fernando Cordero, Grégoire Véchambre. 2025-07-10. Distance to stationarity and open set recurrence for ergodic processes on the unit interval with a Bernstein or a Siegmund dual. https://arxiv.org/abs/2507.07587

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