Cantitate/Preț
Produs

Transfiniteness: For Graphs, Electrical Networks, and Random Walks

Autor Armen H. Zemanian
en Limba Engleză Hardback – 1996
"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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 36552 lei  6-8 săpt.
  Birkhäuser Boston – 26 iun 2013 36552 lei  6-8 săpt.
Hardback (1) 37248 lei  6-8 săpt.
  Birkhäuser Boston – 1996 37248 lei  6-8 săpt.

Preț: 37248 lei

Nou

Puncte Express: 559

Preț estimativ în valută:
7131 7768$ 5982£

Carte tipărită la comandă

Livrare economică 18 decembrie 24 - 01 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780817638184
ISBN-10: 0817638180
Pagini: 246
Ilustrații: X, 246 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.54 kg
Ediția:1996
Editura: Birkhäuser Boston
Colecția Birkhäuser
Locul publicării:Boston, MA, United States

Public țintă

Research

Cuprins

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.