Geometrical and spectral study of -skeleton graphs
Phys. Rev. E 100, 062309 – Published 19 December, 2019
DOI: https://doi.org/10.1103/PhysRevE.100.062309
Abstract
We perform an extensive numerical analysis of -skeleton graphs, a particular type of proximity graphs. In a -skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter , is satisfied. Moreover, for there exist two different proximity rules, leading to lune-based and circle-based BSGs. First, by computing the average degree of large ensembles of BSGs we detect differences, which increase with the increase of , between lune-based and circle-based BSGs. Then, within a random matrix theory (RMT) approach, we explore spectral and eigenvector properties of random BSGs by the use of the nearest-neighbor energy-level spacing distribution and the entropic eigenvector localization length, respectively. The RMT analysis allows us to conclude that a localization transition occurs at .