Finitely Structured Transfinite Graphs

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

Chapter Chapter 4 in Transfiniteness, 1996, pp 79-113 from Springer

Abstract: Abstract One of the objectives of this book is to develop a theory for transfinite random walks. More specifically, we wish to construct a random walk that may wander over a conventional infinite graph, then “pass through infinity,” and wander over another conventional infinite graph, the “passage through infinity” occurring at a 1-node. This we do in Chapter 7 and in fact construct passages through nodes of higher ranks as well.

Keywords: Natural Number; Span Tree; High Rank; Internal Node; Maximal 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_4

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

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

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 ().