research29 min studyLesson 851 in Mathematics

Wigner ensembles and moment expansions

Track variance normalization and closed-walk contributions before taking a spectral limit.

On this page

What you’ll understand

  • Specify independent-entry and variance assumptions for a normalized Wigner ensemble.
  • Expand empirical spectral moments as closed index walks.
  • Separate leading Catalan contributions from finite-dimensional corrections.

Random matrix theory studies how many dependent eigenvalues emerge from relatively simple random entries. The normalization is essential: order-one entries usually produce eigenvalues of order the square root of dimension. Dividing entries by that scale gives a nontrivial limiting spectrum. The moment method then turns a spectral question into a combinatorial count, while making clear which independence and moment assumptions the count uses.

Choose an ensemble and its normalization

Begin with a real symmetric matrix HN=N−1/2(ξij)H_N=N^{-1/2}(\xi_{ij}). The entries strictly above the diagonal are independent copies of one fixed centered real variable of variance one, and the lower entries are obtained by symmetry. Assume all absolute moments of that variable are finite for the moment arguments here. Let the diagonal variables be independent of those entries and of one another, centered, with a fixed distribution having finite moments. They may have a different variance. Independence is required only among the genuinely free coordinates, not between reflected entries.

The empirical spectral measure assigns mass one over dimension to every eigenvalue, counted with multiplicity. Its moments equal normalized traces of matrix powers by the spectral theorem. The second moment is order one under the stated entry variance, explaining the square-root normalization. A diagonal variance of two, as in the normalized Gaussian orthogonal ensemble, changes finite corrections without changing the leading global limit. Complex Hermitian Wigner matrices require conjugate symmetry and variance specified as an absolute square; their real and imaginary coordinate variances must not both be mistaken for the full complex variance.

μN=1N∑j=1Nδλj(HN),∫xk dμN(x)=1NTr⁡HNk=1N1+k/2∑i1,…,ikξi1i2⋯ξiki1.\mu_N=\frac1N\sum_{j=1}^N\delta_{\lambda_j(H_N)},\qquad \int x^k\,d\mu_N(x)=\frac1N\operatorname{Tr}H_N^k=\frac1{N^{1+k/2}}\sum_{i_1,\ldots,i_k}\xi_{i_1i_2}\cdots\xi_{i_ki_1}.
The final index returns to the first, so each trace term is a closed walk through matrix indices.↔ Scroll wide equations horizontally.

Centering eliminates singly used edges

Represent an index tuple by a closed walk whose vertices are the distinct indices and whose edges are the unordered entry locations it uses. If an edge occurs exactly once, independence and centering force that term’s expectation to vanish. A surviving term uses every edge at least twice. For a fixed walk length, its number of distinct vertices determines how many index assignments it can have, while the normalization penalizes excessive repetitions. Finite moments bound the weights of the remaining patterns.

For an even length, the leading patterns have a tree of distinct vertices and use every tree edge exactly twice. Their ordered traversal patterns are counted by Catalan numbers. Odd lengths have no comparable leading contribution and their normalized expected moments vanish. To turn expected moment convergence into convergence of a random spectral measure, one also controls fluctuations and verifies that the limiting moments determine a unique measure. Counting a few expectations alone does not establish an almost-sure spectral theorem or a local eigenvalue statistic.

lim⁡N→∞E ⁣[1NTr⁡HN2r]=Cr=1r+1(2rr),lim⁡N→∞E ⁣[1NTr⁡HN2r+1]=0.\lim_{N\to\infty}\mathbb E\!\left[\frac1N\operatorname{Tr}H_N^{2r}\right]=C_r=\frac1{r+1}\binom{2r}{r},\qquad \lim_{N\to\infty}\mathbb E\!\left[\frac1N\operatorname{Tr}H_N^{2r+1}\right]=0.
For fixed r, the finite-entry-moment assumptions above justify the expansion; C0 is one and C1, C2, C3 are one, two, five.↔ Scroll wide equations horizontally.

Finite corrections remember the entry distribution

Leading moments may agree for Gaussian, bounded, or other suitably integrable entries, but exact finite expectations need not. A four-step walk that repeatedly traverses the same edge depends on the fourth entry moment. Its contribution is lower order than the leading tree terms but can be substantial for a small matrix. Diagonal loops create additional corrections. Universality of a limiting global measure therefore does not mean that all finite ensembles have identical eigenvalue distributions or identical low-dimensional moments.

Independence is equally important. A matrix with all entries equal can have the same normalized second trace moment as a Wigner matrix while concentrating its spectrum into one exceptional eigenvalue. Its fourth moment reveals the difference. Likewise, finite variance is enough for some global-law theorems, but the elementary high-order moment proof presented here deliberately assumes more moments. A proof’s sufficient assumptions should not be confused with the weakest possible assumptions known for a different method.

A finite fourth moment with random signs

Take a four-by-four real symmetric matrix with zero diagonal and independent off-diagonal signs, each divided by two. Compute its expected normalized second and fourth trace moments.

  1. For general dimension NN in this zero-diagonal sign model, the second moment is (N−1)/N(N-1)/N: there are N(N−1)N(N-1) directed off-diagonal terms, each with squared magnitude 1/N1/N, followed by division by NN. At four this gives 3/43/4.

  2. Four-step surviving walks either use two distinct edges twice, in two traversal patterns with N(N−1)(N−2)N(N-1)(N-2) labelings each, or repeat one edge four times with N(N−1)N(N-1) labelings. Every surviving sign product has expectation one.

  3. Divide the total 2N(N−1)(N−2)+N(N−1)2N(N-1)(N-2)+N(N-1) by N3N^3. The result is (N−1)(2N−3)/N2(N-1)(2N-3)/N^2, equal to 15/1615/16 at dimension four. Its large-dimension limit is two, but the finite value is markedly different.

The result

The finite expected moments are three quarters and fifteen sixteenths, rather than the limiting semicircle values one and two.

Explore the model

Interactive lab

Interactive lab · matrix

Compute a finite spectral moment

Pause/Reset, set diagonal scale 1 and shear 0. The two eigenvalues are 1 and 1, so predict normalized second moment 1. For a fresh comparison Pause/Reset, set both scale 2 and shear 0; eigenvalues 2 and 1 give normalized second moment 2.5. The singular-value readouts describe the selected final matrix during playback.

Compute a finite spectral momentThe selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Current readings: Area scale · det A: 1.4; Singular values · σmax, σmin: 1.597, 0.876; Condition number · κ₂(A): 1.823. All parameters are adjustable with the labeled controls below.Matrix A with first row 1.4, 0.6 and second row zero, one; display interpolates between identity and A while final determinant remains 1.4.−4−2024−2−1012x · equal geometric scaleyA = [ 1.4 0.6 ; 0 1 ]Display blend: 0% · final values below
Interpolated geometryOriginal unit squareSelected final transform
Area scale · det A
1.4
Singular values · σmax, σmin
1.597, 0.876
Condition number · κ₂(A)
1.823
t = 0 s

The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forA spectral moment is an average over eigenvalue powers. This deterministic diagonal family demonstrates the calculation, not a random Wigner ensemble or its limiting law.

Check your understanding

Why does a centered independent-entry trace expansion discard a walk using an off-diagonal edge exactly once?

Try it yourself

Let J be the four-by-four all-ones matrix and set H equal to J divided by two. Calculate its normalized second and fourth trace moments. Explain why its second moment does not make it a Wigner example.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

J has one eigenvalue four and three zero eigenvalues. Compare the two moments separately.

Compare with the solution

The eigenvalues of HH are 2,0,0,02,0,0,0. Thus Tr⁡(H2)/4=1\operatorname{Tr}(H^2)/4=1, while Tr⁡(H4)/4=4\operatorname{Tr}(H^4)/4=4. Matching the limiting Wigner second moment does not force the fourth moment to match two. The entries here are deterministic, noncentered, and completely aligned rather than independent centered free coordinates. The example shows why a variance-scale check is necessary but not sufficient to justify a random-matrix limit.

Take it with you

  • Specify entry independence, centering, moments, and square-root dimension scaling.
  • Trace moments count closed walks, with leading doubled-tree patterns producing Catalan numbers.
  • Finite moment corrections and strongly correlated entries can differ sharply from a universal global limit.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.