107 citations · 586 across the 55 of their papers we have counts for
Showing 2015 · math.PRShow all
2 papers · 2 filters
math.PR2015
An elementary approach to Gaussian multiplicative chaos
Nathanaël Berestycki
A completely elementary and self-contained proof of convergence of Gaussian multiplicative chaos is given. The argument shows further that the limiting random measure is nontrivial…
math.PR2015★ 1 cited
Random walks on the random graph
Nathanael Berestycki, Eyal Lubetzky, Yuval Peres +1
We study random walks on the giant component of the Erdős-Rényi random graph where for fixed. The mixing time from a worst starting point was shown by…