Learning the effective order of a hypergraph dynamical system
Science Advances, 2024
Dynamical systems on hypergraphs can display a rich set of behaviours not observable for systems with pairwise interactions. Given a distributed dynamical system with a putative hypergraph structure, an interesting question is thus how much of this hypergraph structure is actually necessary to faithfully replicate the …
Laplacian-based Semi-Supervised Learning in Multilayer Hypergraphs by Coordinate Descent
EURO Journal on Computational Optimization, 2023
Graph Semi-Supervised learning is an important data analysis tool, where given a graph and a set of labeled nodes, the aim is to infer the labels to the remaining unlabeled nodes. In this paper, we start by considering an optimization-based formulation of the problem for an undirected graph, and then we extend this …
Core-periphery detection in hypergraphs
SIAM Journal on Mathematics of Data Science, vol. 5, 2023
Core-periphery detection is a key task in exploratory network analysis where one aims to find a core, a set of nodes well-connected internally and with the periphery, and a periphery, a set of nodes connected only (or mostly) with the core. In this work we propose a model of core-periphery for higher-order networks …
Nonlinear Feature Diffusion on Hypergraphs
International Conference on Machine Learning (ICML), 2022
Hypergraphs are a common model for multiway relationships in data, and hypergraph semi-supervised learning is the problem of assigning labels to all nodes in a hypergraph, given labels on just a few nodes. Diffusions and label spreading are classical techniques for semi-supervised learning in the graph setting, and …
Node and Edge Eigenvector Centrality for Hypergraphs
Communications Physics, vol. 4:201, 2021
Network scientists have shown that there is great value in studying pairwise interactions between components in a system. From a linear algebra point of view, this involves defining and evaluating functions of the associated adjacency matrix. Recent work indicates that there are further benefits from accounting …
Nonlinear Higher-Order Label Spreading
The Web Conference (WWW), pp. 2402–2413, 2021
Label spreading is a general technique for semi-supervised learning with point cloud or network data, which can be interpreted as a diffusion of labels on a graph. While there are many variants of label spreading, nearly all of them are linear models, where the incoming information to a node is a weighted sum of …
An Efficient Multilinear Optimization Framework for Hypergraph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 39, pp. 1054–1075, 2017
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order optimization problem subject to the assignment constraints which turns out to be NP-hard. …