arXiv Analytics

Sign in

arXiv:1902.08424 [math.PR]AbstractReferencesReviewsResources

Asymptotics for the expected number of nodal components for random lemniscates

Zakhar Kabluchko, Igor Wigman

Published 2019-02-22Version 1

We determine the true asymptotic behaviour for the expected number of connected components for a model of random lemniscates proposed recently by Lerario and Lundberg. These are defined as the subsets of the Riemann sphere, where the absolute value of certain random, $\text{SO}(3)$-invariant rational function of degree $n$ equals to $1$. We show that the expected number of the connected components of these lemniscates, divided by $n$, converges to a positive constant defined in terms of the quotient of two independent plane Gaussian analytic functions. A major obstacle in applying the novel non-local techniques due to Nazarov and Sodin on this problem is the underlying non-Gaussianity, intristic to the studied model.

Related articles: Most relevant | Search more
arXiv:2301.13424 [math.PR] (Published 2023-01-31)
Inradius of random lemniscates
arXiv:0909.4490 [math.PR] (Published 2009-09-24)
Critical percolation: the expected number of clusters in a rectangle
arXiv:1505.04762 [math.PR] (Published 2015-05-18)
Expected number of real zeros for random Freud orthogonal polynomials