Inequalities Concerning Maximum Modulus and Zeros of Random Entire Functions
Hui Li, Jun Wang, Xiao Yao, Zhuan Ye

TL;DR
This paper investigates inequalities relating the maximum modulus and zeros of random entire functions, establishing bounds that hold almost surely and extending Nevanlinna theory to the random setting.
Contribution
It introduces a family of random entire functions and proves almost sure inequalities linking maximum modulus and zero counting functions, including a version of Nevanlinna's second main theorem for these functions.
Findings
Almost sure bounds on the difference between log maximum modulus and zero counting function.
Extension of Nevanlinna's second main theorem to random entire functions.
Bounded characteristic function by a weighted counting function for most random entire functions.
Abstract
Let be a random entire function, where are independent and identically distributed random variables defined on a probability space . In this paper, we first define a family of random entire functions, which includes Gaussian, Rademacher, Steinhaus entire functions. Then, we prove that, for almost all functions in the family and for any constant , there exist a constant and a set of finite logarithmic measure such that, for and , where are constants, is the maximum modulus, and is the weighted counting-zero function of . As a by-product of our main results, we prove…
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.
Taxonomy
TopicsMeromorphic and Entire Functions
