2 citations · 2 across the 2 of their papers we have counts for
4 papers
SiMCa: Sinkhorn Matrix Factorization with Capacity Constraints
Eric Daoud, Luca Ganassali, Antoine Baker +1
For a very broad range of problems, recommendation algorithms have been increasingly used over the past decade. In most of these algorithms, the predictions are built upon user-ite…
Impossibility of Partial Recovery in the Graph Alignment Problem
Luca Ganassali, Laurent Massoulié, Marc Lelarge
Random graph alignment refers to recovering the underlying vertex correspondence between two random graphs with correlated edges. This can be viewed as an average-case and noisy ve…
Probabilistic and mean-field model of COVID-19 epidemics with user mobility and contact tracing
M. Akian, L. Ganassali, S. Gaubert +1
We propose a detailed discrete-time model of COVID-19 epidemics coming in two flavours, mean-field and probabilistic. The main contribution lies in several extensions of the basic…
From tree matching to sparse graph alignment
Luca Ganassali, Laurent Massoulié
In this paper we consider alignment of sparse graphs, for which we introduce the Neighborhood Tree Matching Algorithm (NTMA). For correlated Erdős-Rényi random graphs, we prove tha…