Motivated by current interest in understanding statistical properties of random landscapes in high-dimensional spaces, we consider a model of the landscape in RN obtained by superimposing M > N plane waves of random wavevectors and amplitudes and further restricted by a uniform parabolic confinement in all directions. For this landscape, we show how to compute the “annealed complexity,” controlling the asymptotic growth rate of the mean number of stationary points as N at fixed ratio α = M/N > 1. The framework of this computation requires us to study spectral properties of N × N matrices W = KTKT, where T is a diagonal matrix with M mean zero independent and identically distributed (i.i.d.) real normally distributed entries, and all MN entries of K are also i.i.d. real normal random variables. We suggest to call the latter Gaussian Marchenko–Pastur ensemble as such matrices appeared in the seminal 1967 paper by those authors. We compute the associated mean spectral density and evaluate some moments and correlation functions involving products of characteristic polynomials for such matrices.

The problem of characterizing statistical properties of high-dimensional random functions, frequently called ”random landscapes,” originated in the theory of disordered systems, such as spin glasses (see Ref. 1 for an accessible introduction), and gradually became popular beyond the original setting, finding numerous applications in diverse fields, such as cosmology,2,3 machine learning via deep neural networks,4,5 and large-size inference problems in statistics.6–9 One of the simplest yet nontrivial landscape characteristics are the so-called landscape complexities given by the rates of exponential growth of the number of stationary points (minima, maxima, and saddles of a particular index) with the number N of dimensions of the associated landscape. Extracting those rates for various models of random spin-glass landscapes initially attracted attention in theoretical physics literature10–14 and became a focus of vigorous activity in recent years; see Refs. 15–24 and the references therein.

The fully controlled (and eventually rigorous) evaluation of complexities has been so far demonstrated only for a few types of landscapes whose random parts possess a high level of statistical symmetry in the underlying N-dimensional space. One of the most paradigmatic examples is the landscape

(1)

where μ is the strength of a isotropic harmonic confinement and V(x) is a Gaussian-distributed random function, which is translationally and rotationally invariant and characterized by the covariance structure,

(2)

In such a case, the associated Hessian Wij(x)=xi,xjV(x) turns out to be given by a matrix simply related12,25 to the classical Gaussian orthogonal ensemble of random matrices. Similar Hessians also appear in studies of rotationally invariant random functions confined to the surface of a high-dimensional sphere.15,16 In both situations, the exploitation of the so-called Kac–Rice formula allowed to perform explicit computations of the so-called “annealed” (i.e., related to the mean number of stationary points) complexities. Moreover, one can further show that annealed and quenched (i.e., characterizing typical realizations of the landscape) complexities coincide for a certain class of potentials V(x)18,22 though, in general, they may differ.

Studying this total annealed complexity revealed that the invariant landscapes (1) and (2) undergo a “topology trivialization transition” from the glassy phase with exponentially many stationary points for small values of the ratio μ/Γ(0)<1 to the phase where there is typically only a single minimum for μ/Γ(0)>1. Similar transitions are also operative in random potentials confined to high-dimensional spheres.7,25–27

The goal of this article is to suggest another class of random high-dimensional landscapes amenable to well-controlled treatment of the annealed complexity. Our construction starts with the same representation (1) but proceeds with choosing the random part in the form of a superposition of random plane waves,

(3)

where u1,2(a) are 2M independent and identically distributed (i.i.d.) normal (mean zero, variance one) random variables.

In Eq. (3), M i.i.d. random vectors ka are drawn as either

  1. random vectors of real Gaussian random variables with zero average and variance 1/N or

  2. random vectors on the unit N-dimensional sphere. Such a vector ka can be built as kia=(Oa)ii for i = 1, …, N, where the N × N random matrix Oa is drawn from the orthogonal group.

We will show that both cases lead to the same asymptotic result in the limit N. We, henceforth, denote α = M/N. Note that the random functions defined via (3) are not Gaussian-distributed due to additional randomness in the choice of wavevectors ka. Note also that for α < 1 at every realization, the function V(x) is constant in the MN subspace orthogonal to the one spanned by M random wavevectors ka. To avoid this situation and to have V(x) varying in the whole space, we, therefore, restrict our computation of the landscape complexity to the case α ≥ 1.

It is also worth mentioning that superpositions of random plane waves naturally emerge in the context of quantum chaos through Berry’s conjecture28 and are currently under intensive study as a universal model for high-energy eigenfunctions of the Laplace operator on generic compact Riemannian manifolds with fixed eigenvalue E = k2. Stationary points in that context have intensively been studied in low spatial dimension N = 2; see Ref. 29 and the references therein. In contrast, we are interested in the case of asymptotically high dimension N ≫ 1.

Finally, for low values of M, N, model (3) describes periodic systems, such as crystals in the presence of quenched impurities, and was much studied mostly for its thermodynamics and dynamics, especially in the context of vortex lattices in superconductors; for reviews, see, e.g., Refs. 30 and 31.

We believe that the suggested landscape in high dimensions represents a new interesting type worth consideration. In particular, we have the following:

  1. Such landscapes still allow for an explicit analytical computation of the total annealed complexity beyond the class of universality of previously studied potentials satisfying (2). We will see that the arising μ-dependence will be quite different. In particular, the landscape will not show the sharp topology trivialization transition at any finite value of μ.

  2. In contrast to translationally invariant random fields, which are extremely difficult to simulate even for moderately big N ∼ 10, a superposition of random plane waves is easily constructed numerically.

As will be demonstrated below, the mean total number of stationary points in the landscape can be expressed in terms of the random matrix average,

(4)

where the Hessian matrix W can be represented as W = KTKT. For M i.i.d. Gaussian vectors ka’s, this matrix turns out to belong to the “Gaussian Marchenko–Pastur ensemble (GMPE), which we define as

(5)

where the variables kia for 1 ≤ iN and 1 ≤ aM (considered as the entries of matrix K) are independent real normal random variables (mean zero, variance 1/N), whereas the M × M matrix T is diagonal with N(0, 1) normal random elements Ta, a = 1, …, M. Here and in the following, we denote T as the average with respect to the diagonal matrix T, K as the average with respect to the matrix K, and as the average with respect to both K and T. The suggested name for this random matrix ensemble32 seems appropriate to us as these types of matrices appeared already in the seminal Marchenko–Pastur paper,33 although they do not seem to be under much study ever since.

Note that had we replaced the diagonal matrix T with the identity matrix, one would arrive at the standard Wishart ensemble whose eigenvalue density at N is given by the famous Marchenko–Pastur distribution. Taking any positive-definite T would provide a natural generalization of the Wishart ensemble. However, the sign-indefinite nature of T in our case makes the properties of the resulting matrices W very different from the Wishart case. We believe that the resulting ensemble GMPE is interesting in its own right, and we further study its mean eigenvalue density as N and correlation properties of its characteristic polynomial for both fixed and random diagonal matrix T. While the main focus of this article is on the landscape complexity, hence on the real symmetric matrices with the Dyson index β = 1 (corresponding to K being a matrix with real independent Gaussian elements), from the point of view of Random Matrix Theory (RMT), it is natural to extend the definition of the Gaussian Marchenko–Pastur ensemble to the Dyson index β = 2 by considering K with normal complex independent elements. (One can also consider taking K with quaternion independent normally distributed elements to generate the ensemble with Dyson index β = 4.) The p-point correlation function of the associated characteristic polynomial for a fixed diagonal matrix T is, then, defined as

(6)

where we take the vector λ = (λ1, …, λp) of spectral parameters to have real elements. For random T, the correlation function in (6) is defined with additionally taking the expectation with respect to the distribution of Ta’s. We will provide some explicit results for correlation functions for fixed T at coinciding points λ1 = ⋯ = λp for any integer p and N, whereas for random T, we will restrict ourselves to p = 1, 2. Treating in the latter case for non-coinciding points λ1λ2, we demonstrate that the correlation structure emerging after averaging over random Ta is quite different from the one known for both the standard invariant ensembles of random matrices and for ensembles with i.i.d. entries. The correlations of characteristic polynomials in the latter two types of RMT ensembles have been under intensive studies in the last two decades; see Refs. 3445.

The rest of this paper is organized as follows. In Sec. II, we summarize the main results obtained in this paper. In Sec. III, we consider the total annealed complexity of landscape (1) with the random potential defined in (3). In Secs. IVV, we characterize the Gaussian Marchenko–Pastur ensemble associated with this counting problem by computing its mean spectral density in Sec. IV and the correlation function of its characteristic polynomial defined in (6) in Sec. V. Finally, in Sec. VI, we discuss and interpret our results and give some perspective on the further investigation of this random landscape. Some details of the computations are relegated to  Appendixes A–C.

Our main result is that in the limit M, N with fixed ratio α = M/N > 1, the total annealed complexity for landscape (1) with the random potential (3) can be expressed as

(7)

in terms of a function mr(μ) ≔ mr, which together with its counterpart mi(μ) ≔ mi satisfies the following pair of equations:

(8)
(9)

Using this expression, we show that in sharp contrast to previously studied models with isotropic harmonic confinement, the total annealed complexity does not undergo a “topology trivialization transition” and stays positive for any finite value 0 < μ < of the strength of the confinement. Still, it decreases very rapidly as μ,

(10)

In Fig. 1, we show a plot of our analytical prediction for the annealed total complexity in the limit N together with numerical simulation for finite N, showing good agreement.

FIG. 1.

Comparison between the annealed total complexity Ξtot(μα) for α = 2 (black solid line) obtained by inserting the solution of Eqs. (8) and (9) into Eq. (7) and numerical simulations of N1ln|det(Iμ1W)| (blue circle) plotted as a function of μ. It is expected that this quantity converges to the annealed complexity in the N limit. These quantities have good agreement for low values of μ, but the numerical data seem to diverge away from its theoretical prediction for larger values of μ. This discrepancy results both from finite size effects and from the fact that the average is dominated by rare events, preventing an efficient numerical evaluation.

FIG. 1.

Comparison between the annealed total complexity Ξtot(μα) for α = 2 (black solid line) obtained by inserting the solution of Eqs. (8) and (9) into Eq. (7) and numerical simulations of N1ln|det(Iμ1W)| (blue circle) plotted as a function of μ. It is expected that this quantity converges to the annealed complexity in the N limit. These quantities have good agreement for low values of μ, but the numerical data seem to diverge away from its theoretical prediction for larger values of μ. This discrepancy results both from finite size effects and from the fact that the average is dominated by rare events, preventing an efficient numerical evaluation.

Close modal

It is worth noting that methodologically the main difference with previously studied cases of Eq. (2) is that the annealed complexity is obtained using the functional variational principle involving the mean spectral density n(t) of the eigenvalues of the random matrix T instead of a variation principle over a single real random variable, as in Ref. 12 and related studies.

In this section, we give the main outcomes of our studies of spectral characteristics of general matrices of the form W = KTKT related to the Marchenko–Pastur ensemble, not only those directly involved in the computation of annealed complexity.

1. Mean asymptotic eigenvalue density for GMPE

Consider the mean spectral density ρ(λ)=limN1Nk=1Nδ(λλk) for the Gaussian MPE matrices W defined in (5). It turns out to be convenient to define the associated resolvent/Stiltjes transform, defined here for a real spectral parameter λ as

(11)

where mrmr(λ) and mimi(λ) are, respectively, its real and imaginary parts. The mean spectral density can be expressed in terms of the resolvent m(λ) as ρ(λ)=I[m(λ)]π where for GMPE, the resolvent m(λ) is obtained by solving the following transcendental equation:

(12)

with Ψ(u)=π2eu22(1+erf(u/2)). The resulting mean spectral density can be shown to be even: ρ(λ) = ρ(−λ), and supported on the whole real line, with the asymptotic behavior as λ → ± given by

(13)

For α > 1, the density ρ(λ) takes its finite maximum value at the origin λ = 0, where ραρ(λ = 0) is the solution of the transcendental equation obtained by inserting m(0) = iπρα in Eq. (12). For α = 1, the density diverges close to the origin as ρ(λ)1/(2π)3/2|λ|.

Let us finally mention that for α < 1, the density ρ(λ) displays a delta peak at the origin (1 − α)δ(λ), reflecting the presence of MN zero eigenvalues. At the same time, its continuous part tends to a finite value at the origin: α/(2π(1α)). In Fig. 2, we plot a comparison between our analytical prediction for the average density of eigenvalues ρ(λ) in the N limit and results from numerical simulation for N = 500, showing excellent agreement.

FIG. 2.

Comparison between the average density ρ(λ) for α = 1, 5 obtained analytically in the limit N from Eq. (12) by using that ρ(λ)=I[m(λ)]π (respectively, blue solid and orange dashed lines) and numerically for a matrix of finite size N = 500 (respectively, blue circles and orange triangles).

FIG. 2.

Comparison between the average density ρ(λ) for α = 1, 5 obtained analytically in the limit N from Eq. (12) by using that ρ(λ)=I[m(λ)]π (respectively, blue solid and orange dashed lines) and numerically for a matrix of finite size N = 500 (respectively, blue circles and orange triangles).

Close modal

2. Moments and correlation functions of characteristic polynomials

For a fixed matrix T, the positive moments of the characteristic polynomial Zβ,p(λ;T)Zβ,p(λ1;T) defined in Eq. (6) with setting λ = λ1 = (λ, …, λ) can be expressed for any integer p > 0 and any size N in terms of a p × p determinant for β = 2,

(14)

and in terms of a 2p × 2p Pfaffian for β = 1,

(15)

In these expressions, the functions gN,m(λT) and qN,m are defined as

(16)

where O is the matrix whose elements are all zero and el(X1,,Xn)=1i1<i2<<ilnj=1lXij is the lth elementary symmetric polynomial. Note that taking T=I, one recovers the known results for the Wishart–Laguerre ensemble; see, e.g., Ref. 43.

For a random diagonal matrix T (not necessarily normally distributed), we only managed to consider the mean of the characteristic polynomials and its two-point correlation function, p = 2. We find that the mean characteristic polynomial only depends on the first moment T=dttn(t), where n(t)limM1Ma=1Mδ(tTa) is the associated density function. For non-zero T0,

(17)

in terms of the hypergeometric function defined as Fqp(a;b;x)=n=0i=1p(ai)nj=1q(bj)nn!xn. For T=0, we instead find Zβ,1(λ)=λN. Note that in any case, Zβ,1(λ) is independent of β. In the large N limit, we study the rate of growth of the mean characteristic polynomial and show that

(18)

where we denoted x=λ/T and x±(α)=(1±α)2 and introduced

(19)
(20)

The two-point spectral correlation function of the characteristic polynomials has been computed for any size N in the case of vanishing mean T=0. It, then, turns out to depend on T only through its variance/second moment T2=dtt2n(t) and reads

(21)

In particular, in the large N limit, we define

(22)

and find that it only depends on the rescaled positive parameter u=|λ1λ2|/T20,

(23)
(24)

Note a somewhat surprising feature of the two-point function in Marchenko–Pastur ensembles with random matrix T: it only depends on the product λ1λ2, in sharp contrast to earlier studied cases34 where in the large-N limit, it rather depended on the spectral difference |λ1λ2|.

In this section, we show how to solve the annealed counting problem discussed in the Introduction. The starting point of our consideration is the standard Kac–Rice formula for the total number of equilibria, which in case (1) reads

(25)

where Wij(x)=xi,xjV(x) and the expectation in the case of potential (3) has been taken over both the components of the vector ka and the coefficients u1,2(a) for a = 1, …, M. It turns out to be expedient to pass from the original random variables u1,2(a),a=1,,M, to the new set of random variables obtained by rotation as

(26)
(27)

Despite the rotation used to define Ta and Ga being explicitly x and ka dependent, the resulting random variables are statistically x and ka independent with zero mean and covariance

(28)

The random force fi=xiV(x) and the Hessian Wij=xi,xjV(x) associated with the potential V(x) are conveniently expressed in terms of these random variables as

(29)
(30)

and using the properties of Ga, Ta, and K, it is easy to see that statistical properties of these random variables are also independent of the position x. Now, we may use in Eq. (25) the Fourier integral representation for the Dirac delta function,

(31)

which allows us to take explicitly the expectation with respect to random variables Ga’s, yielding

(32)

Further integration over x yields

(33)

and after writing explicitly the expectation over the diagonal matrix T, the total number of equilibria finally reads

(34)

where K is the remaining expectation over the random matrix K.

We will now focus on the limit N, M with 1 ≤ M/N = α < . In this particular limit, we define the annealed total complexity as

(35)

where we remind that W = KTKT. In order to make progress in this computation, we assume that for a fixed diagonal matrix T holds the strong self-averaging property, i.e.,

(36)

where the mean limiting spectral density ρ(λ) is defined via

(37)

with λi’s being the random eigenvalues of W = KTKT. This density obviously depends on the diagonal matrix T. Note that in the model with the Gaussian random potential satisfying Eq. (2), a similar strong self-averaging property has been proven rigorously15,16 in considerable generality. With the assumption of its validity for the present model, we may express the average total number of equilibria/stationary points for finite but large N as

(38)

To facilitate extracting the large-N asymptotics, we find it expedient to introduce a variational problem over the normalized limiting density of Ta as

(39)

To this end, we replace the M-dimensional integral over components Ta’s by a functional integral over this density as

(40)
(41)

where l is the Lagrange multiplier necessary to ensure the correct normalization of the density. In the expression of Stot, the second term corresponds to an entropic contribution resulting from the change of variables from the M variables Ta’s to their density n(t) (see Refs. 14 and 46 for a detailed derivation). This form is now amenable to using the Laplace method justified by the large parameter N, yielding for the annealed complexity,

(42)

Let us denote ntot and ltot as the values of the limiting density and Lagrange parameters that minimize Stot. Note that the whole procedure is not unlike to what has been done when evaluating the complexity for Gaussian translationally and rotationally invariant model in Ref. 12; however, instead of maximizing with respect to a single real variable, one has to optimize with respect to the limiting spectral density n(t) in the present case. We also note that although the optimization is presented here in an informal style of theoretical physics, we believe that it can be recast rigorously using the large deviations framework.

Varying the action functional Stot with respect to n(t) yields the stationarity condition

(43)

while the differentiation with respect to the Lagrange parameter l ensures again the normalization for ntot(t). To find ntot(t) and the associated action value, one needs to compute explicitly the functional derivative of ρ(λ) with respect to n(t). We will now show that for the specific type of matrix considered here, this problem is exactly solvable. The resolvent/Stiltjes transform function m(z) associated with the spectral density ρ(λ) satisfies for a fixed limiting density n(t) a self-consistency equation derived by Marchenko and Pastur in Ref. 33, which reads

(44)

This equation holds in the asymptotic limit N, M with fixed α = M/N = O(1) for a matrix K whose columns ka for a = 1, …, M are either i.i.d. Gaussian vectors or i.i.d. vectors uniformly drawn on the unit N-sphere. The resolvent can be introduced in the saddle-point Eq. (43) using the identity

(45)

where mr(ν) is the real part of the resolvent m(ν) at the real spectral parameter ν, and we have used that zmr(z) = zρ(λ)/(zλ) → 1 for any real or complex spectral parameter z in the limit |z| → . Using the self-consistency equation [Eq. (44)], one can compute the functional derivative of m(z) at any complex spectral parameter z with respect to n(t) explicitly,

(46)

Comparing this expression with the derivative of the resolvent m(z) with respect to z,

(47)

one obtains a simple identity

(48)

This identity can, then, be used to obtain

(49)

where we introduced mr(μ) and mi(μ) as the real and imaginary parts of the resolvent m(μ) at the real spectral parameter μ, respectively. Now, the stationarity condition (43) implies that the optimal density ntot(t) satisfies the following equation:

(50)

which is immediately solved in terms of the real and imaginary parts of the resolvent at position μ, yielding

(51)

with Z(μ)=eltot+1/2π being the μ-dependent normalization factor given explicitly by

(52)

Finally, at a real value of μ, the self-consistency equation Eq. (44) for the full resolvent m(μ) can be rewritten as a pair of equations for the real and imaginary parts mrmr(μ) and mimi(μ),

(53)
(54)

Recall that the imaginary part of the resolvent is expressed in terms of the limiting spectral density as mi(μ) = πρ(μ). For the optimal density ntot(t) of T being unbounded, it is expected that the limiting spectral density ρ(λ) of W = KTKT is also unbounded; see Ref. 33. Hence, mi(μ) > 0 for any 0 < μ < , and one can divide by mi on both sides of Eq. (54). Inserting, then, the expression of ntot(t), one obtains the more explicit equations [Eqs. (8) and (9)]. This pair of equation allows us to express mi(μ) and mr(μ) at the optimal solution. One now needs to relate these values to the complexity expression (42) for Ξtot(μα). In order to obtain a convenient representation for the total complexity, we first compute its derivative with respect to μ as

(55)

where we have used that ntot is the density that minimizes Stot. Finally, using again that as μ, mr(μ) = dλρ(λ)/(μλ) → μ−1 such that mr(μ) − μ−1 → 0, one arrives at the final expression for the annealed complexity,

(56)

In the limit μ, we expect that mr(μ) ∼ μ−1, while mi(μ)eμ2/2, which is inherited from the Gaussian decay of ntot(t) (see also a related discussion on the asymptotic of spectral density below). In that limit, one can safely set mi(μ) → 0 in Eqs. (52) and (53), which yields

(57)
(58)

In particular, from the second equation, one obtains that

(59)

showing that the total complexity is never zero for any finite strength of the isotropic confinement μ, although it vanishes very rapidly at large μ. Such behavior is in stark contrast with previously considered models with isotropic confinement, where the complexity was found to vanish for μ > μc, signaling of the total “landscape topology trivialization” beyond a finite value of the confining parameter.

In this section, we study the simplest spectral characteristic of GMPE: its mean spectral density in the limit N, M with α = M/N = O(1) defined as

(60)

where λi’s are the random eigenvalues of W = KTKT. In this expression, the expectation is taken over both the random N × M matrix K with independent N(0,1/N) entries and the random M × M diagonal matrix T with real i.i.d. N(0, 1) random elements. The resolvent m(z) = ∫dλρ(λ)/(zλ), defined as the Stieltjes transform of the spectral density ρ(λ), is solution of (44) with the Gaussian limiting distribution n(t)=exp(t2/2)/2π. Computing explicitly the integral over t, one obtains the following transcendental equation for m(z):

(61)

where Ψ(u)=π2eu22(1+erf(u/2)). Taking the parameter z = λ on the real axis, we introduce as in Sec. III the real and imaginary part of the resolvent m(λ) = mr(λ) + imi(λ). The spectral density is, then, extracted from the resolvent m(λ) by using the identity

(62)

While Eq. (61) allows for an efficient numerical evaluation of the density at a given real position z = λ, the properties of the mean density ρ(λ) are most easily analyzed using the set of equations for the real and imaginary part of the resolvent,

(63)
(64)

In particular, for an even limiting density n(−t) = n(t), one can show from (63) and (64) that the mean spectral density ρ(−λ) = ρ(λ) is even as well. Indeed, the pair of Eqs. (63) and (64) is invariant under the symmetry (λ, mr, mi) → (−λ, −mr, mi) together with the change of variable t → −t in the integrals. As ρ(λ) = mi(λ)/π, the mean spectral density is also even.

For an unbounded limiting density n(t) of T, such as the Gaussian density in GMPE, the associated mean spectral density ρ(λ) for matrices W = KTKT is also unbounded.33 In that limit, one expects that mi(λ) = πρ(λ) ∝ n(λ) ≪ mr(λ) as λ. Using this approximation and introducing in the integrals of Eqs. (63) and (64) the change of variable t=1/mr+miu/mr3, one obtains to leading order in mi,

(65)
(66)

In particular, for a Gaussian-shaped density n(t), it yields the asymptotic behavior

(67)

For α > 1, the spectral density ρ(λ = 0) = ρα is finite, and in the present case, it is obtained by setting z = 0 and m(z) = iπρα in Eq. (61), yielding

(68)

As α → 1+, one obtains that the value ρα[2π(1α)]1 diverges.

For α < 1, instead, the mean spectral density displays both a continuous and a discontinuous part. The fraction of zero eigenvalues is given by 1 − M/N = 1 − α and is independent of the limiting density n(t) (as long as T does not have a macroscopic number of zero eigenvalues). On the other hand, the continuous part of the spectral density reaches a finite value ρα for λ → 0. The value of this constant can be obtained by inserting m(λ) = (1 − α)/λ + πρα in Eq. (61) and expanding for λ → 0. This yields

(69)

Finally, in the special case α = 1, the spectral density is continuous but diverges on approaching the origin as

(70)

Let us finally consider the moments λn=dλλnρ(λ). As ρ(λ) is even, it trivially yields all odd moments vanishing: λ2n+1=0. For any α, the even moments can be computed using that for z,

(71)

Using Eq. (44), one obtains that

(72)

where Tk=dttkn(t), and we have considered a symmetric density profile n(−t) = n(t). In particular, for the Gaussian distribution, T2n=2nΓ(n+1/2)/π and the lowest moments can be obtained explicitly as

(73)
(74)

In this section, we describe a computation of the p-point correlation function of the characteristic polynomial defined in Eq. (6) for Marchenko–Pastur ensembles. Such objects are known to provide insights into spectral correlations and, as such, are interesting on their own and attract much attention. Note also that the mean total number of equilibria is expressed in Eq. (4) in terms of the object not dissimilar to Zβ,p(λ;T) defined in Eq. (6). However, the presence of the absolute value forced us to resort only to asymptotic analysis for N relying on the strong self-averaging hypothesis. In contrast, we will show that the moments that do not contain absolute values can be computed exactly for any finite N without any approximation.

Let us now obtain an explicit expression for Zβ,p(λ;T). We first consider the case of a fixed diagonal matrix T with elements that are not necessarily positive. Introduce p pairs of N-dimensional vectors {ψ̃j,ψj} with anticommuting/Grassmann components such that ψiψj = −ψjψi, ∫dψ = 0, and ∫ψdψ = 1. Then, each of the p determinant factors in the right-hand side of Eq. (6) can be written as the standard Berezin integral det(A)=DψDψ̃expψ̃TAψ=DψDψ̃expTr(Aψ̃Tψ), yielding

(75)

where Q(s) = Q + QT is the symmetric part of Q=j=1pψjψ̃jT, and in the second line, we have used that ka is the expectation with respect to the Gaussian density p(ka)eNβkaka/2 for the ath column of K, which we evaluated in the second line of Eq. (75). Introducing the 2p × 2p matrix

(76)

satisfying Tr(Q(s))k=TrQ̂k, one can show that

(77)

As the integrand in Eq. (75) only depends on Q̂, one can use the so-called “bosonization” trick proposed in Ref. 47 and replace the integral over anticommuting variables by the invariant integration over unitary matrices U belonging to the group C(4/β)E(p),

(78)

where Θa,β(U)=det(I(2/β)pTaNU)β/2 and

(79)

Note that for β = 1, the integration over the group C4E(p) = CSE(p) defines the circular symplectic ensemble, i.e., the ensemble of unitary matrices U with skew symmetric sub-blocks,

(80)

that satisfy

(81)

On the other hand, for β = 2, the group C2E(p) = CUE(p) gives the standard Circular Unitary Ensemble (CUE).

For a fixed diagonal matrix T, we focus our attention on the special case where all λj’s are identical, i.e., λ = λ1 = (λ, …, λ). In that case, both integrands in the numerator and the denominator of Eq. (78) are unitary invariant, and hence, their ratio can be expressed solely in terms of the integrals over eigenvalues of the unitary matrix U. This yields the following expression:

(82)

where we introduced a function

(83)

For β = 2, using that det1i,jp(xij1)=i<jp(xixj) together with the Cauchy–Binet–Andréief formula,48 Eq. (82) can be re-written as the ratio of determinants,

(84)

where

(85)
(86)

For each integral here, there is a unique pole of order N + m + 1 at z = 0, and using the residue theorem yields

(87)

where el(X) is the lth elementary symmetric polynomial defined as

(88)

Similarly, for β = 1, using the identity

(89)

and applying further De Bruijn’s identity, the pth moment of the characteristic polynomial can be expressed as a ratio of Pfaffians,

(90)

In Fig. 3, we have compared our exact analytical results for Zβ,p(λ;T) as a function of λ given in Eqs. (84) and (90), respectively, for β = 1, 2 taking fixed diagonal matrix T with numerical simulations, obtaining excellent agreement.

FIG. 3.

Left: comparison between the analytical expression for Z2,2(λ,T) in Eq. (84) (dark line) for N = 5, α = M/N = 2 and fixed T(1) = (0.4339, 1.0562, −0.3710, 0.3090, −0.8655, −1.0482, −1.6036, −0.7595, 1.1370, −1.0643)T and numerical simulations (markers), plotted as a function of λ. Right: comparison between the analytical expression for Z1,2(λ,T) in Eq. (90) (dark line) for N = 4, α = M/N = 2 and fixed T(2) = (0.4339, 1.0562, −0.3710, 0.3090, −0.8655, −1.0482, −1.6036, −0.7595)T and numerical simulations (markers), plotted as a function of λ. For each panel, the number of samples is 105.

FIG. 3.

Left: comparison between the analytical expression for Z2,2(λ,T) in Eq. (84) (dark line) for N = 5, α = M/N = 2 and fixed T(1) = (0.4339, 1.0562, −0.3710, 0.3090, −0.8655, −1.0482, −1.6036, −0.7595, 1.1370, −1.0643)T and numerical simulations (markers), plotted as a function of λ. Right: comparison between the analytical expression for Z1,2(λ,T) in Eq. (90) (dark line) for N = 4, α = M/N = 2 and fixed T(2) = (0.4339, 1.0562, −0.3710, 0.3090, −0.8655, −1.0482, −1.6036, −0.7595)T and numerical simulations (markers), plotted as a function of λ. For each panel, the number of samples is 105.

Close modal

Let us finally mention that in the case λ = 0, one can use the following identities from Ref. 49:

(91)
(92)

with

(93)

where the hypergeometric function of matrix argument is defined as

(94)

with κ standing for a partition of k and (a)κ(α) being the generalized Pochhammer symbol associated with the partition κ = (κ1, …, κm),

(95)

and the function Cκ(α)(X) is the so-called C-normalization of the Jack polynomial.49 This allows us to express the function Zβ,p(0;T) via a ratio of the hypergeometric functions as

(96)

Let us now consider the case of random diagonal matrix T and average the p-point characteristic polynomial Zβ,p(λ;T) over realizations of T, denoting these expectations as Zβ,p(λ)=Zβ,p(λ;T)T. In contrast to the case of fixed T, we now consider λj’s that are not necessarily identical but focus only on the low values p = 1 and p = 2 for β = 1, 2. Interestingly, we find that the ensuing formulas are universal in the sense that Zβ,p(λ) depends on the whole distribution of T only via the lowest moments Tk=dttkn(t),k=1,2, of the i.i.d. elements of T, assuming that those moments are finite.

1. The case p = 1

In such a case, we can directly use the results in Eqs. (84) and (90) for fixed T and take the average value with respect to the i.i.d. diagonal elements Ta of T. This yields

(97)

In the particular case of a symmetric distribution n(t) = n(−t), we have T=0 and (97) simplifies drastically: Zβ,1(λ)=det(λIW)=λN. If T0 instead and assuming |T|<N, Zβ,1(λ) is expressed for finite N as

(98)

where we remind the definition of the standard hypergeometric function,

(99)

with (a)n=i=0n1(a+i) being the Pochhammer symbol.

Note that the ratio Zβ,1(λ)/λN only depends on the rescaled variable x=λ/T. In the limit N and for T0, changing the variable from z to w=(T/N)z in Eq. (97), one obtains

(100)
(101)

which can, then, be conveniently analyzed using Laplace’s method. The saddle points of L1(w;x,α) in the w domain are given by w±(x,α)=(1α+x±(α1x)24x)/(2x) and are complex conjugate for (α − 1 − x)2 < 4x, i.e., x ∈ [x(α), x+(α)], where x±(α)=(1±α)2 or both real in the converse case. Interestingly, the boundaries of the interval where w± are complex conjugate correspond to the boundaries of the support of the classic Marchenko–Pastur distribution, i.e., x±(α)=(1±α)2. In the large N limit, a careful analysis of Eq. (100) (see  Appendix A for details) allows us to obtain

(102)

The function Ξ1(xα) changes the sign over the real interval and behaves in the limit x → ± as

(103)

which matches smoothly the expression ln|Zβ,1(λ)/λN|=0 for T=0. This result is in stark contrast with the behavior of Ξtot(μα), which is positive for any value of μ > 0 and vanishes as μ as in Eq. (59), i.e., much faster than the algebraic decay, emphasizing the crucial role played by the absolute value in definition (35). In Fig. 4, we show a comparison between the analytical expression of Ξ1(x, α) for α = 2 and the finite N = 20 expression of N1ln|Z1,1(x)/xN| with T=1, showing excellent agreement.

FIG. 4.

Comparison between the analytical expression of Ξ1(x, α) for α = 2 (black solid line) obtained from Eq. (102) and the expression of 1Nln|Z1,1(x)/xN| (blue circles) for T=1, N = 20, and α = 2, plotted as a function of x. The number of samples is 107.

FIG. 4.

Comparison between the analytical expression of Ξ1(x, α) for α = 2 (black solid line) obtained from Eq. (102) and the expression of 1Nln|Z1,1(x)/xN| (blue circles) for T=1, N = 20, and α = 2, plotted as a function of x. The number of samples is 107.

Close modal

2. Calculation for p = 2 and β = 1, 2

In order to obtain an exact finite N expression of the two-point correlation function Zβ,2(λ)=Zβ,2(λ;T)T for λ = (λ1, λ2), we start from Eq. (78) and introduce an explicit representation of matrices UC(4/β)E(2), separately for β = 1 and β = 2. In the special case of vanishing moment T=0, one is able to perform the integration over matrices U (see  Appendix B for details) and obtain the following expression:

(104)

Note that Zβ,2(λ) only depends on λ = (λ1, λ2) through the product λ1λ2, and the ratio Zβ,2(λ=(λ1,λ2))/(λ1λ2)N only depends on the rescaled variable y=λ1λ2/T2. This is highly unusual as similar objects for Gaussian or Wishart matrices become in the large-N limit a function of the difference |λ1λ2|; see Refs. 34 and 50. In Fig. 5, we show a comparison between our analytical result in Eq. (104) and numerical simulations, showing excellent agreement.

FIG. 5.

Comparison between the analytical expression of Z1,2T in Eq. (104) (solid line) and numerical simulations (markers), plotted as a function of the product of spectral parameters x = λ1λ2. The left panel corresponds to α = 1, while the right one corresponds to α = 2. For each panel, we have fixed T2=0.5,T=0,N=6 and the number of samples is 106.

FIG. 5.

Comparison between the analytical expression of Z1,2T in Eq. (104) (solid line) and numerical simulations (markers), plotted as a function of the product of spectral parameters x = λ1λ2. The left panel corresponds to α = 1, while the right one corresponds to α = 2. For each panel, we have fixed T2=0.5,T=0,N=6 and the number of samples is 106.

Close modal

Let us consider the large N limit of Eq. (104). To this purpose, we re-write the ratio of Eq. (104) by (λ1λ2)N as the finite sum,

(105)

where y=λ1λ2/T2. Replacing M = αN with α ≥ 1 and transforming the sum over k into a Riemann integral over η = k/N, one can, then, evaluate the large N behavior of this expression using the Laplace method such that

(106)

where (see  Appendix C for details)

(107)

The saddle-point equation yields a third order algebraic equation for the value η that maximizes the action L2(η;u,α),

(108)
(109)
(110)

and where the correct solution is obtained using Cardano’s formula as (see  Appendix C)

(111)

Thus, for any value of u and α, one can show that

(112)

Similarly as for the total complexity Ξtot(μα), the function Ξ2(uα) is positive for any finite u and vanishes only as u although in a much slower fashion compared to Eq. (59), i.e.,

(113)

On the other hand, one can obtain that the function Zβ,2(λ) achieves a value exponentially large in N for λ1λ2 = 0, with

(114)

In Fig. 6, we show a comparison between the expression of Ξ2(uα) in Eq. (112) and numerical simulations of N1ln|Z1,2(u,u)/uN| and N1ln|Z1,2(1,u)/uN|. In the large N limit, it is expected that limNN1ln|Z1,2(λ1,λ2)/(λ1λ2)N| only depends on the rescaled parameter u = |λ1λ2| and these quantities should, thus, coincide. The agreement is reasonably good for low values of u, but there is some discrepancy (probably resulting from finite N corrections) for larger values of u.

FIG. 6.

Comparison between the analytical expression of Ξ2(x, α) for α = 2 (black solid line) obtained from Eq. (112) and the expression of N1ln|Z1,2(u,u)/uN| (blue circles) and N1ln|Z1,2(1,u)/uN| (orange triangles) for T=0, T2=0, N = 20, and α = 2, plotted as a function of x. The number of samples is 107. It is expected that all three curves coincide in the limit N. The agreement is rather good for low values of u, but there is some discrepancy for larger values of u, most probably due to finite N effects.

FIG. 6.

Comparison between the analytical expression of Ξ2(x, α) for α = 2 (black solid line) obtained from Eq. (112) and the expression of N1ln|Z1,2(u,u)/uN| (blue circles) and N1ln|Z1,2(1,u)/uN| (orange triangles) for T=0, T2=0, N = 20, and α = 2, plotted as a function of x. The number of samples is 107. It is expected that all three curves coincide in the limit N. The agreement is rather good for low values of u, but there is some discrepancy for larger values of u, most probably due to finite N effects.

Close modal

In this article, we have introduced a model of the complex landscape resulting from a superposition of a large number M of random plane waves (larger than the dimension N of the Euclidean space). We have computed exactly the total annealed complexity of this random landscape confined by an isotropic harmonic potential of strength μ in the limit N, M with α = M/N > 1. In contrast to previously studied cases, see, e.g., Ref. 12, this system does not display a “topological trivialization transition,” i.e., the total annealed complexity is strictly positive for any finite μ.

The random part of the Jacobian associated with such a random landscape defines a random matrix W = KTKT belonging to a new random matrix ensemble that we denote “Gaussian Marchenko–Pastur Ensemble” (GMPE). We have studied the properties of this ensemble by computing both the average density of eigenvalues in the large N limit and some specific correlation functions of the characteristic polynomial. Rather surprisingly, we have shown that in the large N limit, the two-point correlation function depends on the product of the two spectral parameters instead of their distance, as is the case for standard random matrix ensembles.34,50

The unforeseen behavior of the total annealed complexity naturally invites a further study of the Gibbs measure associated with this random landscape at fixed inverse temperature β = 1/T. Indeed, for translationally and rotationally invariant Gaussian models,14 it was shown that the trivial phase naturally corresponds to the replica symmetric phase in the Parisi framework. The absence of such a phase in the complexity might indicate that the replica symmetry breaking is operative for any μ at T = 0 and possibly also for positive values of the inverse temperature in this system. This will be the subject of a future publication.

Finally, it would be worth performing some numerical studies on the number of stationary points, their type, and other landscape statistics for the type of landscapes studied in the present paper. We hope that for moderately big values of N, such simulations should be more feasible than for landscapes based on more standard rotationally and translationally invariant Gaussian models.

Submitting this article to the collection celebrating Freeman Dyson, one of the founding fathers of the modern random matrix theory, we would also like to dedicate it to Vladimir Marchenko who turns 100 years old in July 2022 and whose pioneering 1967 paper with Leonid Pastur deeply influenced the subsequent development of the field.

We would like to thank Pierre Le Doussal for his interest in the work and, in particular, for pointing out a few relevant references. The research by Bertrand Lacroix-A-Chez-Toine and Yan V. Fyodorov was supported by the EPSRC under Grant No. EP/V002473/1 (Random Hessians and Jacobians: theory and applications). Sirio Belga Fedeli acknowledges the support from the EPSRC Centre for Doctoral Training in Cross-Disciplinary Approaches to Non-Equilibrium Systems through Grant No. EP/L015854/1.

The authors have no conflicts to disclose.

Bertrand Lacroix-A-Chez-Toine: Formal analysis (equal); Writing – original draft (equal); Writing – review & editing (equal). Yan V. Fyodorov: Conceptualization (equal); Supervision (equal); Validation (equal); Writing – original draft (equal); Writing – review & editing (equal). Sirio Belga Fedeli: Formal analysis (equal); Writing – original draft (equal); Writing – review & editing (equal).

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Let us start from Eq. (100) that we reproduce here,

(A1)
(A2)

where x=λ/T. The saddle points of L1(w;x,α) are given by

(A3)

The contribution of each of them depends on the sign of Δ1 = (α − 1 − x)2 − 4x.

For Δ1 > 0, corresponding either to x < x(α) or x > x+(α) with x±(α)=(1±α)2, the saddle points w± both lie on the real line. In order to obtain the stability of the fixed points, let us compute

(A4)

which is real and positive only for w± real and inside the interval between its two roots ((1α)1,(1+α)1). These two roots translate in terms of x as the two edges x±(α) of the usual Marchenko–Pastur distribution, and one can check that for x > x+(α), one has w((1α)1,(1+α)1) (and w+ outside of this interval), and conversely for x < x(α), one has w+((1α)1,(1+α)1) (and w outside).

Conversely, for Δ1 < 0, i.e., x ∈ (x(α), x+(α)), w± are complex conjugate complex numbers and both contribute in encircling the origin. In this region, the real part of the term in Eq. (A4) is positive and the same for both w± such that both saddle-points have equal contribution. The imaginary part of the term in Eq. (A4) changes its sign for x = (α − 1)2/(α + 1).

Summarizing, one obtains for N ≫ 1,

(A5)
(A6)

Finally, for x = x±(α), the saddle points are unique and of order 2:

  1. For x = x+(α), one has that w+=(1+α)1 such that
    (A7)
    Therefore, the steepest descent directions at the point w+ are {2π/3, 4π/3, 0}. One can locally deform the contour, introducing the scalar t ∈ (−, +) and approaching and leaving w+ with w(t) = ei4π/3t + w+ and w(t) = ei2π/3t + w+, respectively, yielding
    (A8)
  2. For x = x(α), w=(1α)1 such that
    (A9)
    The steepest descent directions at w are {π/3, π, 5π/3}. The contour is deformed by parametrizing the path and approaching and leaving w with w(t) = ei1/3πt + w and w(t) = ei5/3πt + w, respectively, yielding
    (A10)
    In each case, one obtains that the term
    (A11)
    where x=λ/T.

Let us first consider β = 2. In this case, Λ = diag(λ1, λ2), and we introduce four variables ψij with ij and i, j = 1, 2, and ϕ such that 0 ≤ ψij ≤ 2π and 0 ≤ ϕπ/2. Therefore, a possible parametrization of U is given as follows:51 

(B1)

The Euclidean line element (ds)2 = i,j|dUij|2 reads in this parametrization

(B2)

The associated Jacobian is given by 2detM, where

(B3)

The normalized Haar measure is obtained calculating detMdψ11dψ12dψ22dϕ and is given by dU=14π3cosϕsinϕdψ11dψ12dψ22dϕ. With the further assumption that T=0, from what stated above follows

(B4)
(B5)
(B6)

The denominator of Eq. (78) reads

(B7)

while the numerator reads

(B8)

Therefore, for β = 2, Eq. (104) is given by the ratio of Eqs. (B7) and (B8).

For β = 1, we impose T2=1 to simplify the computations. The general case is retrieved by multiplying Z2,β=1(λ) by T2N and rescaling λ1,2λ1,2/T2. We rename Λ = diag(λ1, λ2, λ1, λ2), while now the matrix U is parameterized with a 2 × 2 block matrix. Finally, we introduce six variables: h1, h2 ∈ (0, 1) and ϕ11, ϕ21, ϕ22, ϕ14 ∈ (0, 2π). Therefore (see Ref. 51),

(B9)

with

(B10)

and

(B11)

Similarly to Eq. (B2), in order to retrieve the normalized Haar measure, the Euclidean line element is (ds)2 = i,j|dUij|2 = 2i,j|dU11;i,j|2 + i,j|dU12;i,j|2 + i,j|dU21;i,j|2. In detail, we have that

(B12)

To simplify the calculation, we can re-arrange the differential of the six variables such that the Jacobian is given by the product of the square roots of the matrices A1 and A2. The latter are

(B13)

and

(B14)

We obtain the Haar measure by calculating

(B15)
(B16)
(B17)

Integrating out the six linear and angular variables, one obtains

(B18)

The denominator appearing in Eq. (78) is

(B19)
(B20)

whereas the numerator in Eq. (78) reads

(B21)

The angular variables ϕ22 and ϕ21 in the integral above can be integrated out with the auxiliary variable ϕ = ϕ22 + ϕ21. The integral appearing in Eq. (B21) is simplified to

(B22)

Working out the remaining integration, the expression above becomes

(B23)

and Eq. (104) is retrieved with the introduction of the hypergeometric function.

We consider the case of centered random variables, i.e., Ti=0. In order to obtain the asymptotics of Zβ,2, it is convenient to start from Eq. (104) and to introduce x=λ1λ2/T2. Expanding the terms within the hypergeometric function, we note

(C1)

where (b)k=Γ(b+k)Γ(b) is the Pochhammer symbol.

Let us first consider the case where x > 0. In that case, we can safely replace in the large N limit the summation above with an integral by rescaling k = with η ∈ [0, 1]. Therefore, for N sufficiently large, one observes

(C2)
(C3)

The maximum of L2 is located in η* ∈ [0, 1]. The latter is the solution of the following equation:

(C4)

Hence, we need to retrieve the roots of p(η) = η2(α − 1 + η) − x(1 − η). First, one observes that limη→±p(η) = ± and p(0) = −x. For η > 0, p(η) is strictly increasing since η2 + 2η(α + η − 1) + x > 0. For x → 0+, the zero of p tends to 0. For x → +, it tends to 1. With the help of Cardano’s formula, the root is

(C5)

One can check that this solution η* ∈ (0, 1), and in this interval, it corresponds to a maximum as

(C6)

Finally, one obtains that in the regime N ≫ 1,

(C7)

Let us now consider the more involved case where x < 0. In that case, one needs to consider separately the terms for even and odd values of k by re-writing the expression as

(C8)

We may now in each term replace the sum over k with an integral over, respectively, ηe = 2k/N and ηo = (2k + 1)/N with ηo, ηe ∈ [0, 1]. The saddle point is the same as for x > 0, but one now needs to subtract the contribution from even and odd values of k. This is equivalent to doing a Taylor expansion in the parameter η* of the expression in Eq. (C7). The result at exponential order in N is the same, but the finite N corrections are, thus, different.

1.
T.
Castellani
and
A.
Cavagna
, “
Spin-glass theory for pedestrians
,”
J. Stat. Mech.
2005
(
05
),
P05012
.
2.
A.
Masoumi
,
A.
Vilenkin
, and
M.
Yamada
, “
Inflation in multi-field random Gaussian landscapes
,”
J. Cosmol. Astropart. Phys.
2017
(
12
),
035
.
3.
L. L.
Feng
,
S.
Hotchkiss
, and
R.
Easther
, “
The distribution of vacua in random landscape potentials
,”
J. Cosmol. Astropart. Phys.
2021
(
01
),
029
.
4.
A.
Choromanska
,
Y.
LeCun
, and
G.
Ben Arous
, “
Open problem: The landscape of the loss surfaces of multilayer networks
,” in
Proceedings of the 28th Conference on Learning Theory, PMLR
(
PMLR
,
2015
), Vol. 40, pp.
1756
1760
.
5.
N. P.
Baskerville
,
J. P.
Keating
,
F.
Mezzadri
, and
J.
Najnudel
, “
The loss surfaces of neural networks with general activation functions
,”
J. Stat. Mech.: Theory Exp.
2021
,
064001
.
6.
G. B.
Arous
,
S.
Mei
,
A.
Montanari
, and
M.
Nica
, “
The landscape of the spiked tensor model
,”
Commun. Pure Appl. Math.
72
(
11
),
2282
2330
(
2019
).
7.
V.
Ros
,
G. B.
Arous
,
G.
Biroli
, and
C.
Cammarota
, “
Complex energy landscapes in spiked-tensor and simple glassy models: Ruggedness, arrangements of local minima, and phase transitions
,”
Phys. Rev. X
9
(
1
),
011003
(
2020
).
8.
A.
Maillard
,
G.
Ben Arous
, and
G.
Biroli
, “
Landscape complexity for the empirical risk of generalized linear models
,” in
Proceedings of Machine Learning Research
(
PMLR
,
2020
), Vol. 107, pp.
287
327
.
9.
Y. V.
Fyodorov
and
R.
Tublin
, “
Optimization landscape in the simplest constrained random least-square problem
,”
J. Phys. A: Math. Theor.
55
(
24
),
244008
(
2022
).
10.
A.
Cavagna
,
I.
Giardina
, and
G.
Parisi
, “
Stationary points of the Thouless-Anderson-Palmer free energy
,”
Phys. Rev. B
57
(
18
),
11251
11257
(
1998
).
11.
A.
Cavagna
,
J. P.
Garrahan
, and
I.
Giardina
, “
Quenched complexity of the mean-field p-spin spherical model with external magnetic field
,”
J. Phys. A: Math. Gen.
32
,
711
723
(
1999
).
12.
Y. V.
Fyodorov
, “
Complexity of random energy landscapes, glass transition, and absolute value of the spectral determinant of random matrices
,”
Phys. Rev. Lett.
92
,
240601
(
2004
);
[PubMed]
13.
A. J.
Bray
and
D. S.
Dean
, “
Statistics of critical points of Gaussian fields on large-dimensional spaces
,”
Phys. Rev. Lett.
98
,
150201
(
2007
).
14.
Y. V.
Fyodorov
and
I.
Williams
, “
Replica symmetry breaking condition exposed by random matrix calculation of landscape complexity
,”
J. Stat. Phys.
129
,
1081
1116
(
2007
).
15.
A.
Auffinger
,
G. B.
Arous
, and
J.
Černý
, “
Random matrices and complexity of spin glasses
,”
Commun. Pure Appl. Math.
66
(
2
),
165
201
(
2013
).
16.
A.
Auffinger
and
G.
Ben Arous
, “
Complexity of random smooth functions on the high-dimensional sphere
,”
Ann. Probab.
41
(
6
),
4214
4247
(
2013
).
17.
Y. V.
Fyodorov
and
C.
Nadal
, “
Critical behavior of the number of minima of a random landscape at the glass transition point and the Tracy-Widom distribution
,”
Phys. Rev. Lett.
109
,
167203
(
2012
).
18.
E.
Subag
, “
The complexity of spherical p-spin model—A second moment approach
,”
Ann. Probab.
45
(
5
),
3385
3450
(
2017
).
19.
Y. V.
Fyodorov
,
P.
Le Doussal
,
A.
Rosso
, and
C.
Texier
, “
Exponential number of equilibria and depinning threshold for a directed polymer in a random potential
,”
Ann. Phys.
397
,
1
64
(
2018
).
20.
V.
Ros
, “
Distribution of rare saddles in the p-spin energy landscape
,”
J. Phys. A: Math. Theor.
53
(
12
),
125002
(
2020
).
21.
Y. V.
Fyodorov
and
R.
Tublin
, “
Counting stationary points of the loss function in the simplest constrained least-square optimization
,”
Acta Phys. Pol., B
51
,
1663
1672
(
2020
).
22.
E.
Subag
and
O.
Zeitouni
, “
Concentration of the complexity of spherical pure p-spin models at arbitrary energies
,”
J. Math. Phys.
62
(
12
),
123301
(
2021
).
23.
G.
Ben Arous
,
P.
Bourgade
, and
B.
McKenna
, “
Landscape complexity beyond invariance and the elastic manifold
,” arXiv:2105.05051.
24.
J.
Grela
and
B. A.
Khoruzhenko
, “
Glass-like transition described by toppling of stability hierarchy
,”
J. Phys. A: Math. Theor.
55
(
15
),
154001
(
2022
).
25.
Y. V.
Fyodorov
, “
High-dimensional random fields and random matrix theory
,”
Markov Processes Relat. Fields
21
(
3
),
483
518
(
2015
), http://math-mprf.org/journal/articles/id1385/.
26.
Y. V.
Fyodorov
and
P.
Le Doussal
, “
Topology trivialization and large deviations for the minimum in the simplest random optimization
,”
J. Stat. Phys.
154
(
1
),
466
490
(
2014
).
27.
D.
Belius
,
J.
Černý
,
S.
Nakajima
, and
M.
Schmidt
, “
Triviality of the geometry of mixed p-spin spherical Hamiltonians with external field
,”
J. Stat. Phys.
186
(
1
),
12
(
2022
).
28.
M. V.
Berry
, “
Regular and irregular semiclassical wavefunctions
,”
J. Phys. A: Math. Gen.
10
(
10
),
2083
2091
(
1977
).
29.
D.
Beliaev
,
V.
Cammarota
, and
I.
Wigman
, “
Two point function for critical points of a random plane wave
,”
Int. Math. Res. Not.
2019
(
9
),
2661
2689
.
30.
G.
Blatter
,
M. V.
Feigel’man
,
V. B.
Geshkenbein
,
A. I.
Larkin
, and
V. M.
Vinokur
, “
Vortices in high-temperature superconductors
,”
Rev. Mod. Phys.
66
,
1125
1388
(
1994
).
31.
P.
Le Doussal
, “
Novel phases of vortices in superconductors
,”
Int. J. Mod. Phys. B
24
,
3855
3914
(
2010
).
32.

Note that in the Ph.D. thesis of one of the authors: S. Belga Fedeli. Random Matrix Methods in Complex Systems Analysis, (2021), the same ensemble was called “the Generalized Wishart.” We, however, feel that the name used in this paper is more appropriate.

33.
V. A.
Marčenko
and
L. A.
Pastur
, “
Distribution of eigenvalues for some sets of random matrices
,”
Math. USSR-Sb.
1
,
457
483
(
1967
).
34.
E.
Brézin
and
S.
Hikami
, “
Characteristic polynomials of random matrices
,”
Commun. Math. Phys.
214
,
111
135
(
2000
).
35.
E.
Brézin
and
S.
Hikami
, “
Characteristic polynomials of real symmetric random matrices
,”
Commun. Math. Phys.
223
,
363
382
(
2001
).
36.
Y. V.
Fyodorov
and
E.
Strahov
, “
An exact formula for general spectral correlation function of random Hermitian matrices
,”
J. Phys. A: Math. Gen.
36
(
12
),
3203
3214
(
2003
).
37.
E.
Strahov
and
Y. V.
Fyodorov
, “
Universal results for correlations of characteristic polynomials: Riemann-Hilbert approach
,”
Commun. Math. Phys.
241
(
2–3
),
343
382
(
2003
).
38.
J.
Baik
,
P.
Deift
, and
E.
Strahov
, “
Products and ratios of characteristic polynomials of random Hermitian matrices
,”
J. Math. Phys.
44
,
3657
3670
(
2003
).
39.
A.
Borodin
and
E.
Strahov
, “
Averages of characteristic polynomials in random matrix theory
,”
Commun. Pure Appl. Math.
59
(
2
),
161
253
(
2006
).
40.
H.
Köesters
, “
On the second-order correlation function of the characteristic polynomial of a real symmetric Wigner matrix
,”
Electron. Commun. Probab.
13
,
435
447
(
2008
).
41.
H.
Köesters
, “
Characteristic polynomials of sample covariance matrices
,”
J. Theor. Probab.
24
,
545
576
(
2011
).
42.
T.
Shcherbina
, “
On the correlation function of the characteristic polynomials of the Hermitian Wigner ensemble
,”
Commun. Math. Phys.
308
,
1
21
(
2011
).
43.
T.
Shcherbina
, “
On the correlation functions of the characteristic polynomials of the Hermitian sample covariance matrices
,”
Probab. Theory Relat. Fields
156
,
449
482
(
2013
).
44.
I.
Afanasiev
, “
On the correlation functions of the characteristic polynomials of the sparse Hermitian random matrices
,”
J. Stat. Phys.
163
(
2
),
324
356
(
2016
).
45.
I.
Afanasiev
, “
On the correlation functions of the characteristic polynomials of real random matrices with independent entries
,”
Z. Mat. Fiz., Anal., Geom.
16
(
2
),
91
118
(
2020
).
46.
D. S.
Dean
and
S. N.
Majumdar
, “
Large deviations of extreme eigenvalues of random matrices
,”
Phys. Rev. Lett.
97
,
160201
(
2006
).
47.
P.
Littelmann
,
H.-J.
Sommers
, and
M. R.
Zirnbauer
, “
Superbosonization of invariant random matrix ensembles
,”
Commun. Math. Phys.
283
(
2
),
343
395
(
2008
).
48.
C.
Andréief
, “
Note sur une relation les intégrales définies des produits des fonctions
,”
Mém. Soc. Sci. Bordeaux
2
(
1
),
1
14
(
1883
).
49.
P. J.
Forrester
,
Log-Gases and Random Matrices
(
Princeton University Press
,
2010
).
50.
The Oxford Handbook of Random Matrix Theory
, edited by
G.
Akemann
,
J.
Baik
, and
P.
Di Francesco
(
Oxford University Press
,
2018
), Vol. 1.
51.
P.
Dita
, “
Parametrisation of unitary matrices
,”
J. Phys. A: Math. Gen.
15
,
3465
3473
(
1982
).