Concept
Graph labeling
Related publications (32)
Post stroke recovery prediction
Dimitri Nestor Alice Van De Ville, Elvira Pirondini, Cyprien Alban Félicien Rivier
The present relates to a method for generating a graph representing a virtually lesioned connectome of a patient after a stroke comprising:- providing structural data of the brain of the patient after the stroke;- segmenting said structural data to delinea ...
2024GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation
Daniel Gatica-Perez, Sina Sajadmanesh
In this paper, we study the problem of learning Graph Neural Networks (GNNs) with Differential Privacy (DP). We propose a novel differentially private GNN based on Aggregation Perturbation (GAP), which adds stochastic noise to the GNN's aggregation functio ...
Berkeley2023Equilibria in Network Constrained Energy Markets
We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...
Elsevier2023Planted matching problems on random hypergraphs
Lenka Zdeborová, Anshul Toshniwal, Gabriele Sicuro
We consider the problem of inferring a matching hidden in a weighted random k-hypergraph. We assume that the hyperedges' weights are random and distributed according to two different densities conditioning on the fact that they belong to the hidden matchin ...
2022Graph signal processing tailored for subgraph focus and community structure
Community structure in graph-modeled data appears in a range of disciplines that comprise network science. Its importance relies on the influence it bears on other properties of graphs such as resilience, or prediction of missing connections. Nevertheless, ...
EPFL2022Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes
Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...
IEEE COMPUTER SOC2022Atomic subgraphs and the statistical mechanics of networks
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows for the generation of graphs with extens ...
2021Symbolic Algorithms for Token Swapping
Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes
We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...
2020Ramsey numbers of ordered graphs
An ordered graph is a pair G = (G,
ELECTRONIC JOURNAL OF COMBINATORICS2020Edge Ordered Turan Problems
Gábor Tardos, Abhishek Methuku
We introduce the Turan problem for edge ordered graphs. We call a simple graph edge ordered, if its edges are linearly ordered. An isomorphism between edge ordered graphs must respect the edge order. A subgraph of an edge ordered graph is itself an edge or ...
COMENIUS UNIV2019