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
17 papers · 1 filter
Coupling from the Past for the Null Recurrent Markov Chain
François Baccelli, Mir-Omid Haji-Mirsadeghi, Sayeh Khaniha
The Doeblin Graph of a countable state space Markov chain describes the joint pathwise evolutions of the Markov dynamics starting from all possible initial conditions, with two pat…
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…
Spectral Alignment of Correlated Gaussian matrices
Luca Ganassali, Marc Lelarge, Laurent Massoulié
In this paper we analyze a simple spectral method (EIG1) for the problem of matrix alignment, consisting in aligning their leading eigenvectors: given two matrices and , we…
Eigenvalues of the non-backtracking operator detached from the bulk
Simon Coste, Yizhe Zhu
We describe the non-backtracking spectrum of a stochastic block model with connection probabilities . In this regime we answer a qu…
Continuum Line-of-Sight Percolation on Poisson-Voronoi Tessellations
Quentin Le Gall, Bartłomiej Błaszczyszyn, Elie Cali +1
In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the -dimensional Euclidean space…
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…
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…
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…
A product form for the general stochastic matching model
Pascal Moyal, Ana Busic, Jean Mairesse
We consider a stochastic matching model with a general compatibility graph, as introduced in \cite{MaiMoy16}. We show that the natural necessary condition of stability of the syste…
Fundamental limits of low-rank matrix estimation: the non-symmetric case
Léo Miolane
We consider the high-dimensional inference problem where the signal is a low-rank matrix which is corrupted by an additive Gaussian noise. Given a probabilistic model for the low-r…
Eternal Family Trees and Dynamics on Unimodular Random Graphs
François Baccelli, Mir-Omid Haji-Mirsadeghi, Ali Khezeli
This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network…
Limit theory for geometric statistics of point processes having fast decay of correlations
B. Blaszczyszyn, D. Yogeshwaran, J. E. Yukich
Let be a simple,stationary point process having fast decay of correlations, i.e., its correlation functions factorize up to an additive error decaying faster than any power of…
Reversibility and further properties of FCFS infinite bipartite matching
Ivo Adan, Ana Busic, Jean Mairesse +1
The model of FCFS infinite bipartite matching was introduced in caldentey-kaplan-weiss 2009. In this model there is a sequence of items that are chosen i.i.d. from $\mathcal{C}=\{c…
On the Generating Functionals of a Class of Random Packing Point Processes
Tien Viet Nguyen, François Baccelli
Consider a symmetrical conflict relationship between the points of a point process. The Matérn type constructions provide a generic way of selecting a subset of this point process…
Universality in polytope phase transitions and message passing algorithms
Mohsen Bayati, Marc Lelarge, Andrea Montanari
We consider a class of nonlinear mappings in indexed by symmetric random matrices with independent entries. Within sp…
The diameter of weighted random graphs
Hamed Amini, Marc Lelarge
In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise a…
Matchings on infinite graphs
Charles Bordenave, Marc Lelarge, Justin Salez
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matc…