Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • 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
Mapping Higher-Order Network Flows in Memory and Multilayer Networks with Infomap
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.
2017 (English)In: Algorithms, E-ISSN 1999-4893, Vol. 10, no 4, article id 112Article in journal (Refereed) Published
Abstract [en]

Comprehending complex systems by simplifying and highlighting important dynamical patterns requires modeling and mapping higher-order network flows. However, complex systems come in many forms and demand a range of representations, including memory and multilayer networks, which in turn call for versatile community-detection algorithms to reveal important modular regularities in the flows. Here we show that various forms of higher-order network flows can be represented in a unified way with networks that distinguish physical nodes for representing a complex system's objects from state nodes for describing flows between the objects. Moreover, these so-called sparse memory networks allow the information-theoretic community detection method known as the map equation to identify overlapping and nested flow modules in data from a range of different higher-order interactions such as multistep, multi-source, and temporal data. We derive the map equation applied to sparse memory networks and describe its search algorithm Infomap, which can exploit the flexibility of sparse memory networks. Together they provide a general solution to reveal overlapping modular patterns in higher-order flows through complex systems.

Place, publisher, year, edition, pages
2017. Vol. 10, no 4, article id 112
Keywords [en]
community detection, Infomap, higher-order network flows, overlapping communities, multilayer tworks, memory networks
National Category
Computer Sciences Other Physics Topics
Identifiers
URN: urn:nbn:se:umu:diva-144114DOI: 10.3390/a10040112ISI: 000419169400004Scopus ID: 2-s2.0-85038629313OAI: oai:DiVA.org:umu-144114DiVA, id: diva2:1177770
Available from: 2018-01-26 Created: 2018-01-26 Last updated: 2023-03-29Bibliographically approved
In thesis
1. Toward higher-order network models
Open this publication in new window or tab >>Toward higher-order network models
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Complex systems play an essential role in our daily lives. These systems consist of many connected components that interact with each other. Consider, for example, society with billions of collaborating individuals, the stock market with numerous buyers and sellers that trade equities, or communication infrastructures with billions of phones, computers and satellites.

The key to understanding complex systems is to understand the interaction patterns between their components - their networks. To create the network, we need data from the system and a model that organizes the given data in a network representation. Today's increasing availability of data and improved computational capacity for analyzing networks have created great opportunities for the network approach to further prosper. However, increasingly rich data also gives rise to new challenges that question the effectiveness of the conventional approach to modeling data as a network. In this thesis, we explore those challenges and provide methods for simplifying and highlighting important interaction patterns in network models that make use of richer data.

Using data from real-world complex systems, we first show that conventional network modeling can provide valuable insights about the function of the underlying system. To explore the impact of using richer data in the network representation, we then expand the analysis for higher-order models of networks and show why we need to go beyond conventional models when there is data that allows us to do so. In addition, we also present a new framework for higher-order network modeling and analysis. We find that network models that capture richer data can provide more accurate representations of many real-world complex systems.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2018. p. 89
Keywords
network science, complex systems, complex networks, network analysis, higher-order networks, community detection, citation networks, network modeling
National Category
Physical Sciences Other Computer and Information Science
Research subject
Physics
Identifiers
urn:nbn:se:umu:diva-147673 (URN)978-91-7601-892-7 (ISBN)
Public defence
2018-06-08, Sal N420, Naturvetarhuset, Umeå, 13:00 (English)
Opponent
Supervisors
Available from: 2018-05-18 Created: 2018-05-14 Last updated: 2018-06-11Bibliographically approved
2. Mapping incomplete relational data: networks in ecology & evolution
Open this publication in new window or tab >>Mapping incomplete relational data: networks in ecology & evolution
2022 (English)Doctoral thesis, comprehensive summary (Other academic)
Alternative title[sv]
Kartläggning av inkomplett relationell data : nätverk inom ekologi & evolution
Abstract [en]

We live in an interconnected world full of complex systems that cannot be understood simply by analyzing their components. From how genes regulate biological functions to the distribution of life on Earth, we need methods that can analyze systems as a whole.

Networks are abstractions of complex systems, helping capture properties that emerge from patterns of interactions rather than from the individual parts. To understand the patterns of interactions in large networks, we need to simplify them by discovering their modular structure that often characterizes complex systems. A hierarchical modular structure functions as a map that lets us navigate relational data efficiently and helps us see the general patterns. But how reliable is the map if it is based on incomplete data?

This thesis applies and builds upon the map equation, which is an information-theoretic method for detecting modular regularities in the flow patterns on networks. To robustly map incomplete data, we have developed three general approaches: (1) Adaptive resolution in both sampling of and dynamics on networks better fits the data. (2) Regularization avoids overfitting to random patterns. (3) Richer data can be included into the network for a more complete map. Methods that can include evolutionary relationships and handle incomplete data provide more powerful tools for mapping biodiversity in space and time.

Abstract [sv]

Vi lever i en sammankopplad värld full av komplexa system som inte låter sig förstås enbart genom att analysera dess komponenter. Från hur gener reglerar biologiska funktioner till livets utbredning på jorden behöver vi metoder som kan analysera system som en helhet.

Nätverk är abstraktioner av komplexa system som hjälper till att fånga egenskaper som uppstår genom interaktionsmönster snarare än hos de enskilda delarna. För att förstå dessa mönster i stora nätverk måste vi förenkla dem genom att upptäcka dess modulära stuktur som präglar komplexa system. En hierarkisk modulär struktur fungerar som en karta som låter oss navigera effektivt i relationsdata och hjälper oss att se de allmänna mönstren. Men hur tillförlitlig är kartan om den baseras på inkompletta data?

Den här avhandlingen applicerar och bygger vidare på kartekvationen som är en informationsteoretisk metod för att upptäcka modulära regelbundenheter i flödesmönstren på nätverk.För att robust kartlägga inkompletta data har vi utvecklat tre övergripande tillvägagångssätt: (1) Adaptiv upplösning i båda sampling av och dynamik på nätverk ger bättre anpassning till data. (2) Regularisering undviker överanpassning till slumpmässiga mönster. (3) Rikare data kan inkluderas i nätverket för en mer komplett karta. Metoder som kan inkludera evolutionära relationer och hantera inkompletta data ger kraftfullare verktyg för att kartlägga den biologiska mångfalden i rum och tid.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2022. p. 66
Keywords
network science, information theory, map equation, community detection, biogeography, evolution
National Category
Computer Sciences Other Physics Topics Biological Systematics
Identifiers
urn:nbn:se:umu:diva-201176 (URN)978-91-7855-887-2 (ISBN)978-91-7855-888-9 (ISBN)
Public defence
2022-12-19, NAT.D.410, Naturvetarhuset, Umeå, 09:00 (English)
Opponent
Supervisors
Available from: 2022-11-28 Created: 2022-11-22 Last updated: 2022-11-24Bibliographically approved

Open Access in DiVA

fulltext(1411 kB)437 downloads
File information
File name FULLTEXT01.pdfFile size 1411 kBChecksum SHA-512
88a0e2b4627f3f12e7260c510a41e5fc6136a46a884dd2aa12711a0a9e9f3828fe98c7d72b4cd5c806a4d181c7d42d5c1e206241dda128884cd9dcfe4d00d9f1
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Edler, DanielBohlin, LudvigRosvall, Martin

Search in DiVA

By author/editor
Edler, DanielBohlin, LudvigRosvall, Martin
By organisation
Department of Physics
In the same journal
Algorithms
Computer SciencesOther Physics Topics

Search outside of DiVA

GoogleGoogle Scholar
Total: 441 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • 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