1 citations · 1 across the 4 of their papers we have counts for
4 papers
Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences
Nitya Mani, Dan Mikulincer
We investigate the distribution of monochromatic subgraph counts in random vertex -colorings of large graphs. We give sufficient conditions for the asymptotic normality of these…
Variations on Sidorenko's conjecture in tournaments
Jacob Fox, Zoe Himwich, Nitya Mani +1
We study variants of Sidorenko's conjecture in tournaments, where new phenomena arise that do not have clear analogues in the setting of undirected graphs. We first consider orient…
On sum-intersecting families of positive integers
Aaron Berger, Nitya Mani
We study the following natural arithmetic question regarding intersecting families: how large can a family of subsets of integers from be such that, for every pai…
From algorithms to connectivity and back: finding a giant component in random k-SAT
Zongchen Chen, Nitya Mani, Ankur Moitra
We take an algorithmic approach to studying the solution space geometry of relatively sparse random and bounded degree -CNFs for large . In the course of doing so, we establi…