A graph-traversal approach to identify influential nodes in a network.
Ontology highlight
ABSTRACT:
SUBMITTER: Liu Y
PROVIDER: S-EPMC8441579 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The network approach to psychopathology conceptualizes mental disorders as networks of mutually reinforcing nodes (i.e., symptoms). Researchers adopting this approach have suggested that network topology can be used to identify influential nodes, with nodes central to the network having the greatest influence on the development and maintenance of the disorder. However, because commonly used centrality indices do not distinguish between positive and negative edges, they may not adequately assess the nature and strength of a node's influence within the network. To address this limitation, we developed 2 indices of a node's expected influence (EI) that account for the presence of negative edges. To evaluate centrality and EI indices, we simulated single-node interventions on randomly generated networks. In networks with exclusively positive edges, centrality and EI were both strongly associated with observed node influence. In networks with negative edges, EI was more strongly associated with observed influence than was centrality. We then used data from a longitudinal study of bereavement to examine the association between (a) a node's centrality and EI in the complicated grief (CG) network and (b) the strength of association between change in that node and change in the remainder of the CG network from 6- to 18-months postloss. Centrality and EI were both correlated with the strength of the association between node change and network change. Together, these findings suggest high-EI nodes, such as emotional pain and feelings of emptiness, may be especially important to the etiology and treatment of CG. (PsycINFO Database Record
| S-EPMC5060093 | biostudies-literature
Project description:Identifying influential nodes is an important topic in many diverse applications, such as accelerating information propagation, controlling rumors and diseases. Many methods have been put forward to identify influential nodes in complex networks, ranging from node centrality to diffusion-based processes. However, most of the previous studies do not take into account overlapping communities in networks. In this paper, we propose an effective method based on network representation learning. The method considers not only the overlapping communities in networks, but also the network structure. Experiments on real-world networks show that the proposed method outperforms many benchmark algorithms and can be used in large-scale networks.
| S-EPMC6037365 | biostudies-literature
Project description:Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1) determine persvasively overlapping modules with high resolution; (2) uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3) allow the determination of key network nodes and (4) help to predict network dynamics. The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction.
| S-EPMC2932713 | biostudies-literature
Project description:Understanding and controlling spreading processes in networks is an important topic with many diverse applications, including information dissemination, disease propagation and viral marketing. It is of crucial importance to identify which entities act as influential spreaders that can propagate information to a large portion of the network, in order to ensure efficient information diffusion, optimize available resources or even control the spreading. In this work, we capitalize on the properties of the K-truss decomposition, a triangle-based extension of the core decomposition of graphs, to locate individual influential nodes. Our analysis on real networks indicates that the nodes belonging to the maximal K-truss subgraph show better spreading behavior compared to previously used importance criteria, including node degree and k-core index, leading to faster and wider epidemic spreading. We further show that nodes belonging to such dense subgraphs, dominate the small set of nodes that achieve the optimal spreading in the network.
| S-EPMC4725982 | biostudies-literature
Project description:Many biological processes are controlled by intricate networks of transcriptional regulators. With the development of microarray technology, transcriptional changes can be examined at the whole-genome level. However, such analysis often lacks information on the hierarchical relationship between components of a given system. Systemic acquired resistance (SAR) is an inducible plant defense response involving a cascade of transcriptional events induced by salicylic acid through the transcription cofactor NPR1. To identify additional regulatory nodes in the SAR network, we performed microarray analysis on Arabidopsis plants expressing the NPR1-GR (glucocorticoid receptor) fusion protein. Since nuclear translocation of NPR1-GR requires dexamethasone, we were able to control NPR1-dependent transcription and identify direct transcriptional targets of NPR1. We show that NPR1 directly upregulates the expression of eight WRKY transcription factor genes. This large family of 74 transcription factors has been implicated in various defense responses, but no specific WRKY factor has been placed in the SAR network. Identification of NPR1-regulated WRKY factors allowed us to perform in-depth genetic analysis on a small number of WRKY factors and test well-defined phenotypes of single and double mutants associated with NPR1. Among these WRKY factors we found both positive and negative regulators of SAR. This genomics-directed approach unambiguously positioned five WRKY factors in the complex transcriptional regulatory network of SAR. Our work not only discovered new transcription regulatory components in the signaling network of SAR but also demonstrated that functional studies of large gene families have to take into consideration sequence similarity as well as the expression patterns of the candidates.
| S-EPMC1635530 | biostudies-literature
Project description:In complex networks, key nodes are important factors that directly affect network structure and functions. Therefore, accurate mining and identification of key nodes are crucial to achieving better control and a higher utilization rate of complex networks. To address this problem, this paper proposes an accurate and efficient algorithm for critical node mining. The influential nodes are determined using both global and local information (GLI) to solve the shortcoming of the existing key node identification methods that consider either local or global information. The proposed method considers two main factors, global and local influences. The global influence is determined using the K-shell hierarchical information of a node, and local influence is obtained considering the number of edges connected by the node and the given values of adjacent nodes. The given values of adjacent nodes are determined based on the degree and K-shell hierarchical information. Further, the similarity coefficient of neighbors is considered, which enhances the differentiation degree of the adjacent given values. The proposed method solves the problems of the high complexity of global information-based algorithms and the low accuracy of local information-based algorithms. The proposed method is verified by simulation experiments using the SIR and SI models as a reference, and twelve typical real-world networks are used for the comparison. The proposed GLI algorithm is compared with several common algorithms at different periods. The comparison results show that the GLI algorithm can effectively explore influential nodes in complex networks.
| S-EPMC9800360 | biostudies-literature
Project description:With great theoretical and practical significance, locating influential nodes of complex networks is a promising issue. In this paper, we present a dynamics-sensitive (DS) centrality by integrating topological features and dynamical properties. The DS centrality can be directly applied in locating influential spreaders. According to the empirical results on four real networks for both susceptible-infected-recovered (SIR) and susceptible-infected (SI) spreading models, the DS centrality is more accurate than degree, k-shell index and eigenvector centrality.
| S-EPMC4764903 | biostudies-other
Project description:Sound is a potent elicitor of emotions. Auditory core, belt and parabelt regions have anatomical connections to a large array of limbic and paralimbic structures which are involved in the generation of affective activity. However, little is known about the functional role of auditory cortical regions in emotion processing. Using functional magnetic resonance imaging and music stimuli that evoke joy or fear, our study reveals that anterior and posterior regions of auditory association cortex have emotion-characteristic functional connectivity with limbic/paralimbic (insula, cingulate cortex, and striatum), somatosensory, visual, motor-related, and attentional structures. We found that these regions have remarkably high emotion-characteristic eigenvector centrality, revealing that they have influential positions within emotion-processing brain networks with "small-world" properties. By contrast, primary auditory fields showed surprisingly strong emotion-characteristic functional connectivity with intra-auditory regions. Our findings demonstrate that the auditory cortex hosts regions that are influential within networks underlying the affective processing of auditory information. We anticipate our results to incite research specifying the role of the auditory cortex-and sensory systems in general-in emotion processing, beyond the traditional view that sensory cortices have merely perceptual functions.
| S-EPMC5791961 | biostudies-literature
Project description:Antigen presentation on MHC class II (pMHCII presentation) plays an essential role in the adaptive immune response to extracellular pathogens and cancerous cells. But it can also reduce the efficacy of large-molecule drugs by triggering an anti-drug response. Significant progress has been made in pMHCII presentation modeling due to the collection of large-scale pMHC mass spectrometry datasets (ligandomes) and advances in machine learning. Here, we develop graph-pMHC, a graph neural network approach to predict pMHCII presentation. We derive adjacency matrices for pMHCII using Alphafold2-multimer and address the peptide-MHC binding groove alignment problem with a simple graph enumeration strategy. We demonstrate that graph-pMHC dramatically outperforms methods with suboptimal inductive biases, such as the multilayer-perceptron-based NetMHCIIpan-4.0 (+20.17% absolute average precision). Finally, we create an antibody drug immunogenicity dataset from clinical trial data and develop a method for measuring anti-antibody immunogenicity risk using pMHCII presentation models. Our model increases receiver operating characteristic curve (ROC)-area under the ROC curve (AUC) by 2.57% compared to just filtering peptides by hits in OASis alone for predicting antibody drug immunogenicity.
| S-EPMC10981672 | biostudies-literature
Project description:Calculating the importance of influential nodes and ranking them based on their diffusion power is one of the open issues and critical research fields in complex networks. It is essential to identify an attribute that can compute and rank the diffusion power of nodes with high accuracy, despite the plurality of nodes and many relationships between them. Most methods presented only use one structural attribute to capture the influence of individuals, which is not entirely accurate in most networks. The reason is that network structures are disparate, and these methods will be inefficient by altering the network. A possible solution is to use more than one attribute to examine the characteristics aspect and address the issue mentioned. Therefore, this study presents a method for identifying and ranking node’s ability to spread information. The purpose of this study is to present a multi-attribute decision making approach for determining diffusion power and classification of nodes, which uses several local and semi-local attributes. Local and semi-local attributes with linear time complexity are used, considering different aspects of the network nodes. Evaluations performed on datasets of real networks demonstrate that the proposed method performs satisfactorily in allocating distinct ranks to nodes; moreover, as the infection rate of nodes increases, the accuracy of the proposed method increases.
| S-EPMC9704601 | biostudies-literature