2 citations · 2 across the 7 of their papers we have counts for
7 papers
The geometry of magnitude for finite metric spaces
Karel Devriendt
The main result of this article is a geometric interpretation of magnitude, a real-valued invariant of metric spaces. We introduce a Euclidean embedding of a (suitable) finite metr…
Demystifying Topological Message-Passing with Relational Structures: A Case Study on Oversquashing in Simplicial Message-Passing
Diaaeldin Taha, James Chapman, Marzieh Eidi +2
Topological deep learning (TDL) has emerged as a powerful tool for modeling higher-order interactions in relational data. However, phenomena such as oversquashing in topological me…
Graphs with nonnegative resistance curvature
Karel Devriendt
This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning tre…
Kemeny's constant and the Lemoine point of a simplex
Karel Devriendt
Kemeny's constant is an invariant of discrete-time Markov chains, equal to the expected number of steps between two states sampled from the stationary distribution. It appears in a…
Pearson Correlations on Networks: Corrigendum
Michele Coscia, Karel Devriendt
Recently, the first author proposed a measure to calculate Pearson correlations for node values expressed in a network, by taking into account distances or metrics defined on the n…
Exploring the space of graphs with fixed discrete curvatures
Michelle Roost, Karel Devriendt, Giulio Zucal +1
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and th…
Fast Node Vector Distance Computations using Laplacian Solvers
Michele Coscia, Karel Devriendt
Complex networks are a useful tool to investigate various phenomena in social science, economics, and logistics. Node Vector Distance (NVD) is an emerging set of techniques allowin…