The complexity coefficient for acyclic networks measuring network density: Application to project management
DOI:
https://doi.org/10.14738/assrj.62.6200Abstract
A complexity coefficient applied to acyclic networks for project management measuring network density, not its structure, is presented, analyzed and discussed. Both the Activity on Arc (AOA) and the Activity on Node (AON) paradigms are considered. Based on the restriction that the project network needs to be acyclic, it is possible to define strict bounds to the complexity coefficient. In this case, the complexity coefficient, named eta, varies between zero and one, and measures only network density.
References
Dehmer, M., Barbarini, N., Varmuza, K., & Graber, A. (2009). A Large Scale Analysis of Information-Theoretic Network Complexity Measures Using Chemical Structures. PLOS One, 4(12), 1-13.
Elsayed, E. A. & Boucher, T. O. (1994). Analysis and control of production systems. Prentice Hall.
Emmert-Streib, F. & Dehmer, M. (2012). Exploring Statistical and Population Aspects of Network Complexity. PLOS One, 7(5), 1-17.
Kaimann, R. (1974). Coefficient of Network Complexity. Management Science, 21(2), 172-177.
Keller, C., Berger, F., Liepelt, S., & Lipowsky, R. (2013). Network Complexity and Parametric Simplicity for Cargo Transport by Two Molecular Motors. Journal of Statistical Physicsk¸150, 205-234.
Rigterink, D. & Singer, D. J. (2014). A network complexity metric based on planarity and community structure. Journal of Complex Networks, 2, 299-312.
Zenil, H., Kiani, N. A., & Tegnér, J. (2018). A Review of Graph and Network Complexity from an Algorithmic Information Perspective. Entropy, 20, 1-15.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Advances in Social Sciences Research Journal
This work is licensed under a Creative Commons Attribution 4.0 International License.
