Degree and Principal Eigenvectors in Complex Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Degree and Principal Eigenvectors in Complex Networks

Résumé

The largest eigenvalue λ1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the principal eigenvector corresponding to the largest eigenvalue λ1. This motivates us to investigate properties of the principal eigenvector x1 and its relation with the degree vector. (a) We illustrate and explain why the average E[x1] decreases with the linear degree correlation coefficient ρD in a network with a given degree vector; (b) The difference between the principal eigenvector and the scaled degree vector is proved to be the smallest, when $\lambda _{1}=\frac{N_{2}}{N_{1}}$, where Nk is the total number walks in the network with k hops; (c) The correlation between the principal eigenvector and the degree vector decreases when the degree correlation ρD is decreased.
Fichier principal
Vignette du fichier
978-3-642-30045-5_12_Chapter.pdf (719.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01531136 , version 1 (01-06-2017)

Licence

Paternité

Identifiants

Citer

Cong Li, Huijuan Wang, Piet Van Mieghem. Degree and Principal Eigenvectors in Complex Networks. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.149-160, ⟨10.1007/978-3-642-30045-5_12⟩. ⟨hal-01531136⟩
50 Consultations
109 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More