Weighted Spectral Embedding of Graphs - Département Informatique et Réseaux Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Weighted Spectral Embedding of Graphs

Résumé

We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the Laplacian. We prove that these eigenvectors correspond to the configurations of lowest energy of an equivalent physical system, either mechanical or electrical, in which the weight of each node can be interpreted as its mass or its capacitance, respectively. Experiments on a real dataset illustrate the impact of weighting on the embedding.
Fichier principal
Vignette du fichier
arxiv.pdf (278.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01887680 , version 1 (04-10-2018)

Identifiants

  • HAL Id : hal-01887680 , version 1

Citer

Thomas Bonald, Alexandre Hollocou, Marc Lelarge. Weighted Spectral Embedding of Graphs. 56th Annual Allerton Conference on Communication, Control, and Computing, Oct 2018, Urbana-Champaign, United States. ⟨hal-01887680⟩
244 Consultations
645 Téléchargements

Partager

Gmail Facebook X LinkedIn More