5 papers
Estimating Fair Graphs from Graph-Stationary Data
Madeline Navarro, Andrei Buciulea, Samuel Rey +2
We estimate fair graphs from graph-stationary nodal observations such that connections are not biased with respect to sensitive attributes. Edges in real-world graphs often exhibit…
Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery
Victor M. Tenorio, Madeline Navarro, Samuel Rey +2
Graph Neural Networks (GNNs) often struggle with heterophilic data, where connected nodes may have dissimilar labels, as they typically assume homophily and rely on local message p…
A Few Moments Please: Scalable Graphon Learning via Moment Matching
Reza Ramezanpour, Victor M. Tenorio, Antonio G. Marques +2
Graphons, as limit objects of dense graph sequences, play a central role in the statistical analysis of network data. However, existing graphon estimation methods often struggle wi…
Enhancing Graphical Lasso: A Robust Scheme for Non-Stationary Mean Data
Samuel Rey, Ernesto Curbelo, Luca Martino +2
This work addresses the problem of graph learning from data following a Gaussian Graphical Model (GGM) with a time-varying mean. Graphical Lasso (GL), the standard method for estim…
Structure-Guided Input Graph for GNNs facing Heterophily
Victor M. Tenorio, Madeline Navarro, Samuel Rey +2
Graph Neural Networks (GNNs) have emerged as a promising tool to handle data exhibiting an irregular structure. However, most GNN architectures perform well on homophilic datasets,…