Cart
Free US shipping over $10
Proud to be B-Corp

Transfiniteness Armen H. Zemanian

Transfiniteness By Armen H. Zemanian

Transfiniteness by Armen H. Zemanian


$64.59
Condition - New
Only 2 left

Summary

The idea of two branches being connected only through transfinite paths, that is, only through paths having infinitely many branches was never invoked, or so it appears from a perusal of various surveys of infinite graphs [17], [20], [29], [32].

Transfiniteness Summary

Transfiniteness: For Graphs, Electrical Networks, and Random Walks by Armen H. Zemanian

What good is a newborn baby? Michael Faraday's reputed response when asked, What good is magnetic induction? But, it must be admitted that a newborn baby may die in infancy. What about this one- the idea of transfiniteness for graphs, electrical networks, and random walks? At least its bloodline is robust. Those subjects, along with Cantor's transfinite numbers, comprise its ancestry. There seems to be general agreement that the theory of graphs was born when Leonhard Euler published his solution to the Konigsberg bridge prob lem in 1736 [8]. Similarly, the year of birth for electrical network theory might well be taken to be 184 7, when Gustav Kirchhoff published his volt age and current laws [ 14]. Ever since those dates until just a few years ago, all infinite undirected graphs and networks had an inviolate property: Two branches either were connected through a finite path or were not connected at all. The idea of two branches being connected only through transfinite paths, that is, only through paths having infinitely many branches was never invoked, or so it appears from a perusal of various surveys of infinite graphs [17], [20], [29], [32]. Our objective herein is to explore this idea and some of its ramifications. It should be noted however that directed graphs having transfinite paths have appeared in set theory [6, Section 4.

Table of Contents

1 Introduction.- 2 Transfinite Graphs.- 3 Connectedness.- 4 Finitely Structured Transfinite Graphs.- 5 Transfinite Electrical Networks.- 6 Permissively Finitely Structured Networks.- 7 Transfinite Random Walks.- Appendix A: Ordinal and Cardinal Numbers.- Appendix B: Summable Series.- Appendix C: Irreducible and Reversible Markov Chains.- Index of Symbols.

Additional information

NLS9781461268949
9781461268949
146126894X
Transfiniteness: For Graphs, Electrical Networks, and Random Walks by Armen H. Zemanian
New
Paperback
Springer-Verlag New York Inc.
2013-06-26
246
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Transfiniteness