Bond - True Self - Avoiding Walk on Z 3
ثبت نشده
چکیده
The bond-true self-avoiding walk is a nearest neighbour random walk on Z, for which the probability of jumping along a bond of the lattice is proportional to exp(?g number of previous jumps along that bond). We prove a limit theorem for the distribution of the local time process of this walk. A consequence of the main theorem is a limit law for n ?3=2 T n where T n is the rst hitting time of the lattice site at distance n from the origin.
منابع مشابه
Bond - True Self - Avoiding Walk on Z
Thètrue' self-avoiding walk with bond repulsion is a nearest neighbour random walk on Z, for which the probability of jumping along a bond of the lattice is proportional to exp(?g number of previous jumps along that bond). First we prove a limit theorem for the distribution of the local time process of this walk. Using this result, later we prove a local limit theorem, as A ! 1, for the distrib...
متن کاملDecay of Correlations in Nearest - Neighbor Self - Avoiding Walk , Percolation , Lattice Trees and Animals
We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z. The two-point functions of these models are respectively the generating function for self-avoiding walks from the origin to x ∈ Z, the probability of a connection from the origin to x, and the generating functions for lattice trees or lattice animals containing the origin and x. Usin...
متن کاملDecay of Correlations in Nearest-Neighbour Self-Avoiding Walk, Percolation, Lattice Trees and Animals
We consider nearest-neighbour self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z. The two-point functions of these models are respectively the generating function for self-avoiding walks from the origin to x ∈ Z, the probability of a connection from the origin to x, and the generating functions for lattice trees or lattice animals containing the origin and x. Usi...
متن کاملThe Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
We prove existence of an asymptotic expansion in the inverse dimension, to all orders, for the connective constant for self-avoiding walks on Z d . For the critical point, de ned to be the reciprocal of the connective constant, the coe cients of the expansion are computed through order d 6 , with a rigorous error bound of order d 7 . Our method for computing terms in the expansion also applies ...
متن کاملContinuous time ‘ true ’ self - avoiding random walk on Z
We consider the continuous time version of the 'true' or 'myopic' self-avoiding random walk with site repulsion in 1d. The Ray – Knight-type method which was applied in [15] to the discrete time and edge repulsion case, is applicable to this model with some modifications. We present a limit theorem for the local time of the walk and a local limit theorem for the displacement.
متن کامل