Overview
Auffinger, Ben Arous, and Cerny computed the first moment of the number of critical points in the pure spherical -spin model using Kac-Rice and GOE asymptotics (Auffinger, Ben Arous & Černý, 2013). Subag’s second-moment paper answers the next probabilistic question: in the low-energy band, is this first moment typical or only annealed? For the total number of critical points below level , the answer is typical throughout
(Subag, 2017).
Subag and Zeitouni then study the still finer window around the ground state. After the right logarithmic centering, the near-minimal critical values converge to a Poisson point process with exponential intensity, and the centered ground-state energy converges to a negative Gumbel law (Subag & Zeitouni, 2017). In this sense, the extreme bottom of the pure spherical -spin landscape behaves like the Random Energy Model.
🏷️ Setup and Notation
We use the pure spherical -spin Hamiltonian
with fixed and independent standard Gaussian coefficients . The covariance is
All gradients and Hessians below are intrinsic to the sphere. For a Borel set , write
The first-moment theorem of Auffinger, Ben Arous, and Cerny says
where the zero of occurs at , and the spectral-edge threshold is
The first moment immediately gives absence below : if , then the expected number of critical points below decays exponentially, so Markov’s inequality rules them out with high probability. The hard direction is abundance: if and the mean is exponentially large, is a typical landscape also populated there?
🏷️ Second Moment: What Is Proved
Subag proves that for every
the total low-energy critical-point count satisfies
Therefore
in and hence in probability.
Interpretation
In the band , the annealed total complexity is the typical total complexity. The first-moment exponent from on random matrices and complexity of spin glasses is not a rare-event artifact there.
Subag also proves a weaker but still useful statement for every : the second moment matches the square of the first moment on the exponential scale,
This does not by itself give concentration, but it rules out an exponentially large second-moment gap.
Total count, not fixed index
The theorem above concerns , the total count over all indices. The paper explains how one would add fixed-index restrictions to the two-point Kac-Rice formula, but does not complete that analysis.
🏷️ Pair Kac-Rice and the Overlap Variable
The second moment counts ordered pairs of critical points. The right geometric coordinate for pairs is the overlap
For an overlap set , define the pair count
Then
This is an ordered-pair count; when , diagonal pairs are included, so the displayed identity is literal.
Two-point Kac-Rice expresses this expectation as an integral over . After conditioning on the values and gradients at the two points, the two Hessians become correlated shifted GOE matrices plus low-rank perturbations. Schematically,
where and are correlated GOE matrices.
The first-moment computation only had one shifted GOE determinant. The second moment has a product of two such determinants, and the matrices are correlated when . This is the main new difficulty.
🏷️ Exponential Scale: Why Orthogonality Wins
The two-point Kac-Rice formula leads to a variational upper bound
The function has three conceptual contributions.
- The volume of pairs with overlap gives an entropy term. Most pairs on a high-dimensional sphere are nearly orthogonal, so this term favors .
- The joint Gaussian density of the two energy values gives a quadratic cost depending on .
- The logarithms of the two Hessian determinants become linear statistics of GOE eigenvalues. Their exponential-scale behavior is controlled by the semicircle law and the large deviation principle for empirical eigenvalue measures.
The decisive calculus result is that, in the low-energy range relevant for the second-moment theorem, the supremum is attained at
This says that the dominant contribution to the second moment comes from pairs of critical points with asymptotically zero overlap. Correlated pairs do not create a second-moment explosion.
Proof spine: exponential matching
The determinant term is handled by writing
where is the empirical spectral measure. Since satisfies a large deviation principle at speed , while the complexity problem lives at speed , the main determinant contribution is the semicircle linear statistic at the exponential scale. The paper still has to control truncations and edge-tail events to make the bound uniform. The remaining optimization is over the overlap and the energy values .
🏷️ From Exponential Matching to Matching
Exponential matching is not enough for
It only says the logarithms agree up to .
The final refinement uses two additional facts.
First, energies away from the upper endpoint of the interval are negligible. Since is strictly increasing below , the count below is exponentially dominated by a thin window near .
Second, overlaps outside a small neighborhood of are negligible. The variational analysis gives a strict gap away from , so only nearly orthogonal pairs remain.
Thus the proof reduces to a very local estimate with
where . In this regime the correlated GOE determinant expectation is asymptotically the product of two independent determinant expectations. This proves the full second-moment ratio.
🏷️ Consequence for the Ground State
The first moment already proves that, with high probability, no critical point lies below
Subag’s concentration result proves the complementary abundance statement: for every , with high probability there are critical points below
Therefore the normalized ground-state energy satisfies
almost surely, hence also in probability. This gives a route to the leading ground-state value using critical-point moments, rather than relying on the Parisi formula.
🏷️ Extremal Process: The Scale
Subag and Zeitouni refine the ground-state statement from the scale to the scale. Define
and use the centering
where is an explicit constant.
Let be the set of critical points and set
The factor removes the double counting caused by the antipodal symmetry when is even.
The main theorem is
where convergence is in the vague topology on point processes.
Why this implies a Gumbel law
If is a Poisson point process on with intensity , then
Therefore
converges to a negative Gumbel-type random variable.
Near this extremal scale, all relevant critical points are local minima with high probability. Thus the extremal process can be read as the point process of the deepest minima.
🏷️ Why the Poisson Limit Appears
The proof has two complementary inputs.
The first input is moment control. A sharp first-moment estimate shows that the intensity measure of is asymptotically
The second-moment machinery from Subag controls overlaps between near-extremal critical points, showing that distinct near-ground-state critical points have overlaps tending to .
The second input is a perturbation-invariance argument. Let be an independent copy of the Hamiltonian and consider the slightly perturbed field
As a Gaussian field,
So the extremal process of has the same limiting law as that of , shifted by a deterministic amount.
On the other hand, if the near-extremal critical points are asymptotically orthogonal, then the perturbation values at those points behave asymptotically like independent Gaussians. A local quadratic approximation shows that each near-minimum critical point of moves to a nearby critical point of , and its critical value is shifted by approximately
Thus any subsequential limit of must be invariant under independently shifting its atoms by Gaussian increments, up to a deterministic recentering. Liggett’s characterization and the Choquet-Deny theorem first force such a limit to be a Cox process whose intensity density is almost surely either constant or exponential of slope . The first-moment asymptotics and tightness at the lower tail then identify the non-random intensity as exactly
Proof spine: from moments to Poisson
The moment estimates give tightness and rule out clusters at nonzero overlap. The perturbation argument identifies the only possible subsequential limits. The first moment fixes the intensity. Together these three pieces upgrade low-energy concentration into a full extremal-process theorem.
🏷️ What These Papers Add
The two papers answer different levels of the same question.
| Scale | Result | Method |
|---|---|---|
| Exponential count below | concentrates around its mean for | two-point Kac-Rice, overlap variational problem, GOE determinant asymptotics |
| Ground-state leading order | first moment for absence plus second moment for abundance | |
| Ground-state window | critical values near converge to | sharp first moment, second-moment overlap control, perturbation invariance |
| Minimum fluctuation | has negative Gumbel limit | empty interval probability for the Poisson process |
Conceptually, the first paper says that the annealed complexity is reliable in the low-energy pure model. The second says that at the very bottom the deepest minima behave almost like independent extreme samples.
🔗 See Also
- on random matrices and complexity of spin glasses --- The first-moment Kac-Rice/GOE computation is the input for both Subag’s second-moment theorem and the Subag-Zeitouni extremal-process theorem.
- on Slepian’s lemma and Gaussian comparison --- The perturbation argument uses Gaussian structure and approximate independence at vanishing overlap.
- on Dudley’s Theorem --- Useful background for thinking about Gaussian fields on high-dimensional index sets, though the present results count critical points rather than suprema.
- on Ising models --- Provides the statistical-mechanics contrast between discrete spin systems and the continuous spherical model.