International audienceFor 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
A self-avoiding walk (SAW) is a path on a lattice that does not pass through the same point more tha...
The lattice random walks or Polya walks were introduced by George Polya around 1920. Here, a random ...
We study critical exponents of self-avoiding walks on a family of finitely ramified Sierpinki-type f...
International audienceFor any odd integer K > 1, we define F K , a new family of self-avoiding walks...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
ches aléatoires. Nous montrons l’existence d’un exposant intrinsèque pour ces marches et nous examin...
Abstract. The probability distribution of random walks on one-dimensional fractal structures generat...
The scaling properties of linear polymers on deterministic fractal structures, modeled by self-avoid...
The scaling properties of linear polymers on deterministic fractal structures, modeled by self-avoid...
The scaling properties of linear polymers on deterministic fractal structures, modeled by self-avoid...
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. T...
AbstractA self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards...
A self-avoiding walk (SAW) is a path on a lattice that does not pass through the same point more tha...
The lattice random walks or Polya walks were introduced by George Polya around 1920. Here, a random ...
We study critical exponents of self-avoiding walks on a family of finitely ramified Sierpinki-type f...
International audienceFor any odd integer K > 1, we define F K , a new family of self-avoiding walks...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the ...
ches aléatoires. Nous montrons l’existence d’un exposant intrinsèque pour ces marches et nous examin...
Abstract. The probability distribution of random walks on one-dimensional fractal structures generat...
The scaling properties of linear polymers on deterministic fractal structures, modeled by self-avoid...
The scaling properties of linear polymers on deterministic fractal structures, modeled by self-avoid...
The scaling properties of linear polymers on deterministic fractal structures, modeled by self-avoid...
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. T...
AbstractA self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards...
A self-avoiding walk (SAW) is a path on a lattice that does not pass through the same point more tha...
The lattice random walks or Polya walks were introduced by George Polya around 1920. Here, a random ...
We study critical exponents of self-avoiding walks on a family of finitely ramified Sierpinki-type f...