Picture for Patrick Rubin-Delanchy

Patrick Rubin-Delanchy

Valid Conformal Prediction for Dynamic GNNs

May 29, 2024
Viaarxiv icon

A Simple and Powerful Framework for Stable Dynamic Network Embedding

Add code
Nov 14, 2023
Viaarxiv icon

Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks

Add code
Jun 09, 2023
Figure 1 for Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks
Figure 2 for Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks
Figure 3 for Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks
Figure 4 for Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks
Viaarxiv icon

Hierarchical clustering with dot products recovers hidden tree structure

Add code
May 24, 2023
Figure 1 for Hierarchical clustering with dot products recovers hidden tree structure
Figure 2 for Hierarchical clustering with dot products recovers hidden tree structure
Figure 3 for Hierarchical clustering with dot products recovers hidden tree structure
Figure 4 for Hierarchical clustering with dot products recovers hidden tree structure
Viaarxiv icon

Implications of sparsity and high triangle density for graph representation learning

Oct 27, 2022
Figure 1 for Implications of sparsity and high triangle density for graph representation learning
Figure 2 for Implications of sparsity and high triangle density for graph representation learning
Figure 3 for Implications of sparsity and high triangle density for graph representation learning
Figure 4 for Implications of sparsity and high triangle density for graph representation learning
Viaarxiv icon

Spectral embedding and the latent geometry of multipartite networks

Add code
Feb 08, 2022
Figure 1 for Spectral embedding and the latent geometry of multipartite networks
Figure 2 for Spectral embedding and the latent geometry of multipartite networks
Figure 3 for Spectral embedding and the latent geometry of multipartite networks
Viaarxiv icon

Spectral embedding for dynamic networks with stability guarantees

Add code
Jun 02, 2021
Figure 1 for Spectral embedding for dynamic networks with stability guarantees
Figure 2 for Spectral embedding for dynamic networks with stability guarantees
Figure 3 for Spectral embedding for dynamic networks with stability guarantees
Figure 4 for Spectral embedding for dynamic networks with stability guarantees
Viaarxiv icon

Matrix factorisation and the interpretation of geodesic distance

Add code
Jun 02, 2021
Figure 1 for Matrix factorisation and the interpretation of geodesic distance
Figure 2 for Matrix factorisation and the interpretation of geodesic distance
Figure 3 for Matrix factorisation and the interpretation of geodesic distance
Figure 4 for Matrix factorisation and the interpretation of geodesic distance
Viaarxiv icon

Spectral clustering under degree heterogeneity: a case for the random walk Laplacian

Add code
May 04, 2021
Figure 1 for Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
Figure 2 for Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
Figure 3 for Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
Figure 4 for Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
Viaarxiv icon

Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel

Add code
Nov 09, 2020
Figure 1 for Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel
Figure 2 for Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel
Figure 3 for Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel
Figure 4 for Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel
Viaarxiv icon