SearcharxivSearch

arXiv · 1910.07469

On the zeros of non-analytic random periodic signals

Abstract

In this paper, we investigate the local universality of the number of zeros of a random periodic signal of the form $S_n(t)=\sum_{k=1}^n a_k f(k t)$, where $f$ is a $2\pi-$periodic function satisfying weak regularity conditions and where the coefficients $a_k$ are i.i.d. random variables, that are centered with unit variance. In particular, our results hold for continuous piecewise linear functions. We prove that the number of zeros of $S_n(t)$ in a shrinking interval of size $1/n$ converges in law as $n$ goes to infinity to the number of zeros of a Gaussian process whose explicit covariance only depends on the function $f$ and not on the common law of the random coefficients $(a_k)$. As a byproduct, this entails that the point measure of the zeros of $S_n(t)$ converges in law to an explicit limit on the space of locally finite point measures on $\mathbb R$ endowed with the vague topology. The standard tools involving the regularity or even the analyticity of $f$ to establish such kind of universality results are here replaced by some high-dimensional Berry-Esseen bounds recently obtained in [CCK17]. The latter allow us to prove functional CLT's in $C^1$ topology in situations where usual criteria can not be applied due to the lack of regularity.

Explore related subjects

Keep this discovery

BibTeXRIS

Jürgen Angst, Guillaume Poly. 2019-10-16. On the zeros of non-analytic random periodic signals. https://arxiv.org/abs/1910.07469

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