Christopher Blöcker

Orcid: 0000-0001-7881-2496

Affiliations:
  • University of Umeå, Sweden


According to our database1, Christopher Blöcker authored at least 18 papers between 2017 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Community Detection with the Map Equation and Infomap: Theory and Applications.
ACM Comput. Surv., May, 2026

The Role of Node Features in Graph Pooling.
CoRR, May, 2026

From Link Prediction to Forecasting: Addressing Challenges in Batch-based Temporal Graph Learning.
Trans. Mach. Learn. Res., 2026

2025
Insights from Network Science can advance Deep Graph Learning.
CoRR, February, 2025

2024
Compressing regularised dynamics improves link prediction in sparse networks.
CoRR, 2024

Hierarchical Graph Pooling Based on Minimum Description Length.
CoRR, 2024

From Link Prediction to Forecasting: Information Loss in Batch-based Temporal Graph Learning.
CoRR, 2024

Flow Divergence: Comparing Maps of Flows with Relative Entropy.
CoRR, 2024

The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
The Map Equation Goes Neural.
CoRR, 2023

2022
Through the coding-lens: community detection and beyond.
PhD thesis, 2022

Map Equation Centrality: A Community-Aware Centrality Score Based on the Map Equation.
CoRR, 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
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

2017
Pardis: A Process Calculus for Parallel and Distributed Programming in Haskell.
Proceedings of the Parallel Processing and Applied Mathematics, 2017


  Loading...