165 citations · 244 across the 23 of their papers we have counts for
3 papers · 1 filter
Spectral embedding for dynamic networks with stability guarantees
Ian Gallagher, Andrew Jones, Patrick Rubin-Delanchy
We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe changes in behaviour of indi…
Matrix factorisation and the interpretation of geodesic distance
Nick Whiteley, Annie Gray, Patrick Rubin-Delanchy
Given a graph or similarity matrix, we consider the problem of recovering a notion of true distance between the nodes, and so their true positions. We show that this can be accompl…
Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
Alexander Modell, Patrick Rubin-Delanchy
This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. Under a generalised r…