471 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut national de recherche en sciences et technologies du numériqueFR21 papers
- École Normale Supérieure - PSLFR17 papers
- Centre National de la Recherche ScientifiqueFR8 papers
- University of FloridaUS7 papers
- Département d'InformatiqueFR6 papers
- KTH Royal Institute of TechnologySE4 papers
- Télécom ParisFR4 papers
- The University of Texas at AustinUS4 papers
- Eindhoven University of TechnologyNL3 papers
- École Normale SupérieureBI2 papers
- Laboratoire des signaux et systèmesFR2 papers
- Microsoft (United States)US2 papers
5 papers · 1 filter
Particle gradient descent model for point process generation
Antoine Brochard, Bartłomiej Błaszczyszyn, Stéphane Mallat +1
This paper presents a statistical model for stationary ergodic point processes, estimated from a single realization observed in a square window. With existing approaches in stochas…
Expressive Power of Invariant and Equivariant Graph Neural Networks
Waïss Azizian, Marc Lelarge
Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this paper, we propose a…
Understanding and monitoring the evolution of the Covid-19 epidemic from medical emergency calls: the example of the Paris area
Stéphane Gaubert, Marianne Akian, Xavier Allamigeon +16
We portray the evolution of the Covid-19 epidemic during the crisis of March-April 2020 in the Paris area, by analyzing the medical emergency calls received by the EMS of the four…
Replica-Mean-Field Limits of Fragmentation-Interaction-Aggregation Processes
François Baccelli, Michel Davydov, Thibaud Taillefumier
Network dynamics with point-process-based interactions are of paramount modeling interest. Unfortunately, most relevant dynamics involve complex graphs of interactions for which an…
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…