A mathematical basis for egress complexity Original Research Article

This paper demonstrates how a building, expressed as a well-defined structure of nodes and edges, can be shown to possess a latent complexity measure with respect to egress. The mathematical formulation, based on the notion of Shannon entropy, is underpinned by results from graph theory. The method of calculating egress complexity, its use in comparing buildings, and its application to the positioning of additional exits is discussed.