How choosing random-walk model and network representation matters for flow-based community detection in hypergraphs
release_hyjou6il2jg7rhv44fxsp4miue
by
Anton Eriksson, Daniel Edler, Alexis Rojas, Manlio de Domenico, Martin Rosvall
Abstract
<jats:title>Abstract</jats:title>Hypergraphs offer an explicit formalism to describe multibody interactions in complex systems. To connect dynamics and function in systems with these higher-order interactions, network scientists have generalised random-walk models to hypergraphs and studied the multibody effects on flow-based centrality measures. Mapping the large-scale structure of those flows requires effective community detection methods applied to cogent network representations. For different hypergraph data and research questions, which combination of random-walk model and network representation is best? We define unipartite, bipartite, and multilayer network representations of hypergraph flows and explore how they and the underlying random-walk model change the number, size, depth, and overlap of identified multilevel communities. These results help researchers choose the appropriate modelling approach when mapping flows on hypergraphs.
In application/xml+jats
format
Archived Files and Locations
application/pdf 1.5 MB
file_6pupe3imezfuxaokqhqk52hlsq
|
www.nature.com (publisher) web.archive.org (webarchive) |
application/pdf 1.5 MB
file_cohikp5hybfgrh66w47oqwzjuu
|
umu.diva-portal.org (web) web.archive.org (webarchive) |
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar