Transfinite Random Walks

Armen H. Zemanian
Additional contact information
Armen H. Zemanian: State University of New York at Stony Brook, Department of Electrical Engineering

Chapter Chapter 7 in Transfiniteness, 1996, pp 183-221 from Springer

Abstract: 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.

Keywords: Random Walk; Terminal Node; Node Voltage; Maximal Node; Bordering Node (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-1-4612-0767-2_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461207672

DOI: 10.1007/978-1-4612-0767-2_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().