Abstract
The idea of a random walk on a graph is an idea of considerable importance in probability theory and has a variety of applications in the sciences as well as in other branches of mathematics. The recent survey of Woess [32] provides an excellent overview of the subject along with an extended bibliography. However, all that theory has been restricted to walks on conventional (finite and infinite) graphs. The recent advent of transfinite graphs invites an examination of random walks upon them. This immediately raises the question of how a random walk might wander through a transfinite node and thereby progress from one 0-section to another.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zemanian, A.H. (1996). Transfinite Random Walks. In: Transfiniteness. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0767-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0767-2_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6894-9
Online ISBN: 978-1-4612-0767-2
eBook Packages: Springer Book Archive