Showing cs.SIShow all
3 papers · 1 filter
cs.SI2024
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…
cs.SI2024
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…
cs.SI2020
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…