Network analysis and cluster of the isolated complications.
COMPLICATION
A network analysis was performed by taking each isolated complication as the “node” of the network, and the correlation coefficient (by Spearman’s correlation) between (connected) the nodes as the “edge.” The relationship between the nodes was then calculated and analyzed using an IsingFit model for binary variables in which the edges were akin to partial correlations.Node centrality (quantifying the importance of a node in the network) was calculated to describe the network, including node strength (quantifying how strongly a node connected directly to another), closeness (quantifying how strongly a node connected indirectly to another), and betweenness (quantifying the importance of a node in the average path between two other nodes). Strength was the main evaluation indicator of node centrality. The correlation–stability coefficient (0-0.24, poor; 0.25–0.49, fine; 0.50–0.75, preferable; 0.76-1, good) by case-dropping subset bootstrap was used to test node centrality stability. The accuracy of edge weight (quantifying how strong/weak and positive/negative the relationships were between the nodes) was evaluated. Clusters of local strongly interconnected nodes were identified using the Spinglass algorithm.