2017/07/24 by Timothy La Fond, Geoffrey Sanders, La Fond, Timothy +5
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Computer and information sciences #Machine Learning (cs.LG) #Opinion Dynamics and Social Influence #Peer-to-Peer Network Technologies #Social and Information Networks (cs.SI) #cs.LG #cs.SI
paper · pdf · doi:10.48550/arxiv.1708.08136
6 pages, under submission to HPEC Graph Challenge
arxiv created 2017/07/24 · openalex publication_date 2017/07/24 · arxiv updated 2017/08/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Dynamic networks, especially those representing social networks, undergo constant evolution of their community structure over time. Nodes can migrate between different communities, communities can split into multiple new communities, communities can merge together, etc. In order to represent dynamic networks with evolving communities it is essential to use a dynamic model rather than a static one. Here we use a dynamic stochastic block model where the underlying block model is different at different times. In order to represent the structural changes expressed by this dynamic model the network will be split into discrete time segments and a clustering algorithm will assign block memberships for each segment. In this paper we show that using an ensemble of clustering assignments accommodates for the variance in scalable clustering algorithms and produces superior results in terms of pairwise-precision and pairwise-recall. We also demonstrate that the dynamic clustering produced by the ensemble can be visualized as a flowchart which encapsulates the community evolution succinctly.