6 citations · 20 across the 25 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2022
Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms
Chandra Sekhar Mukherjee, Jiapeng Zhang
Community detection in the stochastic block model is one of the central problems of graph clustering. Since its introduction, many subsequent papers have made great strides in solv…
math.CO2019★ 6 cited
Improved bounds for the sunflower lemma
Ryan Alweiss, Shachar Lovett, Kewen Wu +1
A sunflower with petals is a collection of sets so that the intersection of each pair is equal to the intersection of all of them. Erdős and Rado proved the sunflower lemma…
math.CO2019★ 1 cited
From DNF compression to sunflower theorems via regularity
Shachar Lovett, Noam Solomon, Jiapeng Zhang
The sunflower conjecture is one of the most well-known open problems in combinatorics. It has several applications in theoretical computer science, one of which is DNF compression,…