Topology Universality and Dissimilarity in a Class of Scale-Free Networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Zhang L
PROVIDER: S-EPMC4999222 | biostudies-literature | 2016
REPOSITORIES: biostudies-literature
Publications
Topology Universality and Dissimilarity in a Class of Scale-Free Networks.
Zhang Lanhua L Chen Juan J Wang Mei M Li Yujuan Y Xue Shaowei S Tang Yiyuan Y Sun Baoliang B
PloS one 20160825 8
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 i ...[more]
Similar Datasets
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
Project description: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.
| S-EPMC7326985 | biostudies-literature
Project description:Human behaviour in various circumstances mirrors the corresponding brain connectivity patterns, which are suitably represented by functional brain networks. While the objective analysis of these networks by graph theory tools deepened our understanding of brain functions, the multi-brain structures and connections underlying human social behaviour remain largely unexplored. In this study, we analyse the aggregate graph that maps coordination of EEG signals previously recorded during spoken communications in two groups of six listeners and two speakers. Applying an innovative approach based on the algebraic topology of graphs, we analyse higher-order topological complexes consisting of mutually interwoven cliques of a high order to which the identified functional connections organise. Our results reveal that the topological quantifiers provide new suitable measures for differences in the brain activity patterns and inter-brain synchronisation between speakers and listeners. Moreover, the higher topological complexity correlates with the listener's concentration to the story, confirmed by self-rating, and closeness to the speaker's brain activity pattern, which is measured by network-to-network distance. The connectivity structures of the frontal and parietal lobe consistently constitute distinct clusters, which extend across the listener's group. Formally, the topology quantifiers of the multi-brain communities exceed the sum of those of the participating individuals and also reflect the listener's rated attributes of the speaker and the narrated subject. In the broader context, the presented study exposes the relevance of higher topological structures (besides standard graph measures) for characterising functional brain networks under different stimuli.
| S-EPMC5120797 | biostudies-literature
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
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
Project description:Residue networks representing 595 nonhomologous proteins are studied. These networks exhibit universal topological characteristics as they belong to the topological class of modular networks formed by several highly interconnected clusters separated by topological cavities. There are some networks that tend to deviate from this universality. These networks represent small-size proteins having <200 residues. This article explains such differences in terms of the domain structure of these proteins. On the other hand, the topological cavities characterizing proteins residue networks match very well with protein binding sites. This study investigates the effect of the cutoff value used in building the residue network. For small cutoff values, <5 A, the cavities found are very large corresponding almost to the whole protein surface. On the contrary, for large cutoff value, >10.0 A, only very large cavities are detected and the networks look very homogeneous. These findings are useful for practical purposes as well as for identifying protein-like complex networks. Finally, this article shows that the main topological class of residue networks is not reproduced by random networks growing according to Erdös-Rényi model or the preferential attachment method of Barabási-Albert. However, the Watts-Strogatz model reproduces very well the topological class as well as other topological properties of residue network. A more biologically appealing modification of the Watts-Strogatz model to describe residue networks is proposed.
| S-EPMC2830435 | biostudies-literature
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
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
Project description:Measuring the dissimilarities between networks is a basic problem and wildly used in many fields. Based on method of the D-measure which is suggested for unweighted networks, we propose a quantitative dissimilarity metric of weighted network (WD-metric). Crucially, we construct a distance probability matrix of weighted network, which can capture the comprehensive information of weighted network. Moreover, we define the complementary graph and alpha centrality of weighted network. Correspondingly, several synthetic and real-world networks are used to verify the effectiveness of the WD-metric. Experimental results show that WD-metric can effectively capture the influence of weight on the network structure and quantitatively measure the dissimilarity of weighted networks. It can also be used as a criterion for backbone extraction algorithms of complex network.
| S-EPMC7952696 | biostudies-literature
Project description:Much information about the structure and dynamics of a network is encoded in the eigenvalues of its transition matrix. In this paper, we present a first study on the transition matrix of a family of weight driven networks, whose degree, strength, and edge weight obey power-law distributions, as observed in diverse real networks. We analytically obtain all the eigenvalues, as well as their multiplicities. We then apply the obtained eigenvalues to derive a closed-form expression for the random target access time for biased random walks occurring on the studied weighted networks. Moreover, using the connection between the eigenvalues of the transition matrix of a network and its weighted spanning trees, we validate the obtained eigenvalues and their multiplicities. We show that the power-law weight distribution has a strong effect on the behavior of random walks.
| S-EPMC4669447 | biostudies-other