T-6: Difference between revisions

From Disordered Systems Wiki
Jump to navigation Jump to search
Line 43: Line 43:
<!--<li>Check this numerically: generate matrices for various values of <math> N </math>, plot their empirical eigenvalue density and compare with the asymptotic curve. Is the convergence faster in the bulk, or in the edges of the eigenvalue density, where it vanishes?  </li>-->
<!--<li>Check this numerically: generate matrices for various values of <math> N </math>, plot their empirical eigenvalue density and compare with the asymptotic curve. Is the convergence faster in the bulk, or in the edges of the eigenvalue density, where it vanishes?  </li>-->


<li> Combining all the results, show that the annealed complexity is
Combining all the results, show that the annealed complexity is
<math display="block">
<math display="block">
\Sigma_{\text{a}}(\epsilon)= \frac{1}{2}\log [4 e (p-1)]- \frac{\epsilon^2}{2}+ I_p(\epsilon), \quad \quad  I_p(\epsilon)= \frac{2}{\pi}\int d x \sqrt{1-\left(x- \frac{\epsilon}{ \epsilon_{\text{th}}}\right)^2}\, \log |x| , \quad \quad  \epsilon_{\text{th}}= -2\sqrt{\frac{p-1}{p}}.
\Sigma_{\text{a}}(\epsilon)= \frac{1}{2}\log [4 e (p-1)]- \frac{\epsilon^2}{2}+ I_p(\epsilon), \quad \quad  I_p(\epsilon)= \frac{2}{\pi}\int d x \sqrt{1-\left(x- \frac{\epsilon}{ \epsilon_{\text{th}}}\right)^2}\, \log |x| , \quad \quad  \epsilon_{\text{th}}= -2\sqrt{\frac{p-1}{p}}.
Line 56: Line 56:
</math>  
</math>  
Plot the annealed complexity, and determine numerically where it vanishes: why is this a lower bound or the ground state energy density?
Plot the annealed complexity, and determine numerically where it vanishes: why is this a lower bound or the ground state energy density?
</li>
</ul>
</ul>
</ol>
</ol>

Revision as of 20:00, 14 February 2026

Goal: Complete the characterisation of the energy landscape of the spherical p-spin.
Techniques: saddle point, random matrix theory.


Problems

Problem 6: the Hessian at the stationary points, and random matrix theory

This is a continuation of problem 5. To get the complexity of the spherical p-spin, it remains to compute the expectation value of the determinant of the Hessian matrix: this is the goal of this problem. We will do this exploiting results from random matrix theory discussion in the Tutorial and Exercise 4 .


  1. Gaussian Random matrices. Show that the matrix M is a GOE matrix, i.e. a matrix taken from the Gaussian Orthogonal Ensemble, meaning that it is a symmetric matrix with distribution PN(M)=ZN1exp(N4σ2TrM2) where ZN is a normalization. What is the value of σ2?


  1. Eigenvalue density and concentration. Let λα be the eigenvalues of the matrix M. Show that the following identity holds: 𝔼[|det(Mpϵ𝕀)|]=𝔼[exp((N1)dλρN1(λ)log|λpϵ|)],ρN1(λ)=1N1α=1N1δ(λλα) where ρN1(λ) is the empirical eigenvalue distribution. It can be shown that if M is a GOE matrix, the distribution of the empirical distribution has a large deviation form with speed N2, meaning that PN[ρ]=eN2g[ρ] where now g[] is a functional. Using a saddle point argument, show that this implies 𝔼[exp((N1)dλρN1(λ)log|λpϵ|)]=exp[Ndλρ(λ+pϵ)log|λ|+o(N)] where ρ(λ) is the typical value of the eigenvalue density, which satisfies g[ρ]=0.


  1. The semicircle and the complexity. The eigenvalue density of GOE matrices is self-averaging, and it equals to limNρN(λ)=limN𝔼[ρN(λ)]=ρ(λ)=12πσ24σ2λ2
      Combining all the results, show that the annealed complexity is Σa(ϵ)=12log[4e(p1)]ϵ22+Ip(ϵ),Ip(ϵ)=2πdx1(xϵϵth)2log|x|,ϵth=2p1p. The integral Ip(ϵ) can be computed explicitly, and one finds: Ip(ϵ)={ϵ2ϵth212ϵϵthϵ2ϵth21+log(ϵϵth+ϵ2ϵth21)log2ifϵϵthϵ2ϵth212log2ifϵ>ϵth Plot the annealed complexity, and determine numerically where it vanishes: why is this a lower bound or the ground state energy density?


  1. The threshold and the stability. Sketch ρ(λ+pϵ) for different values of ϵ; recalling that the Hessian encodes for the stability of the stationary points, show that there is a transition in the stability of the stationary points at the critical value of the energy density ϵth=2(p1)/p. When are the critical points stable local minima? When are they saddles? Why the stationary points at ϵ=ϵth are called marginally stable ?


Check out: key concepts

Metastable states, Hessian matrices, random matrix theory, landscape’s complexity.