Christopher Blöcker

Orcid: 0000-0001-7881-2496

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

2018
Pardis: a process calculus for parallel and distributed programming in Haskell.
J. Supercomput., 2018


  Loading...