no code implementations • 20 Jan 2021 • Joe Neeman, Charles Radin, Lorenzo Sadun
We prove moderate deviations bounds for the lower tail of the number of odd cycles in a $\calG(n, m)$ random graph.
Probability Mathematical Physics Combinatorics Mathematical Physics 60xx
no code implementations • 24 Apr 2020 • Anindya De, Elchanan Mossel, Joe Neeman
Using our techniques, we also obtain a fully noise tolerant tester with the same query complexity for any class $\mathcal{C}$ of linear $k$-juntas with surface area bounded by $s$.
no code implementations • 4 Oct 2016 • Avik Ray, Joe Neeman, Sujay Sanghavi, Sanjay Shakkottai
We consider the task of learning the parameters of a {\em single} component of a mixture model, for the case when we are given {\em side information} about that component, we call this the "search problem" in mixture models.
1 code implementation • 16 Jul 2015 • Dohyung Park, Joe Neeman, Jin Zhang, Sujay Sanghavi, Inderjit S. Dhillon
In this paper we consider the collaborative ranking setting: a pool of users each provides a small number of pairwise preferences between $d$ possible items; from these we need to predict preferences of the users for items they have not yet seen.
no code implementations • 24 Jun 2013 • Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang
Spectral algorithms are classic approaches to clustering and community detection in networks.