Author
Carletti, T
Fanelli, D
Lambiotte, R
Journal title
Journal of Physics: Complexity
DOI
10.1088/2632-072X/abe27e
Volume
abs/2010.14355
Last updated
2022-08-05T11:52:20.03+01:00
Abstract
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 generalise the Markov
stability framework to hypergraphs and test it on artificial and real-world
hypergraphs.
Symplectic ID
1140902
Favourite
Off
Publication type
Journal Article
Publication date
12 Apr 2021
Please contact us for feedback and comments about this page. Created on 07 Nov 2020 - 03:15.