| Literature DB >> 36186866 |
Nina S de Boer1, Daniel Kostić2, Marcos Ross3, Leon de Bruin1,4, Gerrit Glas3.
Abstract
In this paper, we explore the conceptual problems that arise when using network analysis in person-centered care (PCC) in psychiatry. Personalized network models are potentially helpful tools for PCC, but we argue that using them in psychiatric practice raises boundary problems, i.e., problems in demarcating what should and should not be included in the model, which may limit their ability to provide clinically-relevant knowledge. Models can have explanatory and representational boundaries, among others. We argue that perspectival reasoning can make more explicit what questions personalized network models can address in PCC, given their boundaries.Entities:
Keywords: boundary problem; network analysis; person-centered care; personalized models; perspectivism; psychiatry; topological explanation
Year: 2022 PMID: 36186866 PMCID: PMC9523016 DOI: 10.3389/fpsyt.2022.925187
Source DB: PubMed Journal: Front Psychiatry ISSN: 1664-0640 Impact factor: 5.435
Figure 1A hypothetical example to illustrate the influence of node selection on local topological properties in a network. In (A), we see a hypothetical network that consists of six nodes. (B) demonstrates that node 3 has the highest node degree, closeness centrality, and betweenness centrality. (C) shows the same network in which node 3 is removed. (D) shows the influence of this removal on the network's centrality measures. Now, nodes 4–6 have the highest node degree, and node 4 has the highest closeness and betweenness centrality. Moreover, the betweenness centrality values of nodes 5 and 6 have strongly increased.
|
| |
| Path length | The number of edges required to get from one node to another. |
| Node degree | The sum of edges maintained by a single node. |
| Betweenness centrality | The relative number of shortest paths between any pair of nodes passing through a node ( |
| Closeness centrality | The average shortest distance from a node to all other nodes in a network ( |
| Eigenvector centrality | The extent to which a node is connected to central nodes. It is proportional to the sum of the degrees of a node's neighbors ( |
|
| |
| Local clustering coefficient | The number of pairs of neighbors of a node that are directly connected, divided by the number of potential pairs of nodes in that neighborhood ( |
| Community detection | Means of detecting whether a network is subdivided into separate (non-overlapping, interconnected) modules ( |
|
| |
| Global degree | The average sum of edges maintained by the nodes in the network ( |
| Network density | The edges that are present in a network, relative to the number of potential edges ( |
| Small-worldness | The ratio of clustering coefficient to path length ( |
| Global clustering | The mean of local clustering coefficients ( |