Search arXivSearch

arXiv · math/0006113

Random polynomials having few or no real zeros

Abstract

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros with probability n^{-b+o(1)}$ as n --> infinity through integers of the same parity as the fixed integer k >= 0. In particular, the probability that a random polynomial of large even degree n has no real zeros is n^{-b+o(1)}. The finite, positive constant b is characterized via the centered, stationary Gaussian process of correlation function sech(t/2). The value of b depends neither on k nor upon the specific law of the coefficients. Under an extra smoothness assumption about the law of the coefficients, with probability n^{-b+o(1)} one may specify also the approximate locations of the k zeros on the real line. The constant b is replaced by b/2 in case the i.i.d. coefficients have a nonzero mean.

Explore related subjects

Keep this discovery

BibTeXRIS

Amir Dembo, Bjorn Poonen, Qi-Man Shao, Ofer Zeitouni. 2000-06-16. Random polynomials having few or no real zeros. https://arxiv.org/abs/math/0006113

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