Christopher Blöcker

According to our database, Christopher Blöcker authored at least 12 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Hierarchical Graph Pooling Based on Minimum Description Length.

Jan von Pichowski, Christopher Blöcker, Ingo Scholtes

CoRR, 2024

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

Moritz Lampert, Christopher Blöcker, Ingo Scholtes

CoRR, 2024

Flow Divergence: Comparing Maps of Flows with Relative Entropy.

Christopher Blöcker, Ingo Scholtes

CoRR, 2024

2023

The Map Equation Goes Neural.

Christopher Blöcker, Chester Tan, Ingo Scholtes

CoRR, 2023

2022

Through the coding-lens: community detection and beyond.

Christopher Blöcker

PhD thesis, 2022

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

Christopher Blöcker, Juan Carlos Nieves, Martin Rosvall

CoRR, 2022

Map equation centrality: community-aware centrality based on the map equation.

Christopher Blöcker, Juan Carlos Nieves, Martin Rosvall

Appl. Netw. Sci., 2022

Similarity-Based Link Prediction From Modular Compression of Network Flows.

Christopher Blöcker, Jelena Smiljanic, Ingo Scholtes, Martin Rosvall

Proceedings of the Learning on Graphs Conference, 2022

2021

Correction to "Mapping flows on weighted and directed networks with incomplete observations".

Jelena Smiljanic, Christopher Blöcker, Daniel Edler, Martin Rosvall

J. Complex Networks, 2021

Mapping flows on weighted and directed networks with incomplete observations.

Jelena Smiljanic, Christopher Blöcker, Daniel Edler, Martin Rosvall

J. Complex Networks, 2021

2020

Mapping Flows in Bipartite Networks.

Christopher Blöcker, Martin Rosvall

CoRR, 2020

2018

Pardis: a process calculus for parallel and distributed programming in Haskell.

Christopher Blöcker, Ulrich Hoffmann

J. Supercomput., 2018