Exactly solvable model with two conductor-insulator transitions driven by impurities

Abstract

We present an exact analysis of two conductor-insulator transitions in the random graph model. The average connectivity is related to the concentration of impurities. The adjacency matrix of a large random graph is used as a hopping Hamiltonian. Its spectrum has a delta peak at zero energy. Our analysis is based on an explicit expression for the height of this peak, and a detailed description of the localized eigenvectors and of their contribution to the peak. Starting from the low connectivity (high impurity density) regime, one encounters an insulator-conductor transition for average connectivity 1.421529... and a conductor-insulator transition for average connectivity 3.154985.... We explain the spectral singularity at average connectivity e=2.718281... and relate it to another enumerative problem in random graph theory, the minimal vertex cover problem.

4 pages revtex, 2 fig.eps [v2: new title, changed intro, reorganized text]

References in corpus (3)

• The number of guards needed by a museum: A phase transition in vertex covering of random graphs
• On the kernel of tree incidence matrices
• Statistical mechanics perspective on the phase transition in vertex covering finite-connectivity random graphs

Cited by in corpus (15)

• Critical phenomena in complex networks
• Core percolation on complex networks
• Core percolation in random graphs: a critical phenomena analysis
• Minimal vertex covers on finite-connectivity random graphs - a hard-sphere lattice-gas picture
• Covering Problems and Core Percolations on Hypergraphs
• Some applications of the Lambert W function to classical statistical mechanics
• Generalization of core percolation on complex networks
• Statistical mechanics of the vertex-cover problem
• The rank of diluted random graphs
• Clustering analysis of the ground-state structure of the vertex-cover problem
• Core organization of directed complex networks
• Statistics of delta peaks in the spectral density of large random trees
• Solution-space structure of (some) optimization problems
• Quantum local random networks and the statistical robustness of quantum scars
• Control core of undirected complex networks