Preferential Attachment Hypergraph with High Modularity - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Network Science Année : 2022

Preferential Attachment Hypergraph with High Modularity

Résumé

Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist and also just a few models allow to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. We present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law and we give theoretical lower bounds for its modularity. We compare its characteristics with a real-life co-authorship network and show that our model achieves good performances. We believe that our hypergraph model will be an interesting tool that may be used in many research domains in order to reflect better real-life phenomena.
Fichier principal
Vignette du fichier
PREFERENTIAL ATTACHMENT HYPERGRAPH WITH HIGH MODULARITY.pdf (852.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04044811 , version 1 (24-03-2023)

Identifiants

Citer

Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, Małgorzata Sulkowska. Preferential Attachment Hypergraph with High Modularity. Network Science, 2022, 10 (4), pp.400-429. ⟨10.1017/nws.2022.35⟩. ⟨hal-04044811⟩
16 Consultations
21 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More