Clustering of dynamic networks through subgraphs: a study of the Enron scandal

zbMATH Open1381.62203MaRDI QIDQ2803783FDOQ2803783

Rawya Zreik, Pierre Latouche, Charles Bouveyron

Publication date: 2 May 2016

Published in: Journal de la Société Française de Statistique (Search for Journal in Brave)

Full work available at URL: http://journal-sfds.fr/article/view/476/

Recommendations

• The dynamic random subgraph model for the clustering of evolving networks
• The dynamic stochastic topic block model for dynamic networks with textual edges
• Model-based clustering of time-evolving networks through temporal exponential-family random graph models
• scientific article
• Statistical clustering of temporal networks through a dynamic stochastic block model

zbMATH Keywords

state space modelvariational inferencedynamic networkssubgraphsautomatic classificationvariational expectation maximizationrandom subgraph modelEnron data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cited In (3)

• Scan statistics on Enron graphs
• Structure in the Enron email dataset
• Communication networks from the enron email corpus ``It's always about the people. Enron is no different

This page was built for publication: Clustering of dynamic networks through subgraphs: a study of the Enron scandal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803783)