Available from my Google Scholar profile (ordered by date or citation count).
Trimmed sample means for uniform mean estimation and regression (w/ Lucas Resende). Annals of Statistics, to appear.
The contact process over a dynamical d-regular graph (w/ G. Leite Baptista da Silva & D. Valesin). Annales de l'IHP Prob & Stat (2024).
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints & II: localization in stochastic convex optimization and persistence results for the LASSO (w/ P. Thompson). Mathematical Programming (2023).
Estimating graph parameters with random walks (w/ A. Ben-Hamou & Y. Peres). Mathematical Statistics and Learning 2019. Preliminary version in SODA 2018.
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality (with S. Mei, T. Misiakiewicz and A. Montanari). COLT 2017.
Sub-Gaussian mean estimators (w/ L. Devroye, G. Lugosi & M. Lerasle). Annals of Statistics (2016).
Approximate group context tree (w/ A. Belloni). Annals of Statistics (2016).
Mean field conditions for coalescing random walks. Annals of Probability (2013).
Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk. Annals of Probability (2013).
Generic entanglement can be generated efficiently (w/ Oscar Dahlsten & Martin Plenio). Physical Review Letters (2007)
TBA