IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-0767-2_6.html
   My bibliography  Save this book chapter

Permissively Finitely Structured Networks

In: Transfiniteness

Author

Listed:
  • Armen H. Zemanian

    (State University of New York at Stony Brook, Department of Electrical Engineering)

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.

Suggested Citation

  • Armen H. Zemanian, 1996. "Permissively Finitely Structured Networks," Springer Books, in: Transfiniteness, chapter 0, pages 157-182, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-0767-2_6
    DOI: 10.1007/978-1-4612-0767-2_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-0767-2_6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.