On self-avoiding walks on certain grids and the connective constant

Dangovski, Rumen

The search session has expired. Please query the service again.

Displaying similar documents to “On self-avoiding walks on certain grids and the connective constant”

The number of [old-time] basketball games with final score $n$ : $n$ where the home team was never losing but also never ahead by more than $w$ points.

Ayyer, Arvind, Zeilberger, Doron (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Self-avoiding walks on the lattice ℤ² with the 8-neighbourhood system

Andrzej Chydziński, Bogdan Smołka (2001)

Applicationes Mathematicae

Similarity:

This paper deals with the properties of self-avoiding walks defined on the lattice with the 8-neighbourhood system. We compute the number of walks, bridges and mean-square displacement for N=1 through 13 (N is the number of steps of the self-avoiding walk). We also estimate the connective constant and critical exponents, and study finite memory and generating functions. We show applications of this kind of walk. In addition, we compute upper bounds for the number of walks and the connective...

Asymptotic behaviour of the simple random walk on the 2-dimensional comb.

Bertacchi, Daniela (2006)

Electronic Journal of Probability [electronic only]

Similarity:

Scaling limit of the prudent walk.

Beffara, Vincent, Friedli, Sacha, Velenik, Yvan (2010)

Electronic Communications in Probability [electronic only]

Similarity:

Counting paths between points on a circle

Ivaylo Kortezov (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The paper deals with counting sets of given magnitude whose elements are self-avoiding paths with nodes from a fixed set of points on a circle. Some of the obtained formulae provide new properties of entries in ``The On-line Encyclopaedia of Integer Sequences", while others generate new entries therein.

A lower bound on the growth exponent for loop-erased random walk in two dimensions

Gregory F. Lawler (1999)

ESAIM: Probability and Statistics

Similarity:

A note on the enumeration of diffusion walks in the first octant by their number of contacts with the diagonal.

Niederhausen, Heinrich (2005)

Journal of Integer Sequences [electronic only]

Similarity:

Asymptotic direction for random walks in random environments

François Simenhaus (2007)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

On the range of the simple random walk bridge on groups.

Benjamini, Itai, Izkovsky, Roey, Kesten, Harry (2007)

Electronic Journal of Probability [electronic only]

Similarity:

Green kernel estimates and the full Martin boundary for random walks on lamplighter groups and Diestel–Leader graphs

Sara Brofferio, Wolfgang Woess (2005)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Green functions for killed random walks in the Weyl chamber of Sp(4)

Kilian Raschel (2011)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider a family of random walks killed at the boundary of the Weyl chamber of the dual of Sp(4), which in addition satisfies the following property: for any ≥ 3, there is in this family a walk associated with a reflection group of order 2. Moreover, the case = 4 corresponds to a process which appears naturally by studying quantum random walks on the dual of Sp(4). For all the processes belonging to this family, we find the exact asymptotic of the Green functions along all infinite...