Identifying key nodes in multilayer networks based on tensor decomposition

MultiCens: Multilayer network centrality measures to uncover molecular mediators of tissue-tissue communication

With the evolution of multicellularity, communication among cells in different tissues and organs became pivotal to life. Molecular basis of such communication has long been studied, but genome-wide screens for genes and other biomolecules mediating tissue-tissue signaling are lacking. To systematically identify inter-tissue mediators, we present a novel computational approach MultiCens (Multilayer/Multi-tissue network Centrality measures). Unlike single-layer network methods, MultiCens can distinguish within- vs. across-layer connectivity to quantify the "influence" of any gene in a tissue on a query set of genes of interest in another tissue. MultiCens enjoys theoretical guarantees on convergence and decomposability, and performs well on synthetic benchmarks. On human multi-tissue datasets, MultiCens predicts known and novel genes linked to hormones. MultiCens further reveals shifts in gene network architecture among four brain regions in Alzheimer's disease. MultiCens-prioritized hypotheses from these two diverse applications, and potential future ones like "Multi-tissue-expanded Gene Ontology" analysis, can enable whole-body yet molecular-level systems investigations in humans.

Network Analysis Reveals the Molecular Bases of Statin Pleiotropy That Vary with Genetic Background

Many approved drugs are pleiotropic: for example, statins, whose main cholesterol-lowering activity is complemented by anticancer and prodiabetogenic mechanisms involving poorly characterized genetic interaction networks. We investigated these using the Saccharomyces cerevisiae genetic model, where most genetic interactions known are limited to the statin-sensitive S288C genetic background. We therefore broadened our approach by investigating gene interactions to include two statin-resistant genetic backgrounds: UWOPS87-2421 and Y55. Networks were functionally focused by selection of HMG1 and BTS1 mevalonate pathway genes for detection of genetic interactions. Networks, multilayered by genetic background, were analyzed for key genes using network centrality (degree, betweenness, and closeness), pathway enrichment, functional community modules, and Gene Ontology. Specifically, we found modification genes related to dysregulated endocytosis and autophagic cell death. To translate results to human cells, human orthologues were searched for other drug targets, thus identifying candidates for synergistic anticancer bioactivity. IMPORTANCE Atorvastatin is a highly successful drug prescribed to lower cholesterol and prevent cardiovascular disease in millions of people. Though much of its effect comes from inhibiting a key enzyme in the cholesterol biosynthetic pathway, genes in this pathway interact with genes in other pathways, resulting in 15% of patients suffering painful muscular side effects and 50% having inadequate responses. Such multigenic complexity may be unraveled using gene networks assembled from overlapping pairs of genes that complement each other. We used the unique power of yeast genetics to construct genome-wide networks specific to atorvastatin bioactivity in three genetic backgrounds to represent the genetic variation and varying response to atorvastatin in human individuals. We then used algorithms to identify key genes and their associated FDA-approved drugs in the networks, which resulted in the distinction of drugs that may synergistically enhance the known anticancer activity of atorvastatin.

Identifying Tumor-Associated Genes from Bilayer Networks of DNA Methylation Sites and RNAs

Network theory has attracted much attention from the biological community because of its high efficacy in identifying tumor-associated genes. However, most researchers have focused on single networks of single omics, which have less predictive power. With the available multiomics data, multilayer networks can now be used in molecular research. In this study, we achieved this with the construction of a bilayer network of DNA methylation sites and RNAs. We applied the network model to five types of tumor data to identify key genes associated with tumors. Compared with the single network, the proposed bilayer network resulted in more tumor-associated DNA methylation sites and genes, which we verified with prognostic and KEGG enrichment analyses.

Fast computation of matrix function-based centrality measures for layer-coupled multiplex networks

Centrality measures identify and rank the most influential entities of complex networks. In this paper, we generalize matrix function-based centrality measures, which have been studied extensively for single-layer and temporal networks in recent years to layer-coupled multiplex networks. The layers of these networks can reflect different relationships and interactions between entities or changing interactions over time. We use the supra-adjacency matrix as network representation, which has already been used to generalize eigenvector centrality to temporal and multiplex networks. With a suitable choice of edge weights, the definition of single-layer matrix function-based centrality measures in terms of walks on networks carries over naturally to the multilayer case. In contrast to other walk-based centralities, matrix function-based centralities are parameterized measures, which have been shown to interpolate between (local) degree and (global) eigenvector centrality in the single-layer case. As the explicit evaluation of the involved matrix function expressions becomes infeasible for medium to large-scale networks, we present highly efficient approximation techniques from numerical linear algebra, which rely on Krylov subspace methods, Gauss quadrature, and stochastic trace estimation. We present extensive numerical studies on synthetic and real-world multiplex transportation, communication, and collaboration networks. The comparison with established multilayer centrality measures shows that our framework produces meaningful rankings of nodes, layers, and node-layer pairs. Furthermore, our experiments corroborate the linear computational complexity of the employed numerical methods in terms of the network size that is theoretically indicated under the assumption of sparsity in the supra-adjacency matrix. This excellent scalability allows the efficient treatment of large-scale networks with the number of node-layer pairs of order 10^{7} or higher.

A Dimensionality Reduction Algorithm for Unstructured Campus Big Data Fusion

Data modeling and dimensionality reduction are important research points in the field of big data. At present, there is no effective model to realize the consistent representation and fusion of different types of data of students in unstructured campus big data. In addition, in the process of big data processing, the amount of data is too large and the intermediate results are too complex, which seriously affects the efficiency of big data dimension reduction. To solve the above problems, this paper proposes an incremental high order singular value decomposition dimensionality (icHOSVD) reduction algorithm for unstructured campus big data. In this algorithm, the characteristics of audio, video, image and text data in unstructured campus student data are tensioned to form a sub-tensor model, and the semi-tensor product is used to fuse the sub-tensor model into a unified model as the individual student tensor model. On the basis of individual model fusion, the campus big data fusion model was segmented, and each segmented small tensor model was dimensioned by icHOSVD reduction to obtain an approximate tensor as the symmetric tensor that could replace the original tensor, so as to solve the problem of large volume of tensor fusion model and repeated calculation of intermediate results in data processing. The experimental results show that the proposed algorithm can effectively reduce the computational complexity and improve the performance compared with traditional data dimension reduction algorithms. The research results can be applied to campus big data analysis and decision-making.

Identifying Influencers in Social Networks

Social network analysis is a multidisciplinary research covering informatics, mathematics, sociology, management, psychology, etc. In the last decade, the development of online social media has provided individuals with a fascinating platform of sharing knowledge and interests. The emergence of various social networks has greatly enriched our daily life, and simultaneously, it brings a challenging task to identify influencers among multiple social networks. The key problem lies in the various interactions among individuals and huge data scale. Aiming at solving the problem, this paper employs a general multilayer network model to represent the multiple social networks, and then proposes the node influence indicator merely based on the local neighboring information. Extensive experiments on 21 real-world datasets are conducted to verify the performance of the proposed method, which shows superiority to the competitors. It is of remarkable significance in revealing the evolutions in social networks and we hope this work will shed light for more and more forthcoming researchers to further explore the uncharted part of this promising field.

Inferring Large-Scale Gene Regulatory Networks Using a Randomized Algorithm Based on Singular Value Decomposition

Reconstructing large-scale gene regulatory networks (GRNs) is a challenging problem in the field of computational biology. Various methods for inferring GRNs have been developed, but they fail to accurately infer GRNs with a large number of genes. Additionally, the existing evaluation indexes for evaluating the constructed networks have obvious disadvantages because GRNs in most biological systems are sparse. In this paper, we develop a new method for inferring GRNs based on randomized singular value decomposition (RSVD) and ordinary differential equation (ODE)-based optimization, denoted as IGRSVD, from large-scale time series data with noise. The three major contributions of this paper are as follows. First, the IGRSVD algorithm uses the RSVD to handle the noise and reduce the original large-scale data into small-scale problems. Second, we propose two new evaluated indexes, the expected value accuracy (EVA) and the expected value error (EVE), to evaluate the performance of inferred networks by considering the sparse features in the network. Finally, the proposed IGRSVD algorithm is compared with the existing SVD algorithm and PCA_CMI algorithm using four subsets from E. coli and datasets from DREAM challenge. The experimental results demonstrate that the IGRSVD algorithm is effective and more suitable for reconstructing large-scale networks.

Several Indicators of Critical Transitions for Complex Diseases Based on Stochastic Analysis

Many complex diseases (chronic disease onset, development and differentiation, self-assembly, etc.) are reminiscent of phase transitions in a dynamical system: quantitative changes accumulate largely unnoticed until a critical threshold is reached, which causes abrupt qualitative changes of the system. Understanding such nonlinear behaviors is critical to dissect the multiple genetic/environmental factors that together shape the genetic and physiological landscape underlying basic biological functions and to identify the key driving molecules. Based on stochastic differential equation (SDE) model, we theoretically derive three statistical indicators, that is, coefficient of variation (CV), transformed Pearson's correlation coefficient (TPC), and transformed probability distribution (TPD), to identify critical transitions and detect the early-warning signals of the phase transition in complex diseases. To verify the effectiveness of these early-warning indexes, we use high-throughput data for three complex diseases, including influenza caused by either H3N2 or H1N1 and acute lung injury, to extract the dynamical network biomarkers (DNBs) responsible for catastrophic transition into the disease state from predisease state. The numerical results indicate that the derived indicators provide a data-based quantitative analysis for early-warning signals for critical transitions in complex diseases or other dynamical systems.