Maximum Entropy Analysis of Flow Networks: Theoretical Foundation and Applications

Maximum Entropy Analysis of Flow Networks: Theoretical Foundation and Applications

Robert K. Niven, Markus Abel, Michael Schlegel and Steven H. Waldrip

Abstract

The concept of a “flow network”—a set of nodes and links which carries one or more flows—unites many different disciplines, including pipe flow, fluid flow, electrical, chemical reaction, ecological, epidemiological, neurological, communications, transportation, financial, economic and human social networks. This Feature Paper presents a generalized maximum entropy framework to infer the state of a flow network, including its flow rates and other properties, in probabilistic form. In this method, the network uncertainty is represented by a joint probability function over its unknowns, subject to all that is known. This gives a relative entropy function which is maximized, subject to the constraints, to determine the most probable or most representative state of the network. The constraints can include “observable” constraints on various parameters, “physical” constraints such as conservation laws and frictional properties, and “graphical” constraints arising from uncertainty in the network structure itself. Since the method is probabilistic, it enables the prediction of network properties when there is insufficient information to obtain a deterministic solution. The derived framework can incorporate nonlinear constraints or nonlinear interdependencies between variables, at the cost of requiring numerical solution. The theoretical foundations of the method are first presented, followed by its application to a variety of flow networks. View Full-Text

Keywords: maximum entropy analysis; flow network; probabilistic inference

Full Paper can be downloaded at: https://www.mdpi.com/1099-4300/21/8/776

This article belongs to the Special Issue Entropy Based Inference and Optimization in Machine Learning

Submitting to Entropy: https://susy.mdpi.com/??