TY - JOUR
T1 - Dynamic Random Intersection Graph
T2 - Dynamic Local Convergence and Giant Structure
AU - Milewska, Marta
AU - van der Hofstad, Remco
AU - Zwart, Bert
N1 - Publisher Copyright:
© 2024 The Author(s). Random Structures & Algorithms published by Wiley Periodicals LLC.
PY - 2025/1
Y1 - 2025/1
N2 - Random intersection graphs containing an underlying community structure are a popular choice for modeling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when they share at least one group. We extend this approach and make the communities dynamic by letting them alternate between an active and inactive phase. We analyse the new model, delivering results on degree distribution, local convergence, largest connected component, and maximum group size, paying particular attention to the dynamic description of these properties. We also describe the connection between our model and the bipartite configuration model, which is of independent interest.
AB - Random intersection graphs containing an underlying community structure are a popular choice for modeling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when they share at least one group. We extend this approach and make the communities dynamic by letting them alternate between an active and inactive phase. We analyse the new model, delivering results on degree distribution, local convergence, largest connected component, and maximum group size, paying particular attention to the dynamic description of these properties. We also describe the connection between our model and the bipartite configuration model, which is of independent interest.
KW - bipartite generalized random graph
KW - dynamic largest connected component process
KW - dynamic local convergence
KW - random intersection graphs
UR - http://www.scopus.com/inward/record.url?scp=85206916165&partnerID=8YFLogxK
U2 - 10.1002/rsa.21264
DO - 10.1002/rsa.21264
M3 - Article
AN - SCOPUS:85206916165
SN - 1042-9832
VL - 66
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 1
M1 - e21264
ER -