IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i4p2287-2303.html
   My bibliography  Save this article

Reduction of Potential-Based Flow Networks

Author

Listed:
  • Max Klimm

    (Institut für Mathematik, Technische Universität Berlin, 10623 Berlin, Germany)

  • Marc E. Pfetsch

    (Department of Mathematics, Technische Universität Darmstadt, 64293 Darmstadt, Germany)

  • Rico Raber

    (Institut für Mathematik, Technische Universität Berlin, 10623 Berlin, Germany)

  • Martin Skutella

    (Institut für Mathematik, Technische Universität Berlin, 10623 Berlin, Germany)

Abstract

We consider potential-based flow networks with terminal nodes at which flow can enter or leave the network and physical properties, such as voltages or pressures, are measured and controlled. We study conditions under which such a network can be reduced to a smaller, equivalent network with the same behavior at the terminal nodes. Potential-based flow networks are widely used to model infrastructure networks, such as electricity, gas, or water networks. In contrast to Kron’s reduction for electrical networks, we prove that, in general, potential-based flow networks with at least three terminals cannot be reduced to smaller networks whose size only depends on the number of terminals. On the other hand, we show that it is possible to represent a special class of potential-based flow networks by a complete graph on the terminals, and we establish a characterization of networks that can be reduced to a path network. Our results build on fundamental properties of effective resistances proved in this paper, including explicit formulae for their dependence on edge resistances of the network and their metric properties.

Suggested Citation

  • Max Klimm & Marc E. Pfetsch & Rico Raber & Martin Skutella, 2023. "Reduction of Potential-Based Flow Networks," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2287-2303, November.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:2287-2303
    DOI: 10.1287/moor.2022.1338
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1338
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1338?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormoor:v:48:y:2023:i:4:p:2287-2303. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.