A family of self-avoiding random walks interpolating the loop-erased random walk and a self-avoiding walk on the Sierpiński gasket

Citations Over Time

Abstract

We show that the ‘erasing-larger-loops-first’ (ELLF) method, which was first introduced for erasing loops from the simple random walk on the Sierpiński gasket, does work also for non-Markov random walks, in particular, self-repelling walks to construct a new family of self-avoiding walks on the Sierpiński gasket. The one-parameter family constructed in this method continuously connects the loop-erased random walk and a self-avoiding walk which has the same asymptotic behavior as the ‘standard’ self-avoiding walk. We prove the existence of the scaling limit and study some path properties: The exponent $ν$ governing the short-time behavior of the scaling limit varies continuously in the parameter. The limit process is almost surely self-avoiding, while it has path Hausdorff dimension $1/ν $, which is strictly greater than $1$.

Related Papers

• → Weierstrassian Levy flights and self-avoiding random walks(1983)22 cited
• → A family of self-avoiding random walks interpolating the loop-erased random walk and a self-avoiding walk on the Sierpiński gasket(2017)3 cited
• → A family of self-avoiding random walks interpolating the loop-erased random walk and a self-avoiding walk on the Sierpinski gasket(2015)2 cited
• → Mapping a finite and an infinite Hadamard quantum walk onto a unique case of a random walk process(2020)