Browse
Submit Data
Databases
API
Help

Dataset Information

30 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Topology Effects on Sparse Control of Complex Networks with Laplacian Dynamics.

ABSTRACT: Ease of control of complex networks has been assessed extensively in terms of structural controllability and observability, and minimum control energy criteria. Here we adopt a sparsity-promoting feedback control framework for undirected networks with Laplacian dynamics and distinct topological features. The control objective considered is to minimize the effect of disturbance signals, magnitude of control signals and cost of feedback channels. We show that depending on the cost of feedback channels, different complex network structures become the least expensive option to control. Specifically, increased cost of feedback channels favors organized topological complexity such as modularity and centralization. Thus, although sparse and heterogeneous undirected networks may require larger numbers of actuators and sensors for structural controllability, networks with Laplacian dynamics are shown to be easier to control when accounting for the cost of feedback channels.

SUBMITTER: Constantino PH

PROVIDER: S-EPMC6588614 | biostudies-literature | 2019 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Topology Effects on Sparse Control of Complex Networks with Laplacian Dynamics.

Constantino Pedro H PH Tang Wentao W Daoutidis Prodromos P

Scientific reports 20190621 1

Ease of control of complex networks has been assessed extensively in terms of structural controllability and observability, and minimum control energy criteria. Here we adopt a sparsity-promoting feedback control framework for undirected networks with Laplacian dynamics and distinct topological features. The control objective considered is to minimize the effect of disturbance signals, magnitude of control signals and cost of feedback channels. We show that depending on the cost of feedback chan ...[more]

PMID: 31227756

Similar Datasets

Efficient embedding of complex networks to hyperbolic space via their Laplacian.

Project description:The different factors involved in the growth process of complex networks imprint valuable information in their observable topologies. How to exploit this information to accurately predict structural network changes is the subject of active research. A recent model of network growth sustains that the emergence of properties common to most complex systems is the result of certain trade-offs between node birth-time and similarity. This model has a geometric interpretation in hyperbolic space, where distances between nodes abstract this optimisation process. Current methods for network hyperbolic embedding search for node coordinates that maximise the likelihood that the network was produced by the afore-mentioned model. Here, a different strategy is followed in the form of the Laplacian-based Network Embedding, a simple yet accurate, efficient and data driven manifold learning approach, which allows for the quick geometric analysis of big networks. Comparisons against existing embedding and prediction techniques highlight its applicability to network evolution and link prediction.

| S-EPMC4957117 | biostudies-literature

A topology-dynamics-based control strategy for multi-dimensional complex networked dynamical systems.

Project description:Complex systems are omnipresent and play a vital role in in our every-day lives. Adverse behavior of such systems has generated considerable interest in being able to control complex systems modeled as networks. Here, we propose a topology-dynamics-based approach for controlling complex systems modeled as networks of coupled multi-dimensional dynamical entities. For given dynamics and topology, we introduce an efficient scheme to identify in polynomial time a finite set of driver nodes, which - when endowed with the control function - steer the network to the desired behavior. We demonstrate the high suitability of our approach by controlling various networked multi-dimensional dynamics, coupled onto different topologies.

| S-EPMC6934796 | biostudies-literature

Networks from flows--from dynamics to topology.

Project description:Complex network approaches have recently been applied to continuous spatial dynamical systems, like climate, successfully uncovering the system's interaction structure. However the relationship between the underlying atmospheric or oceanic flow's dynamics and the estimated network measures have remained largely unclear. We bridge this crucial gap in a bottom-up approach and define a continuous analytical analogue of Pearson correlation networks for advection-diffusion dynamics on a background flow. Analysing complex networks of prototypical flows and from time series data of the equatorial Pacific, we find that our analytical model reproduces the most salient features of these networks and thus provides a general foundation of climate networks. The relationships we obtain between velocity field and network measures show that line-like structures of high betweenness mark transition zones in the flow rather than, as previously thought, the propagation of dynamical information.

| S-EPMC3927207 | biostudies-literature

Control of complex networks requires both structure and dynamics.

Project description:The study of network structure has uncovered signatures of the organization of complex systems. However, there is also a need to understand how to control them; for example, identifying strategies to revert a diseased cell to a healthy state, or a mature cell to a pluripotent state. Two recent methodologies suggest that the controllability of complex systems can be predicted solely from the graph of interactions between variables, without considering their dynamics: structural controllability and minimum dominating sets. We demonstrate that such structure-only methods fail to characterize controllability when dynamics are introduced. We study Boolean network ensembles of network motifs as well as three models of biochemical regulation: the segment polarity network in Drosophila melanogaster, the cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana. We demonstrate that structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models, highlighting the importance of the actual system dynamics in determining control. Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays an important role in the extent to which structure predicts dynamics.

| S-EPMC4834509 | biostudies-literature

Structure-based control of complex networks with nonlinear dynamics.

Project description:What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.

| S-EPMC5514702 | biostudies-literature

The Laplacian spectrum of neural networks.

Project description:The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these "conventional" graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks.

| S-EPMC3888935 | biostudies-literature

LRSSLMDA: Laplacian Regularized Sparse Subspace Learning for MiRNA-Disease Association prediction.

Project description:Predicting novel microRNA (miRNA)-disease associations is clinically significant due to miRNAs' potential roles of diagnostic biomarkers and therapeutic targets for various human diseases. Previous studies have demonstrated the viability of utilizing different types of biological data to computationally infer new disease-related miRNAs. Yet researchers face the challenge of how to effectively integrate diverse datasets and make reliable predictions. In this study, we presented a computational model named Laplacian Regularized Sparse Subspace Learning for MiRNA-Disease Association prediction (LRSSLMDA), which projected miRNAs/diseases' statistical feature profile and graph theoretical feature profile to a common subspace. It used Laplacian regularization to preserve the local structures of the training data and a L1-norm constraint to select important miRNA/disease features for prediction. The strength of dimensionality reduction enabled the model to be easily extended to much higher dimensional datasets than those exploited in this study. Experimental results showed that LRSSLMDA outperformed ten previous models: the AUC of 0.9178 in global leave-one-out cross validation (LOOCV) and the AUC of 0.8418 in local LOOCV indicated the model's superior prediction accuracy; and the average AUC of 0.9181+/-0.0004 in 5-fold cross validation justified its accuracy and stability. In addition, three types of case studies further demonstrated its predictive power. Potential miRNAs related to Colon Neoplasms, Lymphoma, Kidney Neoplasms, Esophageal Neoplasms and Breast Neoplasms were predicted by LRSSLMDA. Respectively, 98%, 88%, 96%, 98% and 98% out of the top 50 predictions were validated by experimental evidences. Therefore, we conclude that LRSSLMDA would be a valuable computational tool for miRNA-disease association prediction.

| S-EPMC5749861 | biostudies-literature

Modeling of Astrocyte Networks: Toward Realistic Topology and Dynamics.

Project description:Neuronal firing and neuron-to-neuron synaptic wiring are currently widely described as orchestrated by astrocytes-elaborately ramified glial cells tiling the cortical and hippocampal space into non-overlapping domains, each covering hundreds of individual dendrites and hundreds thousands synapses. A key component to astrocytic signaling is the dynamics of cytosolic Ca2+ which displays multiscale spatiotemporal patterns from short confined elemental Ca2+ events (puffs) to Ca2+ waves expanding through many cells. Here, we synthesize the current understanding of astrocyte morphology, coupling local synaptic activity to astrocytic Ca2+ in perisynaptic astrocytic processes and morphology-defined mechanisms of Ca2+ regulation in a distributed model. To this end, we build simplified realistic data-driven spatial network templates and compile model equations as defined by local cell morphology. The input to the model is spatially uncorrelated stochastic synaptic activity. The proposed modeling approach is validated by statistics of simulated Ca2+ transients at a single cell level. In multicellular templates we observe regular sequences of cell entrainment in Ca2+ waves, as a result of interplay between stochastic input and morphology variability between individual astrocytes. Our approach adds spatial dimension to the existing astrocyte models by employment of realistic morphology while retaining enough flexibility and scalability to be embedded in multiscale heterocellular models of neural tissue. We conclude that the proposed approach provides a useful description of neuron-driven Ca2+-activity in the astrocyte syncytium.

| S-EPMC7973220 | biostudies-literature

Ancestral informative marker selection and population structure visualization using sparse Laplacian eigenfunctions.

Project description:Identification of a small panel of population structure informative markers can reduce genotyping cost and is useful in various applications, such as ancestry inference in association mapping, forensics and evolutionary theory in population genetics. Traditional methods to ascertain ancestral informative markers usually require the prior knowledge of individual ancestry and have difficulty for admixed populations. Recently Principal Components Analysis (PCA) has been employed with success to select SNPs which are highly correlated with top significant principal components (PCs) without use of individual ancestral information. The approach is also applicable to admixed populations. Here we propose a novel approach based on our recent result on summarizing population structure by graph laplacian eigenfunctions, which differs from PCA in that it is geometric and robust to outliers. Our approach also takes advantage of the priori sparseness of informative markers in the genome. Through simulation of a ring population and the real global population sample HGDP of 650K SNPs genotyped in 940 unrelated individuals, we validate the proposed algorithm at selecting most informative markers, a small fraction of which can recover the similar underlying population structure efficiently. Employing a standard Support Vector Machine (SVM) to predict individuals' continental memberships on HGDP dataset of seven continents, we demonstrate that the selected SNPs by our method are more informative but less redundant than those selected by PCA. Our algorithm is a promising tool in genome-wide association studies and population genetics, facilitating the selection of structure informative markers, efficient detection of population substructure and ancestral inference.

| S-EPMC2973949 | biostudies-literature

Localization of Laplacian eigenvectors on random networks.

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

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data