15 citations · 35 across the 8 of their papers we have counts for
5 papers · 1 filter
Compressing regularized dynamics improves link prediction with the map equation in sparse networks
Maja Lindström, Christopher Blöcker, Tommy Löfstedt +1
Predicting future interactions or novel links in networks is an indispensable tool across diverse domains, including genetic research, online social networks, and recommendation sy…
Flow Divergence: Comparing Maps of Flows with Relative Entropy
Christopher Blöcker, Ingo Scholtes
Networks represent how the entities of a system are connected and can be partitioned differently, prompting ways to compare partitions. Common approaches for comparing network part…
Similarity-based Link Prediction from Modular Compression of Network Flows
Christopher Blöcker, Jelena Smiljanić, Ingo Scholtes +1
Node similarity scores are a foundation for machine learning in graphs for clustering, node classification, anomaly detection, and link prediction with applications in biological s…
Mapping flows on weighted and directed networks with incomplete observations
Jelena Smiljanić, Christopher Blöcker, Daniel Edler +1
Detecting significant community structure in networks with incomplete observations is challenging because the evidence for specific solutions fades away with missing data. For exam…
Mapping Flows on Bipartite Networks
Christopher Blöcker, Martin Rosvall
Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipar…