K-Shell Decomposition for Dynamic Complex Networks

Abstract : Abstract—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [1] as a technique for identifying the most influential spreaders in a complex network. Such techniques apply to static networks, whereby the topology does not change over time. In this paper we address the problem of extending such a framework to dynamic networks, whose evolution over time can be characterized through a pattern of contacts among nodes. We propose two methods for ranking nodes, according to generalized k-shell indexes, and compare their ability to identify the most influential spreaders by emulating the diffusion of epidemics using both synthetic as well as real–world contact traces.
Type de document :
Communication dans un congrès
WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.499-507, 2010
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00492057
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 15 juin 2010 - 00:26:07
Dernière modification le : jeudi 22 juillet 2010 - 16:20:37
Document(s) archivé(s) le : mercredi 15 septembre 2010 - 20:26:15

Fichier

p499-miorandi.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00492057, version 1

Collections

Citation

Daniele Miorandi, Francesco De Pellegrini. K-Shell Decomposition for Dynamic Complex Networks. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.499-507, 2010. 〈inria-00492057〉

Partager

Métriques

Consultations de la notice

126

Téléchargements de fichiers

1327