Pristine Transfinite Graphs and Permissive Electrical Networks (Hardcover)

Armen H. Zemanian

ISBN 10: 0817641947 / ISBN 13: 9780817641948

Editore: Birkhauser Boston Inc, Secaucus, 2000

Riguardo questo articolo

Hardcover. 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. A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Codice articolo 9780817641948

Dati bibliografici

• Titolo: Pristine Transfinite Graphs and Permissive Electrical Networks (Hardcover)
• Editore: Birkhauser Boston Inc, Secaucus
• Data di pubblicazione: 2000
• Lingua: Inglese
• ISBN 10: 0817641947
• ISBN 13: 9780817641948
• Rilegatura: Hardcover
• Condizione: new

Descrizione articolo

Riassunto

A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities. This process can be repeated to obtain a hierarchy of transfiniteness whose ranks increase through the countable ordinals. This idea, which is of recent origin, has enriched the theories of graphs and networks with radically new constructs and research problems. The book provides a more accessible introduction to the subject that, though sacrificing some generality, captures the essential ideas of transfiniteness for graphs and networks. Thus, for example, some results concerning discrete potentials and random walks on transfinite networks can now be presented more concisely. Conversely, the simplifications enable the development of many new results that were previously unavailable. Topics and features: *A simplified exposition provides an introduction to transfiniteness for graphs and networks.*Various results for conventional graphs are extended transfinitely. *Minty's powerful analysis of monotone electrical networks is also extended transfinitely.*Maximum principles for node voltages in linear transfinite networks are established. *A concise treatment of random walks on transfinite networks is developed. *Conventional theory is expanded with radically new constructs. Mathematicians, operations researchers and electrical engineers, in particular, graph theorists, electrical circuit theorists, and probabalists will find an accessible exposition of an advanced subject.

Recensione

"Transfinite graphs and networks have already been studied in two prior books by the same author. The purpose of the present volume is twofold. First, it is to include a variety of new results that have since been obtained. Second, it is to present a much simpler exposition of the subject. The previous works aimed at generality with a variety of difficulties resulting from the complexity of the subject. The present much simpler exposition sacrifices some generality, but captures the essential ideas of transfiniteness for graphs and networks.... Overall, the author has done excellent work in presenting this complex subject."

―Mathematical Reviews

"Transfiniteness is an abstract mathematical concept that is extended by the author to the very real world of graphs and networks and the idea of random walks, topics of particular interest to circuits and systems network research.... Mathematicians, operations researchers and electrical engineers, in particular, graph theorists, electrical circuit theorists, and probabalists will find an accessible exposition of an advanced subject."

―Zentralblatt MATH