Calculating maximum entropy flows in networks

T. T. Tanyimboh; A. B. Templeman

doi:10.2307/2584416

Calculating maximum entropy flows in networks

T. T. Tanyimboh, A. B. Templeman

Civil And Environmental Engineering

Research output: Contribution to journal › Article › peer-review

84 Citations (Scopus)

116 Downloads (Pure)

Abstract

This paper describes methods for calculating the most likely values of link flows in networks with incomplete data. The object is to present a thorough and rigorous treatment of maximum entropy flow estimation methods and to develop a methodological framework capable of handling different types of network problems. A multiple probability space conditional entropy approach is described for the general network problem. Results are presented and discussed for an example network intended for water supply.

Original language	English
Pages (from-to)	383-396
Number of pages	14
Journal	Journal of the Operational Research Society
Volume	44
Issue number	4
DOIs	https://doi.org/10.2307/2584416
Publication status	Published - Apr 1993

Keywords

networks
information theory
engineering
probability

Access to Document

10.2307/2584416

Tanyimboh-Templeman-JORS1993-calculating-maximum-entropy-flows-in-networksAccepted author manuscript, 6.85 MB

Cite this

@article{9fa55413b38b4b27960bf29d85302862,

title = "Calculating maximum entropy flows in networks",

abstract = "This paper describes methods for calculating the most likely values of link flows in networks with incomplete data. The object is to present a thorough and rigorous treatment of maximum entropy flow estimation methods and to develop a methodological framework capable of handling different types of network problems. A multiple probability space conditional entropy approach is described for the general network problem. Results are presented and discussed for an example network intended for water supply.",

keywords = "networks, information theory, engineering, probability",

author = "Tanyimboh, {T. T.} and Templeman, {A. B.}",

note = "This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version Calculating Maximum Entropy Flows in Networks, T. T. Tanyimboh and A. B. Templeman, The Journal of the Operational Research Society, Vol. 44, No. 4, New Research Directions (Apr. 1993), pp. 383-396, is available online at: http://www.jstor.org/stable/2584416",

year = "1993",

month = apr,

doi = "10.2307/2584416",

language = "English",

volume = "44",

pages = "383--396",

journal = "Journal of Operational Research Society",

issn = "0160-5682",

number = "4",

}

TY - JOUR

T1 - Calculating maximum entropy flows in networks

AU - Tanyimboh, T. T.

AU - Templeman, A. B.

N1 - This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version Calculating Maximum Entropy Flows in Networks, T. T. Tanyimboh and A. B. Templeman, The Journal of the Operational Research Society, Vol. 44, No. 4, New Research Directions (Apr. 1993), pp. 383-396, is available online at: http://www.jstor.org/stable/2584416

PY - 1993/4

Y1 - 1993/4

N2 - This paper describes methods for calculating the most likely values of link flows in networks with incomplete data. The object is to present a thorough and rigorous treatment of maximum entropy flow estimation methods and to develop a methodological framework capable of handling different types of network problems. A multiple probability space conditional entropy approach is described for the general network problem. Results are presented and discussed for an example network intended for water supply.

AB - This paper describes methods for calculating the most likely values of link flows in networks with incomplete data. The object is to present a thorough and rigorous treatment of maximum entropy flow estimation methods and to develop a methodological framework capable of handling different types of network problems. A multiple probability space conditional entropy approach is described for the general network problem. Results are presented and discussed for an example network intended for water supply.

KW - networks

KW - information theory

KW - engineering

KW - probability

UR - http://www.jstor.org/action/showPublication?journalCode=joperresesoci

U2 - 10.2307/2584416

DO - 10.2307/2584416

M3 - Article

VL - 44

SP - 383

EP - 396

JO - Journal of Operational Research Society

JF - Journal of Operational Research Society

SN - 0160-5682

IS - 4

ER -

Calculating maximum entropy flows in networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Maximum entropy flows for single-source networks

Cite this