Heuristic Relative Entropy Principles with Complex Measures: Large-Degree Asymptotics of a Family of Multi-Variate Normal Random Polynomials
Michael K.-H. Kiessling

TL;DR
This paper investigates the large-degree asymptotics of multivariate normal polynomials with complex measures, extending the relative entropy principle to signed and complex measures, and provides rigorous proofs and conjectures for these asymptotics.
Contribution
It introduces a rigorous proof of the large-N asymptotics using the relative entropy principle for complex measures and conjectures its generalization to signed measures, with potential applications.
Findings
Asymptotic behavior of expected polynomials is governed by a generalized relative entropy principle.
Rigorous proof provided for the large-N limit with complex measures.
Evidence supporting the conjecture of a generalized entropy principle for signed measures.
Abstract
We study expected values of the polynomials whose zeros are generated by identically distributed multi-variate mean-zero normal random variables with co-variance . In principle these can be evaluated in closed form for arbitrary , yet commonly available computer algebra handles only up to a dozen (due to memory constraints). A list of the first three expected polynomials shows that the expressions become unwieldy already for moderate . On the other hand, asymptotic evaluations of the large- regime for complex have traditionally been limited to analytic expansion techniques, several rigorous results are proved about this regime for complex . Yet if is real one…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
