Loop erased random walk on percolation cluster: Crossover from Euclidean to fractal geometry

Abstract

We study loop erased random walk (LERW) on the percolation cluster, with occupation probability p≥ pc, in two and three dimensions. We find that the fractal dimensions of LERWp is close to normal LERW in Euclidean lattice, for all p>pc. However our results reveal that LERW on critical incipient percolation clusters is fractal with df=1.2170.0015 for d = 2 and 1.440.03 for d = 3, independent of the coordination number of the lattice. These values are consistent with the known values for optimal path exponents in strongly disordered media. We investigate how the behavior of the LERWp crosses over from Euclidean to fractal geometry by gradually decreasing the value of the parameter p from 1 to pc. For finite systems, two crossover exponents and a scaling relation can be derived. This work opens up a new theoretical window regarding diffusion process on fractal and random landscapes.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…