Quantifying social group evolution
Gergely Palla, Albert-Laszlo Barabasi, Tamas Vicsek

TL;DR
This paper introduces a novel clique percolation algorithm to analyze the evolution of overlapping communities in social networks, revealing how group size influences stability and adaptability over time.
Contribution
The paper presents a new algorithm for studying community dynamics over time, providing insights into the stability and adaptability of social groups based on their size.
Findings
Large groups tend to persist longer if they can change membership.
Small groups are more stable when their composition remains fixed.
Community lifetime can be estimated from members' time commitment.
Abstract
The rich set of interactions between individuals in the society results in complex community structure, capturing highly connected circles of friends, families, or professional cliques in a social network. Thanks to frequent changes in the activity and communication patterns of individuals, the associated social and communication network is subject to constant evolution. Our knowledge of the mechanisms governing the underlying community dynamics is limited, but is essential for a deeper understanding of the development and self-optimisation of the society as a whole. We have developed a new algorithm based on clique percolation, that allows, for the first time, to investigate the time dependence of overlapping communities on a large scale and as such, to uncover basic relationships characterising community evolution. Our focus is on networks capturing the collaboration between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
