The spectral degree exponent of a graph

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Achterberg, Massimo A., Van Mieghem, Piet
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913676510887936
author Achterberg, Massimo A.
Van Mieghem, Piet
author_facet Achterberg, Massimo A.
Van Mieghem, Piet
contents We propose the spectral degree exponent as a novel graph metric. Although Hofmeister \cite{HofmeisterThesis} has studied the same metric, we generalise Hofmeister's work to weighted graphs. We provide efficient iterative formulas and bounds for the spectral degree exponent and provide highly accurate asymptotic expansions for the spectral degree exponent for several families of graphs. Furthermore, we uncover a close relation between the spectral degree exponent and the well-known degree assortativity, by showing high correlations between the two metrics in all small graphs, several random graph models and many real-world graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2502_01815
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The spectral degree exponent of a graph
Achterberg, Massimo A.
Van Mieghem, Piet
Combinatorics
We propose the spectral degree exponent as a novel graph metric. Although Hofmeister \cite{HofmeisterThesis} has studied the same metric, we generalise Hofmeister's work to weighted graphs. We provide efficient iterative formulas and bounds for the spectral degree exponent and provide highly accurate asymptotic expansions for the spectral degree exponent for several families of graphs. Furthermore, we uncover a close relation between the spectral degree exponent and the well-known degree assortativity, by showing high correlations between the two metrics in all small graphs, several random graph models and many real-world graphs.
title The spectral degree exponent of a graph
topic Combinatorics
url https://arxiv.org/abs/2502.01815