Node Centrality Measures Identify Relevant Structural MRI Features of Subjects with Autism.
Ontology highlight
ABSTRACT:
SUBMITTER: Zanghieri M
PROVIDER: S-EPMC8071038 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics.
| S-EPMC4246206 | biostudies-literature
Project description:Node centralities such as Degree and Betweenness help detecting influential nodes from local or global view. Existing global centrality measures suffer from the high computational complexity and unrealistic assumptions, limiting their applications on real-world applications. In this paper, we propose a new centrality measure, Node Conductance, to effectively detect spanning structural hole nodes and predict the formation of new edges. Node Conductance is the sum of the probability that node i is revisited at r-th step, where r is an integer between 1 and infinity. Moreover, with the help of node embedding techniques, Node Conductance is able to be approximately calculated on big networks effectively and efficiently. Thorough experiments present the differences between existing centralities and Node Conductance, its outstanding ability of detecting influential nodes on both static and dynamic network, and its superior efficiency compared with other global centralities. Electronic supplementary material The online version of this chapter (10.1007/978-3-030-47436-2_40) contains supplementary material, which is available to authorized users.
| S-EPMC7206264 | biostudies-literature
Project description:Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with N nodes as a sequence of T layers that describe the network during different time windows, and we couple centrality matrices for the layers into a supra-centrality matrix of size NT × NT whose dominant eigenvector gives the centrality of each node i at each time t. We refer to this eigenvector and its components as a joint centrality, as it reflects the importances of both the node i and the time layer t. We also introduce the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time. We find that the strength of coupling between layers is important for determining multiscale properties of centrality, such as localization phenomena and the time scale of centrality changes. In the strong-coupling regime, we derive expressions for time-averaged centralities, which are given by the zeroth-order terms of a singular perturbation expansion. We also study first-order terms to obtain first-order-mover scores, which concisely describe the magnitude of nodes' centrality changes over time. As examples, we apply our method to three empirical temporal networks: the United States Ph.D. exchange in mathematics, costarring relationships among top-billed actors during the Golden Age of Hollywood, and citations of decisions from the United States Supreme Court.
| S-EPMC5643020 | biostudies-literature
Project description:Global supply networks in agriculture, manufacturing, and services are a defining feature of the modern world. The efficiency and the distribution of surpluses across different parts of these networks depend on the choices of intermediaries. This paper conducts price formation experiments with human subjects located in large complex networks to develop a better understanding of the principles governing behavior. Our first experimental finding is that prices are larger and that trade is significantly less efficient in small-world networks as compared to random networks. Our second experimental finding is that location within a network is not an important determinant of pricing. An examination of the price dynamics suggests that traders on cheapest-and hence active-paths raise prices while those off these paths lower them. We construct an agent-based model (ABM) that embodies this rule of thumb. Simulations of this ABM yield macroscopic patterns consistent with the experimental findings. Finally, we extrapolate the ABM on to significantly larger random and small-world networks and find that network topology remains a key determinant of pricing and efficiency.
| S-EPMC7338384 | biostudies-literature
Project description:Walks around a graph are studied in a wide range of fields, from graph theory and stochastic analysis to theoretical computer science and physics. In many cases it is of interest to focus on non-backtracking walks; those that do not immediately revisit their previous location. In the network science context, imposing a non-backtracking constraint on traditional walk-based node centrality measures is known to offer tangible benefits. Here, we use the Hashimoto matrix construction to characterize, generalize and study such non-backtracking centrality measures. We then devise a recursive extension that systematically removes triangles, squares and, generally, all cycles up to a given length. By characterizing the spectral radius of appropriate matrix power series, we explore how the universality results on the limiting behaviour of classical walk-based centrality measures extend to these non-cycling cases. We also demonstrate that the new recursive construction gives rise to practical centrality measures that can be applied to large-scale networks.
| S-EPMC7125983 | biostudies-literature
Project description:This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP's have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice.
| S-EPMC4738330 | biostudies-other
Project description:Accurate diagnosis of the initial phase of Alzheimer's disease (AD) is essential and crucial. The objective of this research was to employ efficient biomarkers for the diagnostic analysis and classification of AD based on combining structural MRI (sMRI) and resting-state functional MRI (rs-fMRI). So far, several anatomical MRI imaging markers for AD diagnosis have been identified. The use of cortical and subcortical volumes, the hippocampus, and amygdala volume, as well as genetic patterns, has proven to be beneficial in distinguishing patients with AD from the healthy population. The fMRI time series data have the potential for specific numerical information as well as dynamic temporal information. Voxel and graphical analyses have gained popularity for analyzing neurodegenerative diseases, such as Alzheimer's and its prodromal phase, mild cognitive impairment (MCI). So far, these approaches have been utilized separately for the diagnosis of AD. In recent studies, the classification of cases of MCI into those that are not converted for a certain period as stable MCI (MCIs) and those that converted to AD as MCIc has been less commonly reported with inconsistent results. In this study, we verified and validated the potency of a proposed diagnostic framework to identify AD and differentiate MCIs from MCIc by utilizing the efficient biomarkers obtained from sMRI, along with functional brain networks of the frequency range .01-.027 at the resting state and the voxel-based features. The latter mainly included default mode networks (amplitude of low-frequency fluctuation [ALFF], fractional ALFF [ALFF], and regional homogeneity [ReHo]), degree centrality (DC), and salience networks (SN). Pearson's correlation coefficient for measuring fMRI functional networks has proven to be an efficient means for disease diagnosis. We applied the graph theory to calculate nodal features (nodal degree [ND], nodal path length [NL], and between centrality [BC]) as a graphical feature and analyzed the connectivity link between different brain regions. We extracted three-dimensional (3D) patterns to calculate regional coherence and then implement a univariate statistical t-test to access a 3D mask that preserves voxels showing significant changes. Similarly, from sMRI, we calculated the hippocampal subfield and amygdala nuclei volume using Freesurfer (version 6). Finally, we implemented and compared the different feature selection algorithms to integrate the structural features, brain networks, and voxel features to optimize the diagnostic identifications of AD using support vector machine (SVM) classifiers. We also compared the performance of SVM with Random Forest (RF) classifiers. The obtained results demonstrated the potency of our framework, wherein a combination of the hippocampal subfield, the amygdala volume, and brain networks with multiple measures of rs-fMRI could significantly enhance the accuracy of other approaches in diagnosing AD. The accuracy obtained by the proposed method was reported for binary classification. More importantly, the classification results of the less commonly reported MCIs vs. MCIc improved significantly. However, this research involved only the AD Neuroimaging Initiative (ADNI) cohort to focus on the diagnosis of AD advancement by integrating sMRI and fMRI. Hence, the study's primary disadvantage is its small sample size. In this case, the dataset we utilized did not fully reflect the whole population. As a result, we cannot guarantee that our findings will be applicable to other populations.
| S-EPMC9190953 | biostudies-literature
Project description:In order to understand and represent the importance of nodes within networks better, most of the studies that investigate graphs compute the nodes' centrality within their network(s) of interest. In the literature, the most frequent measures used are degree, closeness and/or betweenness centrality, even if other measures might be valid candidates for representing the importance of nodes within networks. The main contribution of this paper is the development of a methodology that allows one to understand, compare and validate centrality indices when studying a particular network of interest. The proposed methodology integrates the following steps: choosing the centrality measures for the network of interest; developing a theoretical taxonomy of these measures; identifying, by means of Principal Component Analysis (PCA), latent dimensions of centrality within the network of interest; verifying the proposed taxonomy of centrality measures; and identifying the centrality measures that best represent the network of interest. Also, we applied the proposed methodology to an existing graph of interest, in our case a real friendship student network. We chose eighteen centrality measures that were developed in SNA and are available and computed in a specific library (CINNA), defined them thoroughly, and proposed a theoretical taxonomy of these eighteen measures. PCA showed the emergence of six latent dimensions of centrality within the student network and saturation of most of the centrality indices on the same categories as those proposed by the theoretical taxonomy. Additionally, the results suggest that indices other than the ones most frequently applied might be more relevant for research on friendship student networks. Finally, the integrated methodology that we propose can be applied to other centrality indices and/or other network types than student graphs.
| S-EPMC7773201 | biostudies-literature
Project description:Gene set enrichment analysis (GSEA) is a powerful tool to associate a disease phenotype to a group of genes/proteins. GSEA attributes a specific weight to each gene/protein in the input list that depends on a metric of choice, which is usually represented by quantitative expression data. However, expression data are not always available. Here, GSEA based on betweenness centrality of a protein-protein interaction (PPI) network is described and applied to two cases, where an expression metric is missing. First, personalized PPI networks were generated from genes displaying alterations (assessed by array comparative genomic hybridization and whole exome sequencing) in four probands bearing a 16p13.11 microdeletion in common and several other point variants. Patients showed disease phenotypes linked to neurodevelopment. All networks were assembled around a cluster of first interactors of altered genes with high betweenness centrality. All four clusters included genes known to be involved in neurodevelopmental disorders with different centrality. Moreover, the GSEA results pointed out to the evidence of "cell cycle" among enriched pathways. Second, a large interaction network obtained by merging proteomics studies on three neurodegenerative disorders was analyzed from the topological point of view. We observed that most central proteins are often linked to Parkinson's disease. The selection of these proteins improved the specificity of GSEA, with "Metabolism of amino acids and derivatives" and "Cellular response to stress or external stimuli" as top-ranked enriched pathways. In conclusion, betweenness centrality revealed to be a suitable metric for GSEA. Thus, centrality-based GSEA represents an opportunity for precision medicine and network medicine.
| S-EPMC7943873 | biostudies-literature
Project description:Focal lesions can affect connectivity between distal brain regions (connectional diaschisis) and impact the graph-theoretic properties of major brain networks (connectomic diaschisis). Given its unique anatomy and diverse range of functions, the hippocampus has been claimed to be a critical "hub" in brain networks. We investigated the effects of hippocampal lesions on structural and functional connectivity in six patients with amnesia, using a range of magnetic resonance imaging (MRI) analyses. Neuropsychological assessment revealed marked episodic memory impairment and generally intact performance across other cognitive domains. The hippocampus was the only brain structure exhibiting reduced grey-matter volume that was consistent across patients, and the fornix was the only major white-matter tract to show altered structural connectivity according to both diffusion metrics. Nonetheless, functional MRI revealed both increases and decreases in functional connectivity. Analysis at the level of regions within the default-mode network revealed reduced functional connectivity, including between nonhippocampal regions (connectional diaschisis). Analysis at the level of functional networks revealed reduced connectivity between thalamic and precuneus networks, but increased connectivity between the default-mode network and frontal executive network. The overall functional connectome showed evidence of increased functional segregation in patients (connectomic diaschisis). Together, these results point to dynamic reorganization following hippocampal lesions, with both decreased and increased functional connectivity involving limbic-diencephalic structures and larger-scale networks. © 2016 The Authors Hippocampus Published by Wiley Periodicals, Inc.
| S-EPMC5082505 | biostudies-other