Geometrical and spectral study of $\beta$-skeleton graphs

Abstract

We perform an extensive numerical analysis of $\beta$-skeleton graphs, a particular type of proximity graphs. In a $\beta$-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter $\beta \in (0,\infty )$, is satisfied. Moreover, for $\beta >1$ 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 $\beta$, between lune-based and circle-based BSGs. Then, within a random matrix theory (RMT) approach, we explore spectral and eigenvector properties of randomly weighted 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 $\beta =1$.

arXiv comment8 pages, 12 figures

References in corpus (14)

• Spatial Networks
• Scaling theory of the Anderson transition in random graphs: ergodicity and universality
• Fractality of wave functions on a Cayley tree: Difference between a tree and a locally tree-like graph without boundary
• The Influence of Network Topology on Sound Propagation in Granular Materials
• Universality in Complex Networks: Random Matrix Analysis
• Random matrix analysis of complex networks
• Universality in the spectral and eigenfunction properties of random networks
• Localizations on Complex Networks
• Random Rectangular Graphs
• Random matrix analysis of network Laplacians
• Spectral statistics of random geometric graphs
• Spectral analysis of deformed random networks
• Scaling Properties of Multilayer Random Networks
• Multifractality in random networks with power-law decaying bond strengths

Cited by in corpus (6)

• Spacing ratio characterization of the spectra of directed random networks
• Topological versus spectral properties of random geometric graphs
• Eigenvalue ratio statistics of complex networks: Disorder vs. Randomness
• Non-uniform random graphs on the plane: A scaling study
• Random Matrix Analysis of Multiplex Networks
• Statistical properties of mutualistic-competitive random networks