Abstract
We consider an unbiased random walk on a finite, nth generation Sierpinski gasket (or "tower") in d = 3 Euclidean dimensions, in the presence of a trap at one vertex. The mean walk length (or mean number of time steps to absorption) is given by the exact formula [Formula: see text] The generalization of this formula to the case of a tower embedded in an arbitrary number d of Euclidean dimensions is also found, and is given by [Formula: see text] This also establishes the leading large-n behavior [Formula: see text] that may be expected on general grounds, where Nn is the number of sites on the nth generation tower and [Formula: see text] is the spectral dimension of the fractal.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
