165 citations · 244 across the 23 of their papers we have counts for
3 papers · 1 filter
Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel
Francesco Sanna Passino, Nicholas A. Heard, Patrick Rubin-Delanchy
Spectral clustering is a popular method for community detection in network graphs: starting from a matrix representation of the graph, the nodes are clustered on a low dimensional…
The multilayer random dot product graph
Andrew Jones, Patrick Rubin-Delanchy
We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- wh…
Manifold structure in graph embeddings
Patrick Rubin-Delanchy
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision i…