基于势的流网络的简化

Reduction of Potential-Based Flow Networks

Mathematics of Operations Research · 2023
被引 1
ABS 3

中文导读

研究了基于势的流网络能否简化为更小但行为相同的网络,证明至少三个终端时通常无法简化,但特殊情形可表示为终端上的完全图或路径网络。

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. Funding: This work was supported by Deutsche Forschungsgemeinschaft [Grants CRC/TRR 154, 239904186, Subproject A07].

基础设施网络电力网络天然气网络供水网络图论