63 citations · 63 across the 1 of their papers we have counts for
3 papers
cond-mat.dis-nn2004★ 63 cited
Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs
Florent Krzakala, Andrea Pagnani, Martin Weigt
We consider the problem of coloring Erdos-Renyi and regular random graphs of finite connectivity using q colors. It has been studied so far using the cavity approach within the so-…
cond-mat.stat-mech2000
Statistical mechanics perspective on the phase transition in vertex covering finite-connectivity random graphs
Alexander K. Hartmann, Martin Weigt
The vertex-cover problem is studied for random graphs having vertices and edges. Exact numerical results are obtained by a branch-and-bound algorithm. It is fou…
cond-mat.dis-nn1999
On the properties of small-world network models
A. Barrat, M. Weigt
We study the small-world networks recently introduced by Watts and Strogatz [Nature {\bf 393}, 440 (1998)], using analytical as well as numerical tools. We characterize the geometr…