Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/9704191

Non-Gaussian Non-Hermitean Random Matrix Theory: phase transitions and addition formalism

J. Feinberg·A. Zee
View original source ↗Read source document ↗Export metadata ↓

Abstract

We apply the recently introduced method of hermitization to study in the large $N$ limit non-hermitean random matrices that are drawn from a large class of circularly symmetric non-Gaussian probability distributions, thus extending the recent Gaussian non-hermitean literature. We develop the general formalism for calculating the Green's function and averaged density of eigenvalues, which may be thought of as the non-hermitean analog of the method due to Brèzin, Itzykson, Parisi and Zuber for analyzing hermitean non-Gaussian random matrices. We obtain an explicit algebraic equation for the integrated density of eigenvalues. A somewhat surprising result of that equation is that the shape of the eigenvalue distribution in the complex plane is either a disk or an annulus. As a concrete example, we analyze the quartic ensemble and study the phase transition from a disk shaped eigenvalue distribution to an annular distribution. Finally, we apply the method of hermitization to develop the addition formalism for free non-hermitean random variables. We use this formalism to state and prove a non-abelian non-hermitean version of the central limit theorem.

Explore related subjects

cond-mat.dis-nncond-mat.mes-hallhep-th

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. Feinberg, A. Zee. 1997-07-22. Non-Gaussian Non-Hermitean Random Matrix Theory: phase transitions and addition formalism. https://doi.org/10.1016/s0550-3213(97)00419-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗
arXiv2026

Neural Networks with Exciton-Polariton Waveguides

We propose and numerically study a scheme for neural networks using exciton-polariton waveguide meshes. These enable arbitrary programmable interlayer couplings suited to a restricted Boltzmann machine architecture where polariton phases act as stochastic network variables. We show that such a network can be trained using unsupervised Hebbian and anti-Hebbian updates. This allows the implementation of an associative memory, where the network recovers learned patterns from imperfect inputs.

cond-mat.dis-nn↗
arXiv2026

Finite-width shift of the edge of chaos in deep neural networks

Deep neural networks train best when they are initialised at the edge of chaos, the critical line in the plane of weight and bias variances on which the distance between two inputs neither grows nor shrinks with depth. The line is known for infinitely wide networks; at finite width it moves, and how it moves has been disputed. We treat the logarithm of the distance between two inputs through a network of width $N$ as a random walk and compute its drift and variance to order $1/N$. The edge of chaos moves to a larger weight variance, by $Δσ_w^2=-a_1/(N\,\partial_{σ_w^2}\lnχ_1)$, about $8/N$ for $\tanh$ networks at a bias variance of $0.05$, confirmed by simulations of the exact finite-width recursion. The shift describes a typical network; the average over many networks is dominated by rare networks in which the distance grows, and its critical point moves the other way, which explains why calculations and simulations have disagreed. Backpropagation follows the same random walk, so the shift applies to gradients unchanged. Along the edge of chaos, the information about the similarity of two inputs is constant until the compression over the depth exceeds about one nat, which fixes where to sit on the line. The results give an initialisation rule, Crinit, that places a network on its finite-width edge of chaos without a search. On MNIST and Fashion-MNIST at width $64$ it is more accurate than the standard rules at their usual settings, by a small margin in shallow networks and a large one in deep networks, where most standard rules fail; it trains in fewer steps, and it matches or beats the standard rules with a tuned gain.

cond-mat.dis-nn↗