113 citations · 1.1k across the 108 of their papers we have counts for
5 papers · 1 filter
Exponential concentration for the number of roots of random trigonometric polynomials
Hoi H. Nguyen, Ofer Zeitouni
We show that the number of real roots of random trigonometric polynomials with i.i.d. coefficients, which are either bounded or satisfy the logarithmic Sobolev inequality, satisfie…
Universality for Langevin-like spin glass dynamics
Amir Dembo, Eyal Lubetzky, Ofer Zeitouni
We study dynamics for asymmetric spin glass models, proposed by Hertz et al. and Sompolinsky et al. in the 1980's in the context of neural networks: particles evolve via a modified…
Proof-of-Stake Longest Chain Protocols: Security vs Predictability
Vivek Bagaria, Amir Dembo, Sreeram Kannan +5
The Nakamoto longest chain protocol is remarkably simple and has been proven to provide security against any adversary with less than 50% of the total hashing power. Proof-of-stake…
Limit law for the cover time of a random walk on a binary tree
Amir Dembo, Jay Rosen, Ofer Zeitouni
Let denote the binary tree of depth augmented by an extra edge connected to its root. Let denote the cover time of by simple random walk. We prove that $\sqrt…
Outliers of random perturbations of Toeplitz matrices with finite symbols
Anirban Basak, Ofer Zeitouni
Consider an Toeplitz matrix with symbol , perturbed by an additive noise matrix , where the entries o…