Abstract
We present exact, analytic results for the mean time to trapping of a random walker on the class of deterministic Sierpinski graphs embedded in d≥2 Euclidean dimensions, when both nearest-neighbor (NN) and next-nearest-neighbor (NNN) jumps are included. Mean first-passage times are shown to be modified significantly as a consequence of the fact that NNN transitions connect fractals of two consecutive generations.
Sign-in/Register to access full text options 
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.
