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
Community Detection and Visualization of Networks with the Map Equation Framework
Umeå University, Faculty of Science and Technology, Department of Physics. (Integrated Science Lab)
Umeå University, Faculty of Science and Technology, Department of Physics. (Integrated Science Lab)
Umeå University, Faculty of Science and Technology, Department of Physics. (Integrated Science Lab)
Umeå University, Faculty of Science and Technology, Department of Physics. (Integrated Science Lab)
2014 (English)In: Measuring Scholarly Impact: Methods and Practice / [ed] Ying Ding, Ronald Rousseau, Dietmar Wolfram, Springer, 2014, p. 3-34Chapter in book (Refereed)
Abstract [en]

Large networks contain plentiful information about the organization of a system. The challenge is to extract useful information buried in the structure of myriad nodes and links. Therefore, powerful tools for simplifying and highlighting important structures in networks are essential for comprehending their organization. Such tools are called community-detection methods and they are designed to identify strongly intraconnected modules that often correspond to important functional units. Here we describe one such method, known as the map equation, and its accompanying algorithms for finding, evaluating, and visualizing the modular organization of networks. The map equation framework is very flexible and can identify two-level, multi-level, and overlapping organization in weighted, directed, and multiplex networks with its search algorithm Infomap. Because the map equation framework operates on the flow induced by the links of a network, it naturally captures flow of ideas and citation flow, and is therefore well-suited for analysis of bibliometric networks.

Place, publisher, year, edition, pages
Springer, 2014. p. 3-34
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:umu:diva-128855DOI: 10.1007/978-3-319-10377-8ISBN: 978-3-319-10376-1 (print)ISBN: 978-3-319-10377-8 (electronic)OAI: oai:DiVA.org:umu-128855DiVA, id: diva2:1057098
Available from: 2016-12-16 Created: 2016-12-16 Last updated: 2018-06-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Bohlin, LudvigEdler, DanielLancichinetti, AndreaRosval, Martin

Search in DiVA

By author/editor
Bohlin, LudvigEdler, DanielLancichinetti, AndreaRosval, Martin
By organisation
Department of Physics
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 106 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