The dynamic random subgraph model for the clustering of evolving networks

Abstract : In recent years, many clustering methods have been proposed to extract information from networks. The principle is to look for groups of vertices with homogenous connection profiles. Most of these techniques are suitable for static networks, that is to say, not taking into account the temporal dimension. This work is motivated by the need of analyzing evolving networks where a decomposition of the networks into subgraphs is given. Therefore, in this paper, we consider the random subgraph model (RSM) which was proposed recently to model networks through latent clusters built within known partitions. Using a state space model to characterize the cluster proportions, RSM is then extended in order to deal with dynamic networks. We call the latter the dynamic random subgraph model (dRSM). A variational expectation maximization (VEM) algorithm is proposed to perform inference. We show that the variational approximations lead to an update step which involves a new state space model from which the parameters along with the hidden states can be estimated using the standard Kalman filter and Rauch-Tung-Striebel (RTS) smoother. Simulated data sets are considered to assess the proposed methodology. Finally, dRSM along with the corresponding VEM algorithm are applied to an original maritime network built from printed Lloyd's voyage records.
Type de document :
Article dans une revue
Computational Statistics, Springer Verlag, 2016, <10.1007/s00180-016-0655-5>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01122393
Contributeur : Charles Bouveyron <>
Soumis le : mardi 3 mai 2016 - 10:38:39
Dernière modification le : mardi 11 octobre 2016 - 12:01:28
Document(s) archivé(s) le : mardi 24 mai 2016 - 17:54:07

Fichier

Revision-dRSM.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Rawya Zreik, Pierre Latouche, Charles Bouveyron. The dynamic random subgraph model for the clustering of evolving networks. Computational Statistics, Springer Verlag, 2016, <10.1007/s00180-016-0655-5>. <hal-01122393v3>

Partager

Métriques

Consultations de
la notice

204

Téléchargements du document

101