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
11 papers · 1 filter
A Unified Framework for Generalizing the Gromov-Hausdorff Metric
Ali Khezeli
In this paper, an approach for generalizing the Gromov-Hausdorff metric is presented, which applies to metric spaces equipped with some additional structure. A special case is the…
Statistical thresholds for Tensor PCA
Aukosh Jagannath, Patrick Lopatto, Leo Miolane
We study the statistical limits of testing and estimation for a rank one deformation of a Gaussian random tensor. We compute the sharp thresholds for hypothesis testing and estimat…
Analyzing LoRa long-range, low-power, wide-area networks using stochastic geometry
Bartłomiej Błaszczyszyn, Paul Mühlethaler
In this paper we present a simple, stochastic-geometric model of a wireless access network exploiting the LoRA (Long Range) protocol, which is a non-expensive technology allowing f…
Robustness of spectral methods for community detection
Ludovic Stephan, Laurent Massoulié
The present work is concerned with community detection. Specifically, we consider a random graph drawn according to the stochastic block model~: its vertex set is partitioned into…
Planting trees in graphs, and finding them back
Laurent Massoulié, Ludovic Stephan, Don Towsley
In this paper we study detection and reconstruction of planted structures in Erdős-Rényi random graphs. Motivated by a problem of communication security, we focus on planted struct…
Weighted Spectral Embedding of Graphs
Thomas Bonald, Alexandre Hollocou, Marc Lelarge
We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the firs…
Action-Constrained Markov Decision Processes With Kullback-Leibler Cost
Ana Bušić, Sean Meyn
This paper concerns computation of optimal policies in which the one-step reward function contains a cost term that models Kullback-Leibler divergence with respect to nominal dynam…
Hierarchical Graph Clustering using Node Pair Sampling
Thomas Bonald, Bertrand Charpentier, Alexis Galland +1
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between…
Efficient inference in stochastic block models with vertex labels
Clara Stegehuis, Laurent Massoulié
We study the stochastic block model with two communities where vertices contain side information in the form of a vertex label. These vertex labels may have arbitrary label distrib…
Optimal Algorithms for Non-Smooth Distributed Optimization in Networks
Kevin Scaman, Francis Bach, Sébastien Bubeck +2
In this work, we consider the distributed optimization of non-smooth convex functions using a network of computing units. We investigate this problem under two regularity assumptio…
Loynes construction for the extended bipartite matching
Pascal Moyal, Ana Busic, Jean Mairesse
We propose an explicit construction of the stationary state of Extended Bipartite Matching (EBM) models, as defined in (Busic et. al., 2013). We use a Loynes-type backwards scheme…