Abstract
I apply the theory of random walks to prove dimensional recurrence formulas for return probabilities and Green functions of cubic lattices. I use these formulas to compute the average number of distinct sites visited by the random walker on an “almost one-dimensional” lattice.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
