Premium
Model structure analysis through graph theory: partition heuristics and feedback structure decomposition
Author(s) -
Oliva Rogelio
Publication year - 2004
Publication title -
system dynamics review
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.491
H-Index - 57
eISSN - 1099-1727
pISSN - 0883-7066
DOI - 10.1002/sdr.298
Subject(s) - heuristics , computer science , partition (number theory) , theoretical computer science , graph , graph theory , representation (politics) , basis (linear algebra) , graph partition , data structure , decomposition , algorithm , mathematical optimization , mathematics , ecology , geometry , combinatorics , politics , political science , law , biology , operating system , programming language
The argument of this article is that it is possible to focus on the structural complexity of system dynamics models to design a partition strategy that maximizes the test points between the model and the real world, and a calibration sequence that permits an incremental development of model condence. It further argues that graph theory could be used as a basis for making sense of the structural complexity of system dynamics models, and that this structure could be used as a basis for more formal analysis of dynamic complexity. After reviewing the graph representation of system structure, the article presents the rationale and algorithms for model partitions based on data availability and structural characteristics. Special attention is given to the decomposition of cycle partitions that contain all the model's feedback loops, and a unique and granular representation of feedback complexity is derived. The article concludes by identifying future research avenues in this arena. Copyright © 2004 John Wiley & Sons, Ltd.