Functional iterations and periodic oscillations for simple random walk on the Sierpinski graph

Peter J. Grabner and Wolfgang Woess

Stochastic Processes and their Applications, 1997, vol. 69, issue 1, 127-138

Abstract: We use methods from asymptotic combinatorics and functional iterations to give a rigorous proof of the fluctuating behaviour of the n-step transition probabilities for the simple random walk on the Sierpinski graph.

Keywords: Random; walks; on; graphs; Probability; generating; functions (search for similar items in EconPapers)
Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4149(97)00033-1
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:69:y:1997:i:1:p:127-138

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().