Welcome to my page! I am a Maître de conférences (≈ Assistant professor) at Université Paris Diderot and LPSM.
**Address:** 5 rue Thomas Mann, 75205 Paris CEDEX 13, France

**Office:** 516, Bâtiment Sophie Germain

**e-mail:** FIRST.LAST@lpsm.paris (with FIRST=justin and LAST=salez)

I co-organize our weekly seminar.
I am also a member of the research projects SAMARA and Combinatoire à Paris.

- Anna Ben-Hamou (co-supervision with , 2013-2016).
- Simon Coste (co-supervision with , 2016-present).
- Guillaume Conchon-Kerjan (2017-present).

- A version of Aldous' spectral-gap conjecture for the zero range process (with ). Submitted.
- Cutoff for the mean-field zero range process (with ). Submitted.
- Spectral atoms of unimodular random trees.
*Journal of the European Mathematical Society*(to appear). - Cutoff at the "entropic time" for sparse Markov chains
(with
,
).
*Probability Theory and Related Fields*(to appear). - Random walk on sparse random digraphs
(with
,
).
*Probability Theory and Related Fields***170**(2018). - Weighted sampling without replacement
(with
,
).
*Brazilian Journal of Probability and Statistics***32**(2018). - Cutoff for non-backtracking random walks on sparse random graphs
(with ).
*Annals of Probability***45**(2017). - The interpolation method for random graphs with prescribed degrees.
*Combinatorics, Probability and Computing***25**(2016). - The densest subgraph problem in sparse random graphs
(with ).
*Annals of Applied Probability***26**(2016). - Cooperative strings and glassy interfaces
(with , , , ).
*Proceedings of the National Academy of Sciences***112**(2015). - The compulsive gambler process
(with , ).
*Electronic Journal of Probability***20**(2015). - The Mézard-Parisi equation for matchings in pseudo-dimension d>1.
*Electronic Communications in Probability***20**(2015). - Every totally real algebraic integer is a tree eigenvalue.
*Journal of Combinatorial Theory, series B***111**(2015). - Joint distribution of distances in large random regular networks.
*Journal of Applied Probability***50**(2013). - Weighted enumeration of spanning subgraphs in locally tree-like graphs.
*Random Structures and Algorithms***43**(2013). - Matchings on infinite graphs
(with
,
).
*Probability Theory and Related Fields***157**(2013). - The rank of diluted random graphs
(with , ).
*Annals of Probability***39**(2011). - Some implications of local weak convergence for large random graphs. PhD thesis (2011).
- Belief propagation for the random assignment problem
(with
).
*Mathematics of Operations Research***34**(2009). - Optimality of belief propagation for the random assignment problem
(with ).
*Proceedings of the 20th Symposium on Discrete Algorithms*(2009).

- Cours M2 -
*Temps de mélange & chaînes de Markov*: notes de cours et page web. - Exercices M2 -
*Calcul stochastique*: TD1, TD2, TD3, TD4, TD5, TD6, TD7, TD8, X2017 et corrigé. - Exercices M1 -
*Probabilités*: TD1, TD2, TD3, TD4, TD5, TD6, TD7, TD8, TD9, quelques corrigés, rattrapage. - Exercices M1 -
*Analyse et théorie de l'information*: TD1, TD2, TD3, TD4, TD5, TD6, TD7.