Probability – Distribution of Roots of Complex Polynomials

cv.complex-variablespolynomialspr.probability

I generated random quadratic and cubic polynomials with coefficients in $\mathbb{C}$
uniformly distributed in the unit disk $|z| \le 1$. The distribution of the roots of 10000
of these polynomials are shown below (left: quadratic; right: cubic).

Poly23
What explains these distributions? In particular: (1) Why the relative paucity of roots
near the origin. (2) Why is the density concentrated in $\frac{1}{2} \le |z| \le 1$?
(3) Why is the cubic distribution sharper than the quadratic?
(The roots of polynomials of higher degree distribute (visually) roughly like the cubic distribution.)


In a comment to an earlier
posting of this question on MSE, Niels Diepeveen suggested I look at the $\log$ of
the roots instead, for they
"show a density that is independent of the imaginary part and symmetric w.r.t. the real part":

     Poly23Log
To (naive) me, this raises more questions than it answers: (4) Why the uniformity in
the imaginary direction? (5) Why does the $\log$ seemingly obliterate the distinction
between the quadratic and cubic distributions?

Best Answer

Letting $\mu_n$ be the distribution of a randomly chosen root of a random polynomial $f=c_0+c_1X+\cdots+c_nX^n$ in $\mathbb{C}[X]$ for IID random variables $c_i\in\mathbb{C}$, each chosen with some probability distribution $\lambda$ on $\mathbb{C}\setminus\{0\}$ we can show the following just about immediately.

  1. $\mu_n$ is invariant under the map $z\mapsto z^{-1}$.In particular, the distribution of the logarithm of a random root is invariant under reflection about the origin.
  2. If $\lambda$ is rotationally invariant then so is $\mu_n$. In particular, the distribution of the logarithm of a random root is invariant under translation by an imaginary number.
  3. If $\int\lvert z\rvert d\lambda(z)$ is finite, then as $n$ tends to infinity $\mu_n$ becomes concentrated on the unit circle. That is, for each $\epsilon\gt0$, $\mu_n(\{z\colon 1-\epsilon\lt\lvert z\rvert\lt1+\epsilon\})\to1$ as $n\to\infty$.

In the case asked about here, $\lambda$ is uniform on the unit ball so that all of the conditions hold, and $\mu_n$ tends weakly to the uniform measure on the unit circle as $n\to\infty$.

For (1), note that the zeros of $g=c_n+c_{n-1}X+\cdots+c_0X^n$ are precisely $\alpha^{-1}$ as $\alpha$ runs through the zeros of $f$, but that $g$ has the same distribution as $f$.

For (2) note that for real $\theta$, the zeros of $g=c_0+c_1e^{-i\theta}X+\cdots+c_ne^{-in\theta}X^n$ are precisely $e^{i\theta}\alpha$ as $\alpha$ runs through the zeros of $f$, but $g$ has the same distribution as $f$.

For (3), note that if $c_0,c_1,c_2,\ldots$ is an infinite IID sequence, each with distribution $\lambda$, and if $0\lt r\lt 1$ then, $$ \sum_{k=0}^\infty\lvert c_k\rvert r^k $$ has finite mean $\int\lvert z\rvert d\lambda(z)/(1-r)$, so the sum is finite with probability 1. Hence the sequence of polynomials $f_n=c_0+c_1X+\cdots+c_nX^n$ converge uniformly on the ball of radius $r$ (with probability 1). So, the number of zeros of $f_n$ in the ball of radius $r$ is almost surely bounded as $n\to\infty$. This implies that $\mu_n(\{z\colon\lvert z\rvert\le r\})\to0$ as $n\to\infty$. Applying (1) to this also gives $\mu_n(\{z\colon\lvert z\rvert\ge1/r\})\to0$ as $n\to\infty$.

Related Question