Recovering Communities in Temporal Networks Using Persistent Edges - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Recovering Communities in Temporal Networks Using Persistent Edges

Maximilien Dreveton
  • Function : Author
  • PersonId : 1119825
Lasse Leskelä
  • Function : Author
  • PersonId : 1119826


This article studies the recovery of static communities in a temporal network. We introduce a temporal stochastic block model where dynamic interaction patterns between node pairs follow a Markov chain. We render this model versatile by adding degree correction parameters, describing the tendency of each node to start new interactions. We show that in some cases the likelihood of this model is approximated by the regularized modularity of a time-aggregated graph. This time aggregated graph involves a trade-off between new edges and persistent edges. A continuous relaxation reduces the regularized modularity maximization to a normalized spectral clustering. We illustrate by numerical experiments the importance of edge persistence, both on simulated and real data sets.
Fichier principal
Vignette du fichier
CSoNet2021authorversion.pdf (471.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03472963 , version 1 (09-12-2021)



Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä. Recovering Communities in Temporal Networks Using Persistent Edges. CSoNet 2021 - International Conference on Computational Data and Social Networks, Nov 2021, Montreal, Canada. pp.243-254, ⟨10.1007/978-3-030-91434-9_22⟩. ⟨hal-03472963⟩
66 View
171 Download



Gmail Mastodon Facebook X LinkedIn More