Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T02:46:54.297Z Has data issue: false hasContentIssue false

Branching and tree indexed random walks on fractals

Published online by Cambridge University Press:  14 July 2016

András Telcs*
Affiliation:
International Business School, Budapest
Nicholas C. Wormald*
Affiliation:
University of Melbourne
*
∗ Postal address: Head of Library and Computing, International Business School, Tarogato u. 2–4, 1021 Budapest, Hungary. Partial support from OTKA T 016237 and the Australian Research Council.
∗∗ Postal address: Department of Mathematics and Statistics, University of Melbourne, Parkville VIC 3052, Australia. Email address: nick@unimelb.edu.au.

Abstract

This paper deals with the recurrence of branching random walks on polynomially growing graphs. Amongst other things, we demonstrate the strong recurrence of tree indexed random walks determined by the resistance properties of spherically symmetric graphs. Several branching walk models are considered to show how the branching mechanism influences the recurrence behaviour.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable