Random Walks on ω-Networks

A. H. Zemanian
Additional contact information
A. H. Zemanian: State University of New York, Department of Electrial Engineering

A chapter in Harmonic Analysis and Discrete Potential Theory, 1992, pp 249-257 from Springer

Abstract: Abstract A k-network, where k is any finite or transfinite, countable ordinal, is a transfinite generalization of an ordinary infinite electrical network. A prior work has established a theory for random walks on k-networks in the case where k is any natural number. The present work generalizes still further by establishing a theory for random walks on an ω-network, where ω is the first transfinite ordinal. It appears that such a theory can be established recursively for any ω-network by using the method of the prior work when proceeding to a successor ordinal and the method of the present work when proceeding to a limit ordinal.

Keywords: Natural Number; Source Node; Electrical Network; Node Voltage; Transfinite Generalization (search for similar items in EconPapers)
Date: 1992
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-4899-2323-3_20

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

DOI: 10.1007/978-1-4899-2323-3_20

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