Asymptotics of the transition probabilities of the simple random walk on self-similar graphs

From MaRDI portal
Publication:4429752

DOI10.1090/S0002-9947-03-03352-XzbMATH Open1030.60064arXivmath/0209143MaRDI QIDQ4429752FDOQ4429752

B. Krön, Elmar Teufl

Publication date: 28 September 2003

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs hatC. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a class of symmetrically self-similar graphs we study the simple random walk on a cell graph hatC, starting in a vertex v of the boundary of hatC. It is proved that the expected number of returns to v before hitting another vertex in the boundary coincides with the resistance scaling factor. Using techniques from complex rational iteration and singularity analysis for Green functions we compute the asymptotic behaviour of the n-step transition probabilities of the simple random walk on the whole graph. The results of Grabner and Woess for the Sierpi'nski graph are generalised to the class of symmetrically self-similar graphs and at the same time the error term of the asymptotic expression is improved. Finally we present a criterion for the occurrence of oscillating phenomena of the n-step transition probabilities.


Full work available at URL: https://arxiv.org/abs/math/0209143




Recommendations




Cites Work


Cited In (24)





This page was built for publication: Asymptotics of the transition probabilities of the simple random walk on self-similar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429752)