Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0307026

Anomalously Localized States in the Anderson Model

V. M. Apalkov·M. E. Raikh·B. Shapiro
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a diffusive conductor the eigenstates are spread over the entire sample. However, with certain probability, an anomalously localized state (ALS) can occur, i.e. the wave function assumes anomalously large values in some region of space. Existing analytical theories of ALS are based on models described by a continuous (Gaussian) random potential. In the present paper we study ALS in a lattice (Anderson) model. We demonstrate that close to the center of the band, E=0, a new type of ALS exist and calculate analytically their likelihood. These ALS are lattice-specific and have no analog in the continuum. Our findings are relevant to numerical simulations, which are necessarily performed on a lattice. We demonstrate that inconsistencies with "continuous" results reported in the previous numerical work on ALS can be explained within our analytical theory. Finally, we point out that, in order to compare the numerics with the "continuous" ALS theories, simulations must be carried out not too far from the band edges, within the band, where the continuous description applies. Simulations performed for $E$ close to the band center reveal lattice-specific ALS that do not exist in continuous models.

Explore related subjects

cond-mat.dis-nncond-mat.mes-hall

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. M. Apalkov, M. E. Raikh, B. Shapiro. 2003-07-01. Anomalously Localized States in the Anderson Model. https://doi.org/10.1103/physrevlett.92.066601

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↗