• Sign In
  • Help
  • My Basket0
The books you love, the emails you want
Opt in by 25 May or you'll stop hearing from us
REVIEW NOW
Transfiniteness: For Graphs, Electrical Networks and Random Walks (Hardback)
  • Transfiniteness: For Graphs, Electrical Networks and Random Walks (Hardback)
zoom

Transfiniteness: For Graphs, Electrical Networks and Random Walks (Hardback)

(author)
£54.00
Hardback 264 Pages / Published: 01/12/1995
  • Not available

This product is currently unavailable.

  • This item has been added to your basket

Check Marketplace availability

Transfinite numbers were invented by Cantor in the 19th century, and they profoundly affected the development of 20th-century mathematics. Despite this century-old introduction of transfiniteness into mathematics, its implications for graphs has only been examined recently. This text focuses on transfinite graphs and their ramifications for several related topics, such as electrical networks, discrete potential theory, and random walks. A transfinite graph is one wherein at least two nodes are connected through infinite paths but not through any finite path. Such a structure arises when two infinite graphs are joined at their infinite extremities by "1-nodes". In fact, infinitely many graphs may be so joined,and the result may have infinite extremities in a more general sense. The latter may in turn be joined by "2-nodes". These ideas can be extended recursively through the countable ordinals to obtain a hierarchy of transfinite graphs.

Publisher: Birkhauser Verlag AG
ISBN: 9783764338183
Number of pages: 264
Dimensions: 235 x 155 mm

You may also be interested in...

Reviews

Please sign in to write a review

Your review has been submitted successfully.