Peculiar spectral statistics of ensembles of trees and star-like graphs
arXiv:1612.01002 · doi:10.1088/1742-5468/aa7286
Abstract
In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and -branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar ultrametric structure inherent to sparse systems. In particular, the tails of the distribution for binary trees share the "Lifshitz singularity" emerging in the one-dimensional localization, while the spectral statistics of -branching star-like graphs is less universal, being strongly dependent on . The hierarchical structure of spectra of adjacency matrices is interpreted as sets of resonance frequencies, that emerge in ensembles of fully branched tree-like systems, known as dendrimers. However, the relaxational spectrum is not determined by the cluster topology, but has rather the number-theoretic origin, reflecting the peculiarities of the rare-event statistics typical for one-dimensional systems with a quenched structural disorder. The similarity of spectral densities of an individual dendrimer and of ensemble of linear chains with exponential distribution in lengths, demonstrates that dendrimers could be served as simple disorder-less toy models of one-dimensional systems with quenched disorder.
arXiv comment20 pages, 8 figures (text is essentially reworked)
References in corpus (6)
- Level-Spacing Distributions and the Airy Kernel
- Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
- Spectral Analysis of Protein-Protein Interactions in Drosophila melanogaster
- Lifshitz tails for a class of Schrödinger operators with random breather-type potential
- From statistics of regular tree-like graphs to distribution function and gyration radius of branched polymers
- Paths counting on simple graphs: from escape to localization