65 citations · 108 across the 25 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Spectral methods for testing cluster structure of graphs
Sandeep Silwal, Jonathan Tidor
In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is -clusterable if it can be part…
math.CO2018★ 2 cited
Hypergraph expanders of all uniformities from Cayley graphs
David Conlon, Jonathan Tidor, Yufei Zhao
Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, o…