Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, June 15, 2010 - 12:26:07 AM
Last modification on : Thursday, July 22, 2010 - 4:20:37 PM
Long-term archiving on: : Wednesday, September 15, 2010 - 8:26:15 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads