arXiv Analytics

Sign in

arXiv:1601.06417 [math.PR]AbstractReferencesReviewsResources

Pairing of Zeros and Critical Points for Random Polynomials

Boris Hanin

Published 2016-01-24Version 1

Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed point xi in , then, with high probability, there will be a critical point w_xi a distance 1/N away from xi. This 1/N distance is much smaller than the one over root N typical spacing between nearest neighbors for N i.i.d. points on S^2. Moreover, with the same high probability, the argument of w_xi relative to xi is a deterministic function of mu plus fluctuations on the order of 1/N.

Related articles: Most relevant | Search more
arXiv:1610.06248 [math.PR] (Published 2016-10-19)
Pairing between zeros and critical points of random polynomials with independent roots
arXiv:2306.13936 [math.PR] (Published 2023-06-24)
Rate of convergence of the critical point of the memory-$τ$ self-avoiding walk in dimensions $d>4$
arXiv:1407.2860 [math.PR] (Published 2014-07-10, updated 2014-12-23)
Increasing subsequences of random walks