Concept
Graphe orienté
Publications associées (427)
Recovering Static and Time-Varying Communities Using Persistent Edges
Maximilien Claude Robert Dreveton
This article focuses on spectral methods for recovering communities in temporal networks. In the case of fixed communities, spectral clustering on the simple time-aggregated graph (i.e., the weighted graph formed by the sum of the interactions over all tem ...
Ieee Computer Soc2024The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.
We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...
Elsevier2024BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS
Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...
Siam Publications2024The Power of Two Matrices in Spectral Algorithms for Community Recovery
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...
Ieee-Inst Electrical Electronics Engineers Inc2024Post 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 ...
2024Better Trees for Santa Claus
Etienne Michel François Bamas, Lars Rohwedder
We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...
New York2023Graph-based approximate message passing iterations
Approximate message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing ...
OXFORD UNIV PRESS2023Privatized graph federated learning
Ali H. Sayed, Stefan Vlaski, Elsa Rizk
Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-m ...
SPRINGER2023GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors
Mirjana Stojilovic, Guanglei Zhou
A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...
2023Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables
We propose ordering-based approaches for learning the maximal ancestral graph (MAG) of a structural equation model (SEM) up to its Markov equivalence class (MEC) in the presence of unobserved variables. Existing ordering-based methods in the literature rec ...
Association for the Advancement of Artificial Intelligence (AAAI)2023