SearcharxivSearch

arXiv · 2410.20714

Universality of Persistence of Random Polynomials

Abstract

We investigate the probability that a random polynomial with independent, mean-zero and finite variance coefficients has no real zeros. Specifically, we consider a random polynomial of degree $2n$ with coefficients given by an i.i.d. sequence of mean-zero, variance-1 random variables, multiplied by an $\frac{\alpha}{2}$-regularly varying sequence for $\alpha>-1$. We show that the probability of no real zeros is asymptotically $n^{-2(b_{\alpha}+b_0)}$, where $b_{\alpha}$ is the persistence exponents of a mean-zero, one-dimensional stationary Gaussian processes with covariance function as $\mathrm{sech}((t-s)/2)^{\alpha+1}$. Our work generalizes the previous results of Dembo et al. [DPSZ02] and Dembo \& Mukherjee [DM15] by removing the requirement of finite moments of all order or Gaussianity. In particular, in the special case $\alpha = 0$, our findings confirm a conjecture by Poonen and Stoll [PS99, Section 9.1] concerning random polynomials with i.i.d. coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Promit Ghosal, Sumit Mukherjee. 2024-10-28. Universality of Persistence of Random Polynomials. https://arxiv.org/abs/2410.20714

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