Skip to main content

Permissively Finitely Structured Networks

  • Chapter
Transfiniteness
  • 120 Accesses

Abstract

The purpose of this chapter is to lay a foundation for a theory of random walks on transfinite networks, a subject that will be explored in Chapter 7. What is needed for this purpose is not only the uniqueness of the node voltages but also a maximum principle for them. The desired principle will assert that in a sourceless subsection every internal node voltage is less than the voltage at some bordering node of the subsection and greater than the voltage at another bordering node of the subsection — except in the case when all the node voltages within the subsection are identical. The uniqueness of the node voltages has already been established under the hypotheses of Theorem 5.5-4 and Corollary 5.5-5. The maximum principle is established in Section 6.3, and for this purpose we will impose stronger conditions than those used for uniqueness. In particular, we will assume that the network NT is not only finitely structured but that the contraction paths can be chosen so that every one of them is permissive. These conditions will also suffice for our theory of transfinite random walks. Some ancillary results that are also established in this chapter are Kirchhoff’s current law for a cut at an isolating set, the feasibility of exciting Nν by a pure voltage source, the boundedness of all the node voltages by the value of that voltage source, and another maximum principle expressed in terms of currents.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Zemanian, A.H. (1996). Permissively Finitely Structured Networks. In: Transfiniteness. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0767-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0767-2_6

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6894-9

  • Online ISBN: 978-1-4612-0767-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics