We present an exact analysis of two conductor-insulator transitions in the random graph model where low connectivity means high impurity concentration. The adjacency matrix of the random graph is used as a hopping Hamiltonian. We compute the height of the delta peak at zero energy in its spectrum exactly and describe analytically the structure and contribution of localized eigenvectors. The system is a conductor for average connectivities between 1.421 529ellipsis and 3.154 985ellipsis but an insulator in the other regimes. We explain the spectral singularity at average connectivity e = 2.718 281ellipsis and relate it to other enumerative problems in random graph theory.
No takes yet. Share an insight, caveat, or question.
Bauer et al. (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: