SearcharxivSearch

arXiv · 0906.1996

The real zeros of a random algebraic polynomial with dependent coefficients

Abstract

Mark Kac gave one of the first results analyzing random polynomial zeros. He considered the case of independent standard normal coefficients and was able to show that the expected number of real zeros for a degree n polynomial is on the order of (2/pi)log(n), as n goes to infinity. Several years later, Sambandham considered two cases with some dependence assumed among the coefficients. The first case looked at coefficients with an exponentially decaying covariance function, while the second assumed a constant covariance. He showed that the expectation of the number of real zeros for an exponentially decaying covariance matches the independent case, while having a constant covariance reduces the expected number of zeros in half. In this paper we will apply techniques similar to Sambandham's and extend his results to a wider class of covariance functions. Under certain restrictions on the spectral density, we will show that the order of the expected number of real zeros remains the same as in the independent case.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeffrey Matayoshi. 2010-07-18. The real zeros of a random algebraic polynomial with dependent coefficients. https://arxiv.org/abs/0906.1996

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