Cycles in sparse random graphs
Enzo Marinari, Valery Van Kerrebroeck · Journal of Physics Conference Series · 2008
We study the cycles in sparse random graphs by treating them as a constraint satisfaction problem. We discuss how the model is defined, and the results that can be obtained in this way. In particular, we introduce and discuss an approximation to the self-avoiding walk-sum which emerges naturally from a slightly engineered version of the original problem.