2000 character limit reached
Localized and delocalized modes on random geometric graphs in 1D
Published 26 Aug 2025 in cond-mat.dis-nn and cond-mat.stat-mech | (2508.18936v1)
Abstract: We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the participation ratio and its relation to the eigenvalue. By disentangling the influence of system size, graph component size distribution, mean degree of nodes, network motifs, and degeneracy, we provide a comprehensive understanding of this system. We compare our findings to ordered graphs with the same mean degree and to one-dimensional tight-binding models.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.