SearcharxivSearch

arXiv · 2605.22803

Persistence of asymptotic variance under transport: from hyperfluctuation to stealthy hyperuniformity

Abstract

We introduce $p$-uniformity to characterize the scaling of density fluctuations in spatial random systems in $\mathbb R^d$, ranging from hyperfluctuation to stealthy hyperuniformity. Our central theorem establishes sufficient conditions to preserve $p$-uniformity under transport. The first condition, a finite $(d+p)$-th moment of the transport distance, allows for a Taylor expansion of the transport. The second condition controls the corresponding terms. We thus solve a previously stated open problem; indeed we extend it, since our result applies to a general $p$-uniform source in any dimension, and the source and transport may be dependent. As an application, we construct new classes of point processes that are isotropic and $p$-uniform with arbitrarily high $p$, and that can be simulated in linear time. We thus achieve three-dimensional isotropic hyperuniform samples with an unprecedented system size of $10^9$ points. We conclude with an outlook on a converse statement.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Lotz, Michael A. Klatt. 2026-05-21. Persistence of asymptotic variance under transport: from hyperfluctuation to stealthy hyperuniformity. https://arxiv.org/abs/2605.22803

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