Martin Rosvall

Orcid: 0000-0002-7181-9940

Affiliations:
  • Umeå University, Sweden


According to our database1, Martin Rosvall authored at least 39 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Module-based regularization improves Gaussian graphical models when observing noisy data.
Appl. Netw. Sci., December, 2024

2023
Mapping change in higher-order networks with multilevel and overlapping communities.
Appl. Netw. Sci., December, 2023

2022
Compressing network populations with modal networks reveals structural diversity.
CoRR, 2022

Map Equation Centrality: A Community-Aware Centrality Score Based on the Map Equation.
CoRR, 2022

Cross-validation of correlation networks using modular structure.
Appl. Netw. Sci., 2022

Map equation centrality: community-aware centrality based on the map equation.
Appl. Netw. Sci., 2022

Similarity-Based Link Prediction From Modular Compression of Network Flows.
Proceedings of the Learning on Graphs Conference, 2022

2021
Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352).
Dagstuhl Reports, 2021

Metadata-informed community detection with lazy encoding using absorbing random walks.
CoRR, 2021

Correction to "Mapping flows on weighted and directed networks with incomplete observations".
J. Complex Networks, 2021

Mapping flows on weighted and directed networks with incomplete observations.
J. Complex Networks, 2021

2020
Mapping Flows in Bipartite Networks.
CoRR, 2020

2019
Exploring the solution landscape enables more reliable network community detection.
CoRR, 2019

2018
Understanding Complex Systems: From Networks to Optimal Higher-Order Models.
CoRR, 2018

2017
Scalable and Efficient Flow-Based Community Detection for Large-Scale Graph Analysis.
ACM Trans. Knowl. Discov. Data, 2017

Different approaches to community detection.
CoRR, 2017

Constrained information flows in temporal networks reveal intermittent communities.
CoRR, 2017

The many facets of community detection in complex networks.
Appl. Netw. Sci., 2017

Mapping Higher-Order Network Flows in Memory and Multilayer Networks with Infomap.
Algorithms, 2017

2016
Robustness of journal rankings by network flows with different amounts of memory.
J. Assoc. Inf. Sci. Technol., 2016

Maps of sparse Markov chains efficiently reveal community structure in network flows with memory.
CoRR, 2016

2015
Modeling sequences and temporal networks with dynamic community structures.
CoRR, 2015

Efficient community detection of network flows for varying Markov times and bipartite networks.
CoRR, 2015

Quantifying national information interests using the activity of Wikipedia editors.
CoRR, 2015

Effect of memory on the dynamics of random walks on networks.
J. Complex Networks, 2015

2014
The map equation and the resolution limit in community detection.
CoRR, 2014

Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems.
CoRR, 2014

2013
Networks with Memory
CoRR, 2013

Dynamics of interacting information waves in networks.
CoRR, 2013

Scalable Flow-Based Community Detection for Large-Scale Network Analysis.
Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

2012
Effect of resampling schemes on significance analysis of clustering and ranking
CoRR, 2012

Comparing network covers using mutual information
CoRR, 2012

2011
Ranking and clustering of nodes in networks with smart teleportation
CoRR, 2011

Significant communities in large sparse networks
CoRR, 2011

Compression of flow can reveal overlapping modular organization in networks
CoRR, 2011

Reinforced communication and social navigation: remember your friends and remember yourself
CoRR, 2011

2010
Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
CoRR, 2010

2009
well-formed.eigenfactor: visualizing information flow in science.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2009

2007
Networks and our Limited Information Horizon.
Int. J. Bifurc. Chaos, 2007


  Loading...