K-Shell Decomposition for Dynamic Complex Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

K-Shell Decomposition for Dynamic Complex Networks


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.
Fichier principal
Vignette du fichier
p499-miorandi.pdf (813.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00492057 , version 1 (15-06-2010)


  • HAL Id : inria-00492057 , version 1


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. ⟨inria-00492057⟩


102 View
2022 Download


Gmail Facebook X LinkedIn More