13 citations · 14 across the 16 of their papers we have counts for
11 papers · 1 filter
Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals
Andrei Buciulea, Elvin Isufi, Geert Leus +1
Graphs are a fundamental tool for modeling the irregular (non-Euclidean) structure of complex data. However, they are inherently limited to representing pairwise relationships, mak…
Stationarity and Spectral Characterization of Random Signals on Simplicial Complexes
Madeline Navarro, Andrei Buciulea, Santiago Segarra +1
It is increasingly common for data to possess intricate structure, necessitating new models and analytical tools. Graphs, a prominent type of structure, can encode the relationship…
Learning Product Graphs from Two-dimensional Stationary Signals
Andrei Buciulea, Bishwadeep Das, Elvin Isufi +1
Graph learning aims to infer a network structure directly from observed data, enabling the analysis of complex dependencies in irregular domains. Traditional methods focus on scala…
Graph signal aware decomposition of dynamic networks via latent graphs
Bishwadeep Das, Andrei Buciulea, Antonio G. Marques +1
Dynamics on and of networks refer to changes in topology and node-associated signals, respectively and are pervasive in many socio-technological systems, including social, biologic…
Learning the Topology of a Simplicial Complex Using Simplicial Signals: A Greedy Approach
A. Buciulea, E. Isufi, G. Leus +1
Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the dat…
Polynomial Graphical Lasso: Learning Edges from Gaussian Graph-Stationary Signals
Andrei Buciulea, Jiaxi Ying, Antonio G. Marques +1
This paper introduces Polynomial Graphical Lasso (PGL), a new approach to learning graph structures from nodal signals. Our key contribution lies in modeling the signals as Gaussia…
Mitigating Subpopulation Bias for Fair Network Topology Inference
Madeline Navarro, Samuel Rey, Andrei Buciulea +2
We consider fair network topology inference from nodal observations. Real-world networks often exhibit biased connections based on sensitive nodal attributes. Hence, different subp…
Learning graphs and simplicial complexes from data
Andrei Buciulea, Elvin Isufi, Geert Leus +1
Graphs are widely used to represent complex information and signal domains with irregular support. Typically, the underlying graph topology is unknown and must be estimated from th…
Joint Network Topology Inference in the Presence of Hidden Nodes
Madeline Navarro, Samuel Rey, Andrei Buciulea +2
We investigate the increasingly prominent task of jointly inferring multiple networks from nodal observations. While most joint inference methods assume that observations are avail…
Graph Learning from Gaussian and Stationary Graph Signals
Andrei Buciulea, Antonio G. Marques
Graphs have become pervasive tools to represent information and datasets with irregular support. However, in many cases, the underlying graph is either unavailable or naively obtai…
Joint graph learning from Gaussian observations in the presence of hidden nodes
Samuel Rey, Madeline Navarro, Andrei Buciulea +2
Graph learning problems are typically approached by focusing on learning the topology of a single graph when signals from all nodes are available. However, many contemporary setups…