SearcharxivSearch

arXiv · 2512.08800

Three views on the thinned Bernoulli field on the line

Abstract

This paper investigates the thinned Bernoulli field (TBF) on the one-dimensional integer lattice, where isolated occupied sites are removed from a standard Bernoulli configuration with density $p$. Our present work complements previous findings in higher dimensions and on trees by focusing on the detailed behavior on the line, particularly as $p$ approaches $1.$ First we show that while the TBF on the line is always quasilocally Gibbs, it displays a growing sensitivity to boundary conditions as $p$ increases, indicating an incipient loss of quasilocality. We provide precise asymptotics for this phenomenon, which is an echo of non-quasilocality happening in higher dimensions. Second, we turn to the one-sided point of view and prove that the TBF is a g-measure in the sense of dynamical systems and ergodic theory. The corresponding g-function is quasilocal but becomes long-range again for large $p$. From that we finally develop our third view, in which we provide a transparent construction of the process in terms of a driving Markov chain on the integers of generalized house of cards type, offering a novel perspective on the TBF.

Explore related subjects

Keep this discovery

BibTeXRIS

Christof Kuelske, Niklas Schubert. 2025-12-09. Three views on the thinned Bernoulli field on the line. https://arxiv.org/abs/2512.08800

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