260 citations
- École Normale Supérieure - PSLFR112 papers
- Centre National de la Recherche ScientifiqueFR77 papers
- Sorbonne UniversitéFR38 papers
- Laboratoire de Physique de l'Ecole Normale SupérieureFR32 papers
- Université Paris CitéFR23 papers
- Université Paris Sciences et LettresFR23 papers
- Département de mathématiques et applicationsFR19 papers
- Sorbonne Paris CitéFR16 papers
- Laboratoire de Géologie de l’École Normale SupérieureFR15 papers
- Université Paris-SaclayFR15 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR9 papers
5 papers · 1 filter
Low-rank optimization with trace norm penalty
B. Mishra, G. Meyer, F. Bach +1
The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank op…
Physical Simulation of Inarticulate Robots
Guillaume Claret, Michaël Mathieu, David Naccache +1
In this note we study the structure and the behavior of inarticulate robots. We introduce a robot that moves by successive revolvings. The robot's structure is analyzed, simulated…
The branching Brownian motion seen from its tip
E. Aïdékon, J. Berestycki, É. Brunet +1
It has been conjectured since the work of Lalley and Sellke (1987) that the branching Brownian motion seen from its tip (e.g. from its rightmost particle) converges to an invariant…
Random interlacements and amenability
Augusto Teixeira, Johan Tykesson
We consider the model of random interlacements on transient graphs, which was first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the special case of ${\mathb…
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…