37 citations · 55 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cond-mat.dis-nn2014
Local Algorithms for Graphs
David Gamarnik, Mathieu Hemery, Samuel Hetterich
We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a s…
cs.DM2014★ 37 cited
The condensation phase transition in random graph coloring
Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich +2
Based on a non-rigorous formalism called the "cavity method", physicists have put forward intriguing predictions on phase transitions in discrete structures. One of the most remark…