collaborators
Showing eess.SPShow all

5 papers · 1 filter

eess.SP2026

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…

eess.SP2026

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…

eess.SP2025

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…

eess.SP2025

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…

eess.SP2025

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…