T-6: Difference between revisions

From Disordered Systems Wiki
Jump to navigation Jump to search
No edit summary
Line 32: Line 32:
</math>
</math>
</center>
</center>
where <math>\rho_{N}(\lambda)</math> is the empirical eigenvalue density. It can be shown that if <math> M </math> is a GOE matrix, the distribution of the empirical density has a large deviation form (recall TD1) with speed <math> N^2 </math>, meaning that <math> P_N[\rho] = e^{-N^2 \, g[\rho]} </math> where now <math> g[\cdot] </math> is a functional (a function of a function). Using a saddle point argument, show that this implies  
where <math>\rho_{N}(\lambda)</math> is the empirical eigenvalue density. It can be shown that if <math> M </math> is a GOE matrix, the distribution of the empirical density has a large deviation form (recall TD1) with speed <math> N^2 </math>, meaning that <math> P_N[\rho] = e^{-N^2 \, g[\rho]} </math> where now <math> g[\cdot] </math> is a functional. Using a saddle point argument, show that this implies  
<center>
<center>
<math>
<math>

Revision as of 19:07, 6 March 2024

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


Problems

Problem 6: the Hessian and random matrix theory

To get the complexity, 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.


  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 P(M)=ZN1eN4σ2TrM2. 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λρN(λ)log|λpϵ|)],ρN(λ)=1N1α=1N1δ(λλα)

    where ρN(λ) is the empirical eigenvalue density. It can be shown that if M is a GOE matrix, the distribution of the empirical density has a large deviation form (recall TD1) 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λρN(λ)log|λpϵ|)]=exp[N(dλρtyp(λ+pϵ)log|λ|)+o(N)]

    where ρtyp(λ) is the typical value of the eigenvalue density, which satisfies g[ρtyp]=0.



  1. The semicircle and the complexity. The eigenvalue density of GOE matrices is self-averaging, and it equals to

    limNρN(λ)=limNρN(λ)=ρtyp(λ)=12πσ24σ2λ2

    • Check this numerically: generate matrices for various values of N, 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?
    • 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 ρtyp(λ+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.