Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure

Marta Milewska (Corresponding author), Remco van der Hofstad, Bert Zwart

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

3 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
Artikelnummere21264
Aantal pagina's38
TijdschriftRandom Structures and Algorithms
Volume66
Nummer van het tijdschrift1
DOI's
StatusGepubliceerd - jan. 2025

Bibliografische nota

Publisher Copyright:
© 2024 The Author(s). Random Structures & Algorithms published by Wiley Periodicals LLC.

Vingerafdruk

Duik in de onderzoeksthema's van 'Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure'. Samen vormen ze een unieke vingerafdruk.

Citeer dit