44 citations · 84 across the 7 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2019
Nucleation during phase transitions in random networks
Joe Neeman, Charles Radin, Lorenzo Sadun
We analyze the 3-parameter family of random networks which are uniform on networks with fixed number of edges, triangles, and nodes (between 33 and 66). We find precursors of phase…
math.CO2018
Finding cliques using few probes
Uriel Feige, David Gamarnik, Joe Neeman +2
Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an vertex graph, and need to output a clique. We show that if the input gr…