Distinct types of eigenvector localization in networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Pastor-Satorras R
PROVIDER: S-EPMC4709588 | biostudies-literature | 2016 Jan
REPOSITORIES: biostudies-literature
Publications
Distinct types of eigenvector localization in networks.
Pastor-Satorras Romualdo R Castellano Claudio C
Scientific reports 20160112
The spectral properties of the adjacency matrix provide a trove of information about the structure and function of complex networks. In particular, the largest eigenvalue and its associated principal eigenvector are crucial in the understanding of nodes' centrality and the unfolding of dynamical processes. Here we show that two distinct types of localization of the principal eigenvector may occur in heterogeneous networks. For synthetic networks with degree distribution P(q) ~ q(-γ), localizatio ...[more]
Similar Datasets
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:Centrality is widely recognized as one of the most critical measures to provide insight into the structure and function of complex networks. While various centrality measures have been proposed for single-layer networks, a general framework for studying centrality in multilayer networks (i.e., multicentrality) is still lacking. In this study, a tensor-based framework is introduced to study eigenvector multicentrality, which enables the quantification of the impact of interlayer influence on multicentrality, providing a systematic way to describe how multicentrality propagates across different layers. This framework can leverage prior knowledge about the interplay among layers to better characterize multicentrality for varying scenarios. Two interesting cases are presented to illustrate how to model multilayer influence by choosing appropriate functions of interlayer influence and design algorithms to calculate eigenvector multicentrality. This framework is applied to analyze several empirical multilayer networks, and the results corroborate that it can quantify the influence among layers and multicentrality of nodes effectively.
| S-EPMC6681706 | biostudies-literature
Project description:Exploration permits acquisition of the most relevant information during learning. However, the specific information needed, the influences of this information on decision making, and the relevant neural mechanisms remain poorly understood. We modeled distinct information types available during contextual association learning and used model-based fMRI in conjunction with manipulation of exploratory decision making to identify neural activity associated with information-based decisions. We identified hippocampal-prefrontal contributions to advantageous decisions based on immediately available novel information, distinct from striatal contributions to advantageous decisions based on the sum total available (accumulated) information. Furthermore, network-level interactions among these regions during exploratory decision making were related to learning success. These findings link strategic exploration decisions during learning to quantifiable information and advance understanding of adaptive behavior by identifying the distinct and interactive nature of brain-network contributions to decisions based on distinct information types.
| S-EPMC4081497 | biostudies-literature
Project description:BackgroundThe molecular profiles exhibited in different cancer types are very different; hence, discovering distinct functional modules associated with specific cancer types is very important to understand the distinct functions associated with them. Protein-protein interaction networks carry vital information about molecular interactions in cellular systems, and identification of functional modules (subgraphs) in these networks is one of the most important applications of biological network analysis.ResultsIn this study, we developed a new graph theory based method to identify distinct functional modules from nine different cancer protein-protein interaction networks. The method is composed of three major steps: (i) extracting modules from protein-protein interaction networks using network clustering algorithms; (ii) identifying distinct subgraphs from the derived modules; and (iii) identifying distinct subgraph patterns from distinct subgraphs. The subgraph patterns were evaluated using experimentally determined cancer-specific protein-protein interaction data from the Ingenuity knowledgebase, to identify distinct functional modules that are specific to each cancer type.ConclusionWe identified cancer-type specific subgraph patterns that may represent the functional modules involved in the molecular pathogenesis of different cancer types. Our method can serve as an effective tool to discover cancer-type specific functional modules from large protein-protein interaction networks.
| S-EPMC4606133 | biostudies-literature
Project description:Noise, or uncertainty in biochemical networks, has become an important aspect of many biological problems. Noise can arise and propagate from external factors and probabilistic chemical reactions occurring in small cellular compartments. For species survival, it is important to regulate such uncertainties in executing vital cell functions. Regulated noise can improve adaptability, whereas uncontrolled noise can cause diseases. Simulation can provide a detailed analysis of uncertainties, but parameters such as rate constants and initial conditions are usually unknown. A general understanding of noise dynamics from the perspective of network structure is highly desirable. In this study, we extended the previously developed law of localization for characterizing noise in terms of (co)variances and developed noise localization theory. With linear noise approximation, we can expand a biochemical network into an extended set of differential equations representing a fictitious network for pseudo-components consisting of variances and covariances, together with chemical species. Through localization analysis, perturbation responses at the steady state of pseudo-components can be summarized into a sensitivity matrix that only requires knowledge of network topology. Our work allows identification of buffering structures at the level of species, variances, and covariances and can provide insights into noise flow under non-steady-state conditions in the form of a pseudo-chemical reaction. We tested noise localization in various systems, and here we discuss its implications and potential applications. Results show that this theory is potentially applicable in discriminating models, scanning network topologies with interesting noise behavior, and designing and perturbing networks with the desired response.
| S-EPMC9878546 | biostudies-literature
Project description:The graph realization problem has received a great deal of attention in recent years, due to its importance in applications such as wireless sensor networks and structural biology. In this paper, we extend the previous work and propose the 3D-As-Synchronized-As-Possible (3D-ASAP) algorithm, for the graph realization problem in ?3, given a sparse and noisy set of distance measurements. 3D-ASAP is a divide and conquer, non-incremental and non-iterative algorithm, which integrates local distance information into a global structure determination. Our approach starts with identifying, for every node, a subgraph of its 1-hop neighborhood graph, which can be accurately embedded in its own coordinate system. In the noise-free case, the computed coordinates of the sensors in each patch must agree with their global positioning up to some unknown rigid motion, that is, up to translation, rotation and possibly reflection. In other words, to every patch, there corresponds an element of the Euclidean group, Euc(3), of rigid transformations in ?3, and the goal was to estimate the group elements that will properly align all the patches in a globally consistent way. Furthermore, 3D-ASAP successfully incorporates information specific to the molecule problem in structural biology, in particular information on known substructures and their orientation. In addition, we also propose 3D-spectral-partitioning (SP)-ASAP, a faster version of 3D-ASAP, which uses a spectral partitioning algorithm as a pre-processing step for dividing the initial graph into smaller subgraphs. Our extensive numerical simulations show that 3D-ASAP and 3D-SP-ASAP are very robust to high levels of noise in the measured distances and to sparse connectivity in the measurement graph, and compare favorably with similar state-of-the-art localization algorithms.
| S-EPMC3889082 | biostudies-literature
Project description:In large random networks, each eigenvector of the Laplacian matrix tends to localize on a subset of network nodes having similar numbers of edges, namely, the components of each Laplacian eigenvector take relatively large values only on a particular subset of nodes whose degrees are close. Although this localization property has significant consequences for dynamical processes on random networks, a clear theoretical explanation has not yet been established. Here we analyze the origin of localization of Laplacian eigenvectors on random networks by using a perturbation theory. We clarify how heterogeneity in the node degrees leads to the eigenvector localization and that there exists a clear degree-eigenvalue correspondence, that is, the characteristic degrees of the localized nodes essentially determine the eigenvalues. We show that this theory can account for the localization properties of Laplacian eigenvectors on several classes of random networks, and argue that this localization should occur generally in networks with degree heterogeneity.
| S-EPMC5430689 | biostudies-literature
Project description:The localization of multiple scattering objects is performed while using scattered waves. An up-to-date approach: neural networks are used to estimate the corresponding locations. In the scattering phenomenon under investigation, we assume known incident plane waves, fully reflecting balls with known diameters and measurement data of the scattered wave on one fixed segment. The training data are constructed while using the simulation package μ-diff in Matlab. The structure of the neural networks, which are widely used for similar purposes, is further developed. A complex locally connected layer is the main compound of the proposed setup. With this and an appropriate preprocessing of the training data set, the number of parameters can be kept at a relatively low level. As a result, using a relatively large training data set, the unknown locations of the objects can be estimated effectively.
| S-EPMC7792608 | biostudies-literature
Project description:Biomarker estimation methods from medical images have traditionally followed a segment-and-measure strategy. Deep-learning regression networks have changed such a paradigm, enabling the direct estimation of biomarkers in databases where segmentation masks are not present. While such methods achieve high performance, they operate as a black-box. In this work, we present a novel deep learning network structure that, when trained with only the value of the biomarker, can perform biomarker regression and the generation of an accurate localization mask simultaneously, thus enabling a qualitative assessment of the image locus that relates to the quantitative result. We showcase the proposed method with three different network structures and compare their performance against direct regression networks in four different problems: pectoralis muscle area (PMA), subcutaneous fat area (SFA), liver mass area in single slice computed tomography (CT), and Agatston score estimated from non-contrast thoracic CT images (CAC). Our results show that the proposed method improves the performance with respect to direct biomarker regression methods (correlation coefficient of 0.978, 0.998, and 0.950 for the proposed method in comparison to 0.971, 0.982, and 0.936 for the reference regression methods on PMA, SFA and CAC respectively) while achieving good localization (DICE coefficients of 0.875, 0.914 for PMA and SFA respectively, p < 0.05 for all pairs). We observe the same improvement in regression results comparing the proposed method with those obtained by quantify the outputs using an U-Net segmentation network (0.989 and 0.951 respectively). We, therefore, conclude that it is possible to obtain simultaneously good biomarker regression and localization when training biomarker regression networks using only the biomarker value.
| S-EPMC7307703 | biostudies-literature
Project description:Using electroencephalography (EEG) to elucidate the spontaneous activation of brain resting-state networks (RSNs) is nontrivial as the signal of interest is of low amplitude and it is difficult to distinguish the underlying neural sources. Using the principles of electric field topographical analysis, it is possible to estimate the meta-stable states of the brain (i.e., the resting-state topographies, so-called microstates). We estimated seven resting-state topographies explaining the EEG data set with k-means clustering (N?=?164, 256 electrodes). Using a method specifically designed to localize the sources of broadband EEG scalp topographies by matching sensor and source space temporal patterns, we demonstrated that we can estimate the EEG RSNs reliably by measuring the reproducibility of our findings. After subtracting their mean from the seven EEG RSNs, we identified seven state-specific networks. The mean map includes regions known to be densely anatomically and functionally connected (superior frontal, superior parietal, insula, and anterior cingulate cortices). While the mean map can be interpreted as a "router," crosslinking multiple functional networks, the seven state-specific RSNs partly resemble and extend previous functional magnetic resonance imaging-based networks estimated as the hemodynamic correlates of four canonical EEG microstates.
| S-EPMC5736178 | biostudies-literature