Pristine Transfinite Graphs and Permissive Electrical Networks [Hardcover]

This volume provides a relatively accessible introduction to its subject that captures the essential ideas of transfiniteness for graphs and networks.

A transfinite graph or electrical network of the first rank isobtained conceptually by connecting conventionally infinite graphs andnetworks together at their infinite extremities. This process can berepeated to obtain a hierarchy of transfiniteness whose ranks increasethrough the countable ordinals. This idea, which is of recent origin,has enriched the theories of graphs and networks with radically newconstructs and research problems.The book provides a more accessible introduction to the subject that,though sacrificing some generality, captures the essential ideas oftransfiniteness for graphs and networks. Thus, for example, someresults concerning discrete potentials and random walks on transfinitenetworks can now be presented more concisely. Conversely, thesimplifications enable the development of many new results that werepreviously unavailable.Topics and features: *A simplified exposition provides an introductionto transfiniteness for graphs and networks.*Various results forconventional graphs are extended transfinitely. *Minty's powerfulanalysis of monotone electrical networks is also extendedtransfinitely.*Maximum principles for node voltages in lineartransfinite networks are established. *A concise treatment of randomwalks on transfinite networks is developed. *Conventional theory isexpanded with radically new constructs.Mathematicians, operations researchers and electrical engineers, inparticular, graph theorists, electrical circuit theorists, andprobabalists will find an accessible exposition of an advancedsubject.1 Introduction.- 1.1 Notations and Terminology.- 1.2 Transfinite Nodes and Graphs.- 1.3 A Need for Transfiniteness.- 1.4 Pristine Graphs.- 2 Pristine Transfinite Graphs.- 2.1 0-Graphs and 1-Graphs.- 2.2 ?-Graphs and (? + 1)-Graphs.- 2.3 $$ \mathop{\omega }\limits^{ \to } $$-Graphslœ