Mapping flows on sparse networks with missing links
dc.citation.issue | 1 | |
dc.citation.rank | M21 | |
dc.citation.spage | 012302 | |
dc.citation.volume | 102 | |
dc.contributor.author | Smiljanić, Jelena | |
dc.contributor.author | Edler, Daniel | |
dc.contributor.author | Rosvall, Martin | |
dc.date.accessioned | 2024-06-20T07:37:36Z | |
dc.date.available | 2024-06-20T07:37:36Z | |
dc.date.issued | 2020-07-06 | |
dc.description.abstract | Unreliable network data can cause community-detection methods to overfit and highlight spurious structures with misleading information about the organization and function of complex systems. Here we show how to detect significant flow-based communities in sparse networks with missing links using the map equation. Since the map equation builds on Shannon entropy estimation, it assumes complete data such that analyzing undersampled networks can lead to overfitting. To overcome this problem, we incorporate a Bayesian approach with assumptions about network uncertainties into the map equation framework. Results in both synthetic and real-world networks show that the Bayesian estimate of the map equation provides a principled approach to revealing significant structures in undersampled networks. | |
dc.identifier.doi | 10.1103/physreve.102.012302 | |
dc.identifier.issn | 2470-0045 | |
dc.identifier.issn | 2470-0053 | |
dc.identifier.scopus | 2-s2.0-85089465455 | |
dc.identifier.uri | https://pub.ipb.ac.rs/handle/123456789/125 | |
dc.identifier.wos | 000550381200011 | |
dc.language.iso | en | |
dc.publisher | American Physical Society (APS) | |
dc.relation.ispartof | Physical Review E | |
dc.relation.ispartofabbr | Phys. Rev. E | |
dc.rights | openAccess | |
dc.title | Mapping flows on sparse networks with missing links | |
dc.type | Article | |
dc.type.version | publishedVersion |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- PhysRevE.102.012302.pdf
- Size:
- 947.12 KB
- Format:
- Adobe Portable Document Format
- Description: