84 citations
- Huyên Pham3 profiles5
- Olivier Wintenberger2 profiles5 · h 19
- Romain Dujardin2 profiles4 · h 21
- Benoît Laslier3 · h 11
- Claire Boyer2 profiles3 · h 13
- Clément Levrard2 profiles3 · h 11
- Erwan Scornet2 profiles3 · h 21
- Étienne Roquain3 · h 20
- Idris Kharroubi2 profiles3 · h 17
- Joseph de Vilmarest2 profiles3 · h 3
- N. Frikha3 · h 13
- Sylvain Le Corff3
- Laboratoire de Probabilités et Modèles AléatoiresFR71 papers
- Université Paris CitéFR22 papers
- Sorbonne UniversitéFR18 papers
- Centre National de la Recherche ScientifiqueFR13 papers
- Laboratoire de Mathématiques Blaise PascalFR10 papers
- École PolytechniqueFR9 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR8 papers
- Laboratoire de Physique Théorique et Modèles StatistiquesFR7 papers
- Sorbonne Paris CitéFR7 papers
- École Normale Supérieure - PSLFR6 papers
- Département de mathématiques et applicationsFR5 papers
- Département mathématiques, informatique, sciences de la donnée et technologies du numériqueFR5 papers
Showing 2018Show all
3 papers · 1 filter
math.PR2018
Anchored isoperimetric profile of the infinite cluster in supercritical bond percolation is Lipschitz continuous
Barbara Dembin
We consider an i.i.d. supercritical bond percolation on , every edge is open with a probability , where denotes the critical parameter for this…
math.ST2018
The k-PDTM : a coreset for robust geometric inference
Claire Brécheteau, Clément Levrard
Analyzing the sub-level sets of the distance to a compact sub-manifold of R d is a common method in TDA to understand its topology. The distance to measure (DTM) was introduced by…
math.ST2018★ 7 cited
Quantization/clustering: when and why does k-means work?
Clément Levrard
Though mostly used as a clustering algorithm, k-means are originally designed as a quantization algorithm. Namely, it aims at providing a compression of a probability distribution…