Search arXivSearch

arXiv · 1204.5169

Conductance of Finite Systems and Scaling in Localization Theory

Abstract

The conductance of finite systems plays a central role in the scaling theory of localization (Abrahams et al, 1979). Usually it is defined by the Landauer-type formulas, which remain open the following questions: (a) exclusion of the contact resistance in the many-channel case; (b) correspondence of the Landauer conductance with internal properties of the system; (c) relation with the diffusion coefficient D(ω,q) of an infinite system. The answers to these questions are obtained below in the framework of two approaches: (1) self-consistent theory of localization by Vollhardt and Woelfle, and (2) quantum mechanical analysis based on the shell model. Both approaches lead to the same definition for the conductance of a finite system, closely related to the Thouless definition. In the framework of the self-consistent theory, the relations of finite-size scaling are derived and the Gell-Mann - Low functions β(g) for space dimensions d=1,2,3 are calculated. In contrast to the previous attempt by Vollhardt and Woelfle (1982), the metallic and localized phase are considered from the same standpoint, and the conductance of a finite system has no singularity at the critical point. In the 2D case, the expansion of β(g) in 1/g coincides with results of the σ-model approach on the two-loop level and depends on the renormalization scheme in higher loops; the use of dimensional regularization for transition to dimension d=2+εlooks incompatible with the physical essence of the problem. The obtained results are compared with numerical and physical experiments. A situation in higher dimensions and the conditions for observation of the localization law σ\propto -iωfor conductivity are discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

I. M. Suslov. 2012-04-24. Conductance of Finite Systems and Scaling in Localization Theory. https://doi.org/10.1134/s1063776112110143

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

KEEP EXPLORING

Related papers

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn

Signatures of Nonergodicity in Sparse Random Matrices

The prevalence of sparsity in the Fock space graph of interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically determine the delocalization-localization transition in the ground state as a function of the sparsity. The short-range energy correlation in the bulk indicates that the Anderson transition at infinite temperature occurs at the critical percolation limit of the sparse graph. By analytically deriving the energy moments and calculating the shifted kurtosis, we show that the critical sparsity threshold matches the Anderson transition. Furthermore, long-range energy correlations in the bulk spectrum reveal a Thouless energy scale, suggesting a broad nonergodic regime within the delocalized phase.

cond-mat.dis-nn