Landscape k-complexity of isotropic centered Gaussian fields

2025/03/26 by Jean‐Marc Azäis, Azaïs, Jean-Marc, Céline Delmas +1
Computer Science · #Coding theory and cryptography #Digital Image Processing Techniques #FOS: Mathematics #Probability (math.PR) #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2503.20397

openalex publication_date 2025/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In large dimension, we study the asymptotic behavior of the mean number of critical points with index k below a level u for an isotropic centered Gaussian random field defined on a family of subsets of R^d depending on d. We prove the existence of three regimes depending on the speed of growth of the volume the parameter set. In the first regime the mean number of critical points decreases exponentially with the dimension. For the second regime, there exists a critical level u_c such that the mean number of critical points with index k below a level u with u > uc increases exponentially with the dimension d independently of the index k and decreases exponentially with d when u < u_c. In the third regime, there exists a layered structure depending on the level u considered and on the index k of the critical points. This behavior is similar to the one encountered on the sphere by Auffinger et al. [5]. In the particular case of the Bargmann-Fock field, only two regimes coexist.

Related

• Complexity of Gaussian random fields with isotropic increments
• Local behavior of critical points of isotropic Gaussian random fields
• On the expected number of critical points of locally isotropic Gaussian random fields
• Expected number density of critical points of smooth Gaussian random fields in arbitrary dimensions
• Extremes of Gaussian random fields with non-additive dependence structure