Adapts the Debye volume-to-interface ratio to graphs as twice the total edges divided by sign-change edges to assign effective length scales to Laplacian eigenvectors, producing dispersion relations and densities of states on networks including C. elegans, power grids, and tree graphs with shortcuts
Sciriha, A characterization of singular graphs, El
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.dis-nn 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Effective length scales, dispersion relations, and discrete densities of states for Laplacian eigenvectors on complex networks
Adapts the Debye volume-to-interface ratio to graphs as twice the total edges divided by sign-change edges to assign effective length scales to Laplacian eigenvectors, producing dispersion relations and densities of states on networks including C. elegans, power grids, and tree graphs with shortcuts