Random walks and community detection in hypergraphs

Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

1 Téléchargements (Pure)

Résumé

We propose a one-parameter family of random walk processes on hypergraphs, where a parameter biases the dynamics of the walker towards hyperedges of low or high cardinality. We show that for each value of the parameter, the resulting process defines its own hypergraph projection on a weighted network. We then explore the differences between them by considering the community structure associated to each random walk process. To do so, we adapt the Markov stability framework to hypergraphs and test it on artificial and real-world hypergraphs.
langue originaleAnglais
Numéro d'article015011
journalJournal of Physics: Complexity
Volume2
Numéro de publication1
Les DOIs
Etat de la publicationPublié - 6 avr. 2021

Empreinte digitale Examiner les sujets de recherche de « Random walks and community detection in hypergraphs ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation