50 citations · 83 across the 11 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2024
Graphlets correct for the topological information missed by random walks
Sam F. L. Windels, Noel Malod-Dognin, Natasa Przulj
Random walks are widely used for mining networks due to the computational efficiency of computing them. For instance, graph representation learning learns a d-dimensional embedding…
cs.SI2016★ 1 cited
Predictive Functional Connectivity of Real-World Systems
Anida Sarajlić, Noël Malod-Dognin, Ömer Nebil Yaveroğlu +1
We are flooded with large-scale dynamic networked data. Analyses requiring exact comparisons between networks are computationally intractable, so new methodologies are sought. We e…