AbstractWe define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. This series has a complex singularity structure and in particular, is not D-finite. The growth constant is approximately 2.54 and is thus larger than that of all natural families of SAW enumerated so far (but smaller than that of general SAW, which is about 2.64). We also prove that the end-to-end distance of weakly directed walks grows linearly. Finally, we study a diagonal variant of this model
The lattice random walks or Polya walks were introduced by George Polya around 1920. Here, a random ...
AbstractIt is shown that 2.58105 < limk→∞ck1k, where ck is the number of self-avoiding walks on the ...
We consider a model of Directed Self-Avoiding Walks (DSAW) on a dilute lattice, using various approa...
AbstractWe define a new family of self-avoiding walks (SAW) on the square lattice, called weakly dir...
AbstractA self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards...
This article is concerned with self-avoiding walks (SAW) on Zd that are subject to a self-attraction...
A partially directed self-avoiding walk model with the 'kinetic growth' weighting is solved exactly,...
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. ...
Recent Monte Carlo simulation results of Yang and Chakrabarti (1990) suggest that the shortest path ...
Abstract. In this paper, we study non-trapped self-avoiding walks, which are self-avoiding walks whi...
In how many ways can you go for a walk along a lattice grid in such a way that you never meet your o...
Abstract. A self-avoiding walk on the square lattice is prudent, if it never takes a step towards a ...
International audienceA self-avoiding walk (SAW) is extendable [10,13] if it can be extended into an...
It is widely believed that the scaling limit of the self-avoiding walk (SAW) is given by Schramm's S...
International audienceFor any odd integer K > 1, we define F K , a new family of self-avoiding walks...
The lattice random walks or Polya walks were introduced by George Polya around 1920. Here, a random ...
AbstractIt is shown that 2.58105 < limk→∞ck1k, where ck is the number of self-avoiding walks on the ...
We consider a model of Directed Self-Avoiding Walks (DSAW) on a dilute lattice, using various approa...
AbstractWe define a new family of self-avoiding walks (SAW) on the square lattice, called weakly dir...
AbstractA self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards...
This article is concerned with self-avoiding walks (SAW) on Zd that are subject to a self-attraction...
A partially directed self-avoiding walk model with the 'kinetic growth' weighting is solved exactly,...
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. ...
Recent Monte Carlo simulation results of Yang and Chakrabarti (1990) suggest that the shortest path ...
Abstract. In this paper, we study non-trapped self-avoiding walks, which are self-avoiding walks whi...
In how many ways can you go for a walk along a lattice grid in such a way that you never meet your o...
Abstract. A self-avoiding walk on the square lattice is prudent, if it never takes a step towards a ...
International audienceA self-avoiding walk (SAW) is extendable [10,13] if it can be extended into an...
It is widely believed that the scaling limit of the self-avoiding walk (SAW) is given by Schramm's S...
International audienceFor any odd integer K > 1, we define F K , a new family of self-avoiding walks...
The lattice random walks or Polya walks were introduced by George Polya around 1920. Here, a random ...
AbstractIt is shown that 2.58105 < limk→∞ck1k, where ck is the number of self-avoiding walks on the ...
We consider a model of Directed Self-Avoiding Walks (DSAW) on a dilute lattice, using various approa...