| Literature DB >> 27788224 |
Jaimie McGlashan1,2, Michael Johnstone2, Doug Creighton2, Kayla de la Haye3, Steven Allender1.
Abstract
Causal loop diagrams developed by groups capture a shared understanding of complex problems and provide a visual tool to guide interventions. This paper explores the application of network analytic methods as a new way to gain quantitative insight into the structure of an obesity causal loop diagram to inform intervention design. Identification of the structural features of causal loop diagrams is likely to provide new insights into the emergent properties of complex systems and analysing central drivers has the potential to identify leverage points. The results found the structure of the obesity causal loop diagram to resemble commonly observed empirical networks known for efficient spread of information. Known drivers of obesity were found to be the most central variables along with others unique to obesity prevention in the community. While causal loop diagrams are often specific to single communities, the analytic methods provide means to contrast and compare multiple causal loop diagrams for complex problems.Entities:
Mesh:
Year: 2016 PMID: 27788224 PMCID: PMC5082925 DOI: 10.1371/journal.pone.0165459
Source DB: PubMed Journal: PLoS One ISSN: 1932-6203 Impact factor: 3.240
Structural network measures and their proposed interpretation for causal loop diagrams and intervention planning.
| Network Analysis Measure | Definition | Interpretation in CLD | Implication for Intervention Design |
|---|---|---|---|
| Fraction of edges present relative to the maximum possible number of edges given the set of nodes. | According to the group developing the diagram, the fraction of causal relationships that exist between pairs of variables that are identified (relative to the number of possible causal relationships, if each pair of variables was causally related). | In dense networks, change in one variable has a higher chance of causing change in other variables, and to other parts of the system. Sparse networks mean interventions likely need to ‘seed’ change in multiple parts of the network to impact the whole system. | |
| The distribution of number of edges leading to or exiting nodes in the network. | Distribution of how many causal relationships variables are involved in. | Nodes with the highest degree will act as ‘hubs’ in the network [ | |
| The smallest number of ties between any two nodes in the network, on average. | Informs the interconnectedness of the CLD and its efficiency to spread change from one variable to another. | A small average path length may allow a change in one variable to cause change in others with a small amount of effort, on average. | |
| The strength of the division of node clusters in the network, which have dense inter-connections but are sparsely connected to nodes outside of the cluster [ | Detects structural clusters in the map, which may correspond to variable themes, and measures how segregated the clusters are from each other. | If modularity is high interventions should seed change within distinct clusters and focus on variables with high betweenness centrality to facilitate the spillover of system-wide change across variables in the network. |
Fig 1Individual node metrics: In-degree, Out-degree and Betweenness centrality interpretations for a causal loop diagram.
Fig 2Community developed CLD of obesity drivers displayed as a directed network.
Summary of network statistics for the CLD.
| Nodes | Edges | Density | Av. Path Length | Modularity |
|---|---|---|---|---|
| 114 | 209 | 0.016 | 4.65 | 0.56 |
Fig 3Distribution of node in and out degree (number of in and out bound edges for each node) for the community developed obesity CLD.
Fig 4A summary of the relationships to and from the variables with the highest in-degree and out-degree in the system, respectively.
Fig 5Variables with the highest betweenness centrality- the ‘mediators’ of the causal loop diagram shown (a) by node size in the network, (b) the distribution of values and (c) a table of values for nodes with the highest betweenness centrality.