E Marinari and V V Kerrebroeck 2008 J. Phys.: Conf. Ser. 95 012014 doi:10.1088/1742-6596/95/1/012014
E Marinari and V V Kerrebroeck
Show affiliationsWe 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.
05.40.Fb Random walks and Levy flights
Issue 1 (2008)
E Marinari and V V Kerrebroeck 2008 J. Phys.: Conf. Ser. 95 012014
R Goebel et al 2009 Metrologia 46 01012
L M P Fernandes et al 2007 JINST 2 P08005
Amit Giveon et al JHEP07(2004)076
G Marullo Reedtz and R Cerri 2004 Metrologia 41 01003
Vijay Kumar and Washington Taylor JHEP12(2009)050
P Manz et al 2009 Plasma Phys. Control. Fusion 51 035008
K D Hill et al 2005 Metrologia 42 03001
Hua Cheng et al 2008 Nanotechnology 19 025706
Gilad Perez JHEP12(2000)027