Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Scaling in complex systems: a link between the dynamics of networks and growing interfaces.

ABSTRACT: We consider growing interfaces as dynamical networks whose nodes are the discrete points of the interface and the edges the physical interactions among them. We map the points of the interface formed at each time into a graph by means of a visibility algorithm. As the corresponding interfaces grow, their visibility graphs change over time. We show that the visibility graphs are all scale free for each time. We use the variance of the node degrees as a measure of the dynamical properties of these graphs. This magnitude reveals an unexpected scaling behaviour of these graphs in both the number of nodes and time. This enables to define three robust exponents that characterize any type of dynamics with more detail than the classical scaling analysis applied directly to the physical interfaces. To check the feasibility of this approach we study and classify six different dynamical processes and estimate their critical exponents. We conclude that the dynamics of physical systems far from equilibrium can be determined by its corresponding visibility network. Indeed, this methodology is able to discern among dynamical processes that hitherto have been classified in the same universality class according to the scaling analysis of their interfaces.

SUBMITTER: Bru A

PROVIDER: S-EPMC4269882 | biostudies-other | 2014

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Correlations between community structure and link formation in complex networks.

Project description:BackgroundLinks in complex networks commonly represent specific ties between pairs of nodes, such as protein-protein interactions in biological networks or friendships in social networks. However, understanding the mechanism of link formation in complex networks is a long standing challenge for network analysis and data mining.Methodology/principal findingsLinks in complex networks have a tendency to cluster locally and form so-called communities. This widely existed phenomenon reflects some underlying mechanism of link formation. To study the correlations between community structure and link formation, we present a general computational framework including a theory for network partitioning and link probability estimation. Our approach enables us to accurately identify missing links in partially observed networks in an efficient way. The links having high connection likelihoods in the communities reveal that links are formed preferentially to create cliques and accordingly promote the clustering level of the communities. The experimental results verify that such a mechanism can be well captured by our approach.Conclusions/significanceOur findings provide a new insight into understanding how links are created in the communities. The computational framework opens a wide range of possibilities to develop new approaches and applications, such as community detection and missing link prediction.

| S-EPMC3765235 | biostudies-literature

Toward link predictability of complex networks.

Project description:The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate real-world networks demonstrate that (i) structural consistency is a good estimation of link predictability and (ii) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners.

| S-EPMC4345601 | biostudies-literature

Step-bunching instability of growing interfaces between ice and supercooled water.

Project description:SignificanceStep-bunching instability (SBI) is one of the interfacial instabilities driven by self-organization of elementary step flow associated with crystal-growth dynamics, which has been observed in diverse crystalline materials. However, despite theoretical suggestions of its presence, no direct observations of SBI for simple melt growth have been achieved so far. Here, with the aid of a type of optical microscope and its combination with a two-beam interferometer, we realized quantitative in situ observations of the spatiotemporal dynamics of the SBI. This enables us to examine the origin of the SBI at the level of the step-step interaction. We also found that the SBI spontaneously induces a highly stable spiral growth mode, governing the late stage of the growth process.

| S-EPMC8915970 | biostudies-literature

Energy scaling of targeted optimal control of complex networks.

Project description:Recently it has been shown that the control energy required to control a dynamical complex network is prohibitively large when there are only a few control inputs. Most methods to reduce the control energy have focused on where, in the network, to place additional control inputs. Here, in contrast, we show that by controlling the states of a subset of the nodes of a network, rather than the state of every node, while holding the number of control signals constant, the required energy to control a portion of the network can be reduced substantially. The energy requirements exponentially decay with the number of target nodes, suggesting that large networks can be controlled by a relatively small number of inputs as long as the target set is appropriately sized. We validate our conclusions in model and real networks to arrive at an energy scaling law to better design control objectives regardless of system size, energy restrictions, state restrictions, input node choices and target node choices.

| S-EPMC5413984 | biostudies-literature

Scaling of contact networks for epidemic spreading in urban transit systems.

Project description:Improved mobility not only contributes to more intensive human activities but also facilitates the spread of communicable disease, thus constituting a major threat to billions of urban commuters. In this study, we present a multi-city investigation of communicable diseases percolating among metro travelers. We use smart card data from three megacities in China to construct individual-level contact networks, based on which the spread of disease is modeled and studied. We observe that, though differing in urban forms, network layouts, and mobility patterns, the metro systems of the three cities share similar contact network structures. This motivates us to develop a universal generation model that captures the distributions of the number of contacts as well as the contact duration among individual travelers. This model explains how the structural properties of the metro contact network are associated with the risk level of communicable diseases. Our results highlight the vulnerability of urban mass transit systems during disease outbreaks and suggest important planning and operation strategies for mitigating the risk of communicable diseases.

| S-EPMC7902662 | biostudies-literature

Link-Prediction Enhanced Consensus Clustering for Complex Networks.

Project description:Many real networks that are collected or inferred from data are incomplete due to missing edges. Missing edges can be inherent to the dataset (Facebook friend links will never be complete) or the result of sampling (one may only have access to a portion of the data). The consequence is that downstream analyses that "consume" the network will often yield less accurate results than if the edges were complete. Community detection algorithms, in particular, often suffer when critical intra-community edges are missing. We propose a novel consensus clustering algorithm to enhance community detection on incomplete networks. Our framework utilizes existing community detection algorithms that process networks imputed by our link prediction based sampling algorithm and merges their multiple partitions into a final consensus output. On average our method boosts performance of existing algorithms by 7% on artificial data and 17% on ego networks collected from Facebook.

| S-EPMC4874693 | biostudies-literature

Competitive dynamics on complex networks.

Project description:We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is most likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.

| S-EPMC5376163 | biostudies-literature

Inference of monopartite networks from bipartite systems with different link types.

Project description:Many of the real-world data sets can be portrayed as bipartite networks. Since connections between nodes of the same type are lacking, they need to be inferred. The standard way to do this is by converting the bipartite networks to their monopartite projection. However, this simple approach renders an incomplete representation of all the information in the original network. To this end, we propose a new statistical method to identify the most critical links in the bipartite network projection. Our method takes into account the heterogeneity of node connections. Moreover, it can handle situations where links of different types are present. We compare our method against the state-of-the-art and illustrate the findings with synthetic data and empirical examples of investor and political data.

| S-EPMC9852298 | biostudies-literature

Targeting the dynamics of complex networks.

Project description:We report on a generic procedure to steer (target) a network's dynamics towards a given, desired evolution. The problem is here tackled through a Master Stability Function approach, assessing the stability of the aimed dynamics, and through a selection of nodes to be targeted. We show that the degree of a node is a crucial element in this selection process, and that the targeting mechanism is most effective in heterogeneous scale-free architectures. This makes the proposed approach applicable to the large majority of natural and man-made networked systems.

| S-EPMC3343324 | biostudies-other

Stacking models for nearly optimal link prediction in complex networks.

Project description:Most real-world networks are incompletely observed. Algorithms that can accurately predict which links are missing can dramatically speed up network data collection and improve network model validation. Many algorithms now exist for predicting missing links, given a partially observed network, but it has remained unknown whether a single best predictor exists, how link predictability varies across methods and networks from different domains, and how close to optimality current methods are. We answer these questions by systematically evaluating 203 individual link predictor algorithms, representing three popular families of methods, applied to a large corpus of 550 structurally diverse networks from six scientific domains. We first show that individual algorithms exhibit a broad diversity of prediction errors, such that no one predictor or family is best, or worst, across all realistic inputs. We then exploit this diversity using network-based metalearning to construct a series of "stacked" models that combine predictors into a single algorithm. Applied to a broad range of synthetic networks, for which we may analytically calculate optimal performance, these stacked models achieve optimal or nearly optimal levels of accuracy. Applied to real-world networks, stacked models are superior, but their accuracy varies strongly by domain, suggesting that link prediction may be fundamentally easier in social networks than in biological or technological networks. These results indicate that the state of the art for link prediction comes from combining individual algorithms, which can achieve nearly optimal predictions. We close with a brief discussion of limitations and opportunities for further improvements.

| S-EPMC7519231 | 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