Abstract
We study the effective resistance between disjoint compact sets relative to the n-th level approximation F n to the generalized Sierpinski carpet in d dimensions. This yields a simple criterion for determining recurrence of simple random walk on the associated pre-fractal graph in terms of the resistance scaling factor.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
