Browse
Submit Data
Databases
API
Help

Dataset Information

28 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Detecting differences in the topology of scale-free networks grown under time-dynamic topological fitness.

ABSTRACT: The fitness model was introduced in the literature to expand the Barabasi-Albert model's generative mechanism, which produces scale-free networks under the control of degree. However, the fitness model has not yet been studied in a comprehensive context because most models are built on invariant fitness as the network grows and time-dynamics mainly concern new nodes joining the network. This mainly static consideration restricts fitness in generating scale-free networks only when the underlying fitness distribution is power-law, a fact which makes the hybrid fitness models based on degree-driven preferential attachment to remain the most attractive models in the literature. This paper advances the time-dynamic conceptualization of fitness, by studying scale-free networks generated under topological fitness that changes as the network grows, where the fitness is controlled by degree, clustering coefficient, betweenness, closeness, and eigenvector centrality. The analysis shows that growth under time-dynamic topological fitness is indifferent to the underlying fitness distribution and that different topological fitness generates networks of different topological attributes, ranging from a mesh-like to a superstar-like pattern. The results also show that networks grown under the control of betweenness centrality outperform the other networks in scale-freeness and the majority of the other topological attributes. Overall, this paper contributes to broadening the conceptualization of fitness to a more time-dynamic context.

SUBMITTER: Tsiotas D

PROVIDER: S-EPMC7326985 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Scarcity of scale-free topology is universal across biochemical networks.

Project description:Biochemical reactions underlie the functioning of all life. Like many examples of biology or technology, the complex set of interactions among molecules within cells and ecosystems poses a challenge for quantification within simple mathematical objects. A large body of research has indicated many real-world biological and technological systems, including biochemistry, can be described by power-law relationships between the numbers of nodes and edges, often described as "scale-free". Recently, new statistical analyses have revealed true scale-free networks are rare. We provide a first application of these methods to data sampled from across two distinct levels of biological organization: individuals and ecosystems. We analyze a large ensemble of biochemical networks including networks generated from data of 785 metagenomes and 1082 genomes (sampled from the three domains of life). The results confirm no more than a few biochemical networks are any more than super-weakly scale-free. Additionally, we test the distinguishability of individual and ecosystem-level biochemical networks and show there is no sharp transition in the structure of biochemical networks across these levels of organization moving from individuals to ecosystems. This result holds across different network projections. Our results indicate that while biochemical networks are not scale-free, they nonetheless exhibit common structure across different levels of organization, independent of the projection chosen, suggestive of shared organizing principles across all biochemical networks.

| S-EPMC7985396 | biostudies-literature

Dynamic pattern evolution on scale-free networks.

Project description:A general class of dynamic models on scale-free networks is studied by analytical methods and computer simulations. Each network consists of N vertices and is characterized by its degree distribution, P(k), which represents the probability that a randomly chosen vertex is connected to k nearest neighbors. Each vertex can attain two internal states described by binary variables or Ising-like spins that evolve in time according to local majority rules. Scale-free networks, for which the degree distribution has a power law tail P(k) approximately k(-gamma), are shown to exhibit qualitatively different dynamic behavior for gamma < 5/2 and gamma > 5/2, shedding light on the empirical observation that many real-world networks are scale-free with 2 < gamma < 5/2. For 2 < gamma < 5/2, strongly disordered patterns decay within a finite decay time even in the limit of infinite networks. For gamma > 5/2, on the other hand, this decay time diverges as ln(N) with the network size N. An analogous distinction is found for a variety of more complex models including Hopfield models for associative memory networks. In the latter case, the storage capacity is found, within mean field theory, to be independent of N in the limit of large N for gamma > 5/2 but to grow as N(alpha) with alpha = (5 - 2gamma)/(gamma - 1) for 2 < gamma < 5/2.

| S-EPMC1174918 | biostudies-literature

Topology Universality and Dissimilarity in a Class of Scale-Free Networks.

Project description:We study the effect of subtle changes on the evolution in the scale-free (SF) networks. Three extended models are evolved based on competition and inner anti-preferential deletion in growth and preferential attachment processes. By nonlinear and dynamic controlling on randomness and determinacy, three models can self-organize into scale-free networks, and diverse scaling exponents appear. Moreover, the model with more determinacy has more stringent parameter control than randomness, especially in the edge deletion. Our results suggest that the nature of the topology universality and dissimilarity in SF networks may be the subtle changes of randomness and determinacy.

| S-EPMC4999222 | biostudies-literature

Detecting different topologies immanent in scale-free networks with the same degree distribution.

Project description:The scale-free (SF) property is a major concept in complex networks, and it is based on the definition that an SF network has a degree distribution that follows a power-law (PL) pattern. This paper highlights that not all networks with a PL degree distribution arise through a Barabási-Albert (BA) preferential attachment growth process, a fact that, although evident from the literature, is often overlooked by many researchers. For this purpose, it is demonstrated, with simulations, that established measures of network topology do not suffice to distinguish between BA networks and other (random-like and lattice-like) SF networks with the same degree distribution. Additionally, it is examined whether an existing self-similarity metric proposed for the definition of the SF property is also capable of distinguishing different SF topologies with the same degree distribution. To contribute to this discrimination, this paper introduces a spectral metric, which is shown to be more capable of distinguishing between different SF topologies with the same degree distribution, in comparison with the existing metrics.

| S-EPMC6452710 | biostudies-literature

Scale free topology as an effective feedback system.

Project description:Biological networks are often heterogeneous in their connectivity pattern, with degree distributions featuring a heavy tail of highly connected hubs. The implications of this heterogeneity on dynamical properties are a topic of much interest. Here we show that interpreting topology as a feedback circuit can provide novel insights on dynamics. Based on the observation that in finite networks a small number of hubs have a disproportionate effect on the entire system, we construct an approximation by lumping these nodes into a single effective hub, which acts as a feedback loop with the rest of the nodes. We use this approximation to study dynamics of networks with scale-free degree distributions, focusing on their probability of convergence to fixed points. We find that the approximation preserves convergence statistics over a wide range of settings. Our mapping provides a parametrization of scale free topology which is predictive at the ensemble level and also retains properties of individual realizations. Specifically, outgoing hubs have an organizing role that can drive the network to convergence, in analogy to suppression of chaos by an external drive. In contrast, incoming hubs have no such property, resulting in a marked difference between the behavior of networks with outgoing vs. incoming scale free degree distribution. Combining feedback analysis with mean field theory predicts a transition between convergent and divergent dynamics which is corroborated by numerical simulations. Furthermore, they highlight the effect of a handful of outlying hubs, rather than of the connectivity distribution law as a whole, on network dynamics.

| S-EPMC7241857 | biostudies-literature

Subnets of scale-free networks are not scale-free: sampling properties of networks.

Project description:Most studies of networks have only looked at small subsets of the true network. Here, we discuss the sampling properties of a network's degree distribution under the most parsimonious sampling scheme. Only if the degree distributions of the network and randomly sampled subnets belong to the same family of probability distributions is it possible to extrapolate from subnet data to properties of the global network. We show that this condition is indeed satisfied for some important classes of networks, notably classical random graphs and exponential random graphs. For scale-free degree distributions, however, this is not the case. Thus, inferences about the scale-free nature of a network may have to be treated with some caution. The work presented here has important implications for the analysis of molecular networks as well as for graph theory and the theory of networks in general.

| S-EPMC555505 | biostudies-literature

Genome-scale fitness profile of Caulobacter crescentus grown in natural freshwater.

Project description:Bacterial genomes evolve in complex ecosystems and are best understood in this natural context, but replicating such conditions in the lab is challenging. We used transposon sequencing to define the fitness consequences of gene disruption in the bacterium Caulobacter crescentus grown in natural freshwater, compared with axenic growth in common laboratory media. Gene disruptions in amino-acid and nucleotide sugar biosynthesis pathways and in metabolic substrate transport machinery impaired fitness in both lake water and defined minimal medium relative to complex peptone broth. Fitness in lake water was enhanced by insertions in genes required for flagellum biosynthesis and reduced by insertions in genes involved in biosynthesis of the holdfast surface adhesin. We further uncovered numerous hypothetical and uncharacterized genes for which disruption impaired fitness in lake water, defined minimal medium, or both. At the genome scale, the fitness profile of mutants cultivated in lake water was more similar to that in complex peptone broth than in defined minimal medium. Microfiltration of lake water did not significantly affect the terminal cell density or the fitness profile of the transposon mutant pool, suggesting that Caulobacter does not strongly interact with other microbes in this ecosystem on the measured timescale. Fitness of select mutants with defects in cell surface biosynthesis and environmental sensing were significantly more variable across days in lake water than in defined medium, presumably owing to day-to-day heterogeneity in the lake environment. This study reveals genetic interactions between Caulobacter and a natural freshwater environment, and provides a new avenue to study gene function in complex ecosystems.

| S-EPMC6331620 | biostudies-literature

Detecting and Testing Altered Brain Connectivity Networks with K-partite Network Topology.

Project description:Emerging brain connectivity network studies suggest that interactions between various distributed neuronal populations may be characterized by an organized complex topological structure. Many neuropsychiatric disorders are associated with altered topological patterns of brain connectivity. Therefore, a key inquiry of connectivity analysis is to detect group-level differentially expressed connectome patterns from the massive neuroimaging data. Recently, statistical methods have been developed to detect differentially expressed connectivity features at a subnetwork level, extending more commonly applied edge level analysis. However, the graph topological structures in these methods are limited to community/cliques which may not effectively uncover the underlying complex and disease-related brain circuits/subnetworks. Building on these previous subnetwork detection methods, a new statistical approach is developed to automatically identify the latent differentially expressed brain connectivity subnetworks with k-partite graph topological structures from large brain connectivity matrices. In addition, statistical inferential techniques are provided to test the detected topological structure. The new methods are evaluated via extensive simulation studies and then applied to resting state fMRI data (24 cases and 18 controls) for Parkinson's disease research. A differentially expressed connectivity network with the k-partite graph topological structure is detected which reveals underlying neural features distinguishing Parkinson's disease patients from healthy control subjects.

| S-EPMC7442212 | biostudies-literature

Scale-free networks are rare.

Project description:Real-world networks are often claimed to be scale free, meaning that the fraction of nodes with degree k follows a power law k-?, a pattern with broad implications for the structure and dynamics of complex systems. However, the universality of scale-free networks remains controversial. Here, we organize different definitions of scale-free networks and construct a severe test of their empirical prevalence using state-of-the-art statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks. Across these networks, we find robust evidence that strongly scale-free structure is empirically rare, while for most networks, log-normal distributions fit the data as well or better than power laws. Furthermore, social networks are at best weakly scale free, while a handful of technological and biological networks appear strongly scale free. These findings highlight the structural diversity of real-world networks and the need for new theoretical explanations of these non-scale-free patterns.

| S-EPMC6399239 | biostudies-literature

Are RNA networks scale-free?

Project description:A network is scale-free if its connectivity density function is proportional to a power-law distribution. It has been suggested that scale-free networks may provide an explanation for the robustness observed in certain physical and biological phenomena, since the presence of a few highly connected hub nodes and a large number of small-degree nodes may provide alternate paths between any two nodes on average-such robustness has been suggested in studies of metabolic networks, gene interaction networks and protein folding. A theoretical justification for why many networks appear to be scale-free has been provided by Barabási and Albert, who argue that expanding networks, in which new nodes are preferentially attached to highly connected nodes, tend to be scale-free. In this paper, we provide the first efficient algorithm to compute the connectivity density function for the ensemble of all homopolymer secondary structures of a user-specified length-a highly nontrivial result, since the exponential size of such networks precludes their enumeration. Since existent power-law fitting software, such as powerlaw, cannot be used to determine a power-law fit for our exponentially large RNA connectivity data, we also implement efficient code to compute the maximum likelihood estimate for the power-law scaling factor and associated Kolmogorov-Smirnov p value. Hypothesis tests strongly indicate that homopolymer RNA secondary structure networks are not scale-free; moreover, this appears to be the case for real (non-homopolymer) RNA networks.

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