umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Exploring the solution landscape enables more reliable network community detection
Umeå University, Faculty of Science and Technology, Department of Physics.
Umeå University, Faculty of Science and Technology, Department of Physics.
Umeå University, Faculty of Science and Technology, Department of Physics.ORCID iD: 0000-0002-1063-9102
Show others and affiliations
2019 (English)In: Physical review. E, ISSN 2470-0045, E-ISSN 2470-0053, Vol. 100, no 5, article id 052308Article in journal (Refereed) Published
Abstract [en]

To understand how a complex system is organized and functions, researchers often identify communities in the system's network of interactions. Because it is practically impossible to explore all solutions to guarantee the best one, many community-detection algorithms rely on multiple stochastic searches. But for a given combination of network and stochastic algorithms, how many searches are sufficient to find a solution that is good enough? The standard approach is to pick a reasonably large number of searches and select the network partition with the highest quality or derive a consensus solution based on all network partitions. However, if different partitions have similar qualities such that the solution landscape is degenerate, the single best partition may miss relevant information, and a consensus solution may blur complementary communities. Here we address this degeneracy problem with coarse-grained descriptions of the solution landscape. We cluster network partitions based on their similarity and suggest an approach to determine the minimum number of searches required to describe the solution landscape adequately. To make good use of all partitions, we also propose different ways to explore the solution landscape, including a significance clustering procedure. We test these approaches on synthetic networks and a real-world network using two contrasting community-detection algorithms: The algorithm that can identify more general structures requires more searches, and networks with clearer community structures require fewer searches. We also find that exploring the coarse-grained solution landscape can reveal complementary solutions and enable more reliable community detection.

Place, publisher, year, edition, pages
2019. Vol. 100, no 5, article id 052308
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:umu:diva-166390DOI: 10.1103/PhysRevE.100.052308ISI: 000498061800005OAI: oai:DiVA.org:umu-166390DiVA, id: diva2:1379916
Available from: 2019-12-17 Created: 2019-12-17 Last updated: 2019-12-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Calatayud, JoaquínNeuman, MagnusRojas, AlexisRosvall, Martin

Search in DiVA

By author/editor
Calatayud, JoaquínNeuman, MagnusRojas, AlexisRosvall, Martin
By organisation
Department of Physics
In the same journal
Physical review. E
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 15 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf