Random polynomials with prescribed Newton polytope

We study the density of complex critical points of a real random SO(m+1) polynomial in m variables. In a previous paper [Mac09], the author used the Poincare- Lelong formula to show that the density of complex zeros of a system of these real random polynomials rapidly approaches the density of complex zeros of a system of the corresponding complex random polynomials, the SU(m+1) polynomials. In this paper, we use the Kac- Rice formula to prove an analogous result: the density...

We show that the zeros of random sequences of Gaussian systems of polynomials of increasing degree almost surely converge to the expected limit distribution under very general hypotheses. In particular, the normalized distribution of zeros of systems of m polynomials of degree N, orthonormalized on a regular compact subset K of C^m, almost surely converge to the equilibrium measure on K as the degree N goes to infinity.

Let $\mu$ be a probability measure in $\mathbb{C}$ with a continuous and compactly supported density function, let $z_1, \dots, z_n$ be independent random variables, $z_i \sim \mu$, and consider the random polynomial $$ p_n(z) = \prod_{k=1}^{n}{(z - z_k)}.$$ We determine the asymptotic distribution of $\left\{z \in \mathbb{C}: p_n(z) = p_n(0)\right\}$. In particular, if $\mu$ is radial around the origin, then those solutions are also distributed according to $\mu$ as $n \righ...

We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for zeroes lying on any curve in the complex plane, which is the graph of a Lipschitz function in polar coordinates. The proof is based on the classical Tur\'an lemma.

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form. When U = (C^*)^n, the classical mixed volume is recovered. The main result in this paper is a bound on the probability that the co...

We study the asymptotics of correlations and nearest neighbor spacings between zeros and holomorphic critical points of $p_N$, a degree N Hermitian Gaussian random polynomial in the sense of Shiffman and Zeldtich, as N goes to infinity. By holomorphic critical point we mean a solution to the equation $\frac{d}{dz}p_N(z)=0.$ Our principal result is an explicit asymptotic formula for the local scaling limit of $\E{Z_{p_N}\wedge C_{p_N}},$ the expected joint intensity of zeros a...

We consider ensembles of random polynomials of the form $p(z)=\sum_{j = 1}^N a_j P_j$ where $\{a_j\}$ are independent complex normal random variables and where $\{P_j\}$ are the orthonormal polynomials on the boundary of a bounded simply connected analytic plane domain $\Omega \subset C$ relative to an analytic weight $\rho(z) |dz|$. In the simplest case where $\Omega$ is the unit disk and $\rho=1$, so that $P_j(z) = z^j$, it is known that the average distribution of zeros is...

Let $\{f_j\}_{j=0}^n$ be a sequence of orthonormal polynomials where the orthogonality relation is satisfied on either the real line or on the unit circle. We study zero distribution of random linear combinations of the form $$P_n(z)=\sum_{j=0}^n\eta_jf_j(z),$$ where $\eta_0,\dots,\eta_n$ are complex-valued i.i.d.~standard Gaussian random variables. Using the Christoffel-Darboux formula, the density function for the expected number of zeros of $P_n$ in these cases takes a ver...

Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral of a differential form on a toric manifold and admits a simple explicit upper bound when the Newton polytopes (and underlying covariances) are all identical. We also consider polynomials with real coefficients and give bounds for the expe...

We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of n-variate polynomials f for which the integral of any positive integer power f^p over the whole space is well-approximated by a properly scaled integral over a random subspace of dimension O(log n). Consequently, the maximum of f on the uni...