Fractal Self-Avoiding Walks

Pascal Préa (1, 2)

1 LIS - Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)
2 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle

For any odd integer K > 1, we define F K , a new family of self-avoiding walks (SAW) on the square lattice Z ⇥ Z, called K-fractal walks. These families have a simple and natural characterization and they seem to all have a critical exponent ⌫ for mean-square displacement in ]0.5, 1[. For small values of K at least , these families are easy to count and it is also very easy to randomly generate a K-fractal walk. In addition, lim K!1 F K is the set of all SAWs on Z ⇥ Z. We present also some variants of fractal SAWs, e.g. fractal SAWs on the d-dimensional grid Z d .

Mots clés: Random Generation; Enumeration; Fractal Structures; Self Avoiding Walks

Domaines: Combinatoire [math.CO]; Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

Pascal Préa. Fractal Self-Avoiding Walks. GASCom, 2012, Bordeaux, France. ⟨hal-02435803⟩