Optimizing a hierarchical community structure of a complex network

Abstract : Many graph clustering algorithms perform successive divisions or aggregations of subgraphs leading to a hierarchical decomposition of the network. An important question in this domain is to know if this hierarchy reflects the structure of the network or if it is only an artifice due to the conduct of the procedure. We propose a method to validate and, if necessary, to optimize the multi-scale decomposition produced by such methods. We apply our procedure to the algorithm proposed by Blondel et al. (2008) based on modularity maximization. In this context, a generalization of this quality measure in the multi-level case is introduced. We test our method on random graphs and real world examples.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01018834
Contributor : François Queyroi <>
Submitted on : Saturday, July 5, 2014 - 10:25:51 PM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Long-term archiving on : Sunday, October 5, 2014 - 10:48:11 AM

File

queyroi_akdm.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

François Queyroi. Optimizing a hierarchical community structure of a complex network. Advances in Knowledge Discovery and Management, 2014, 4, pp.3-14. ⟨10.1007/978-3-319-02999-3_1⟩. ⟨hal-01018834⟩

Share

Metrics

Record views

242

Files downloads

190