Related papers: A Scale-free Network with Boolean Dynamics as a Fu…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…
Here, we propose a class of scale-free networks $G(t;m)$ with some intriguing properties, which can not be simultaneously held by all the theoretical models with power-law degree distribution in the existing literature, including (i)…
Scale free dynamics are observed in a variety of physical and biological systems. These include neural activity in which evidence for scale freeness has been reported using a range of imaging modalities. Here, we derive the ways in which…
In discrete contexts such as the degree distribution for a graph, \emph{scale-free} has traditionally been \emph{defined} to be \emph{power-law}. We propose a reasonable interpretation of \emph{scale-free}, namely, invariance under the…
Fractal (or transfractal) features are common in real-life networks and are known to influence the dynamic processes taking place in the network itself. Here we consider a class of scale-free deterministic networks, called $(u,v)$-flowers,…
Scale-free and non-computable characteristics of natural networks are found to result from the least-time dispersal of energy. To consider a network as a thermodynamic system is motivated since ultimately everything that exists can be…
What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is…
We consider the model of complex hyperbranched polymer structures formed on the basis of scale-free graphs, where functionalities (degrees) $k$ of nodes obey a power law decaying probability $p(k)\sim{k^{-\alpha}}$. Such polymer topologies…
Using numerical simulations and scaling theory we study the dynamics of the world-wide Web from the growth rules recently proposed in Ref. [1] with appropriate parameters. We demonstrate that the emergence of power-law behavior of the out-…
For years, we have been building models of gene regulatory networks, where recent advances in molecular biology shed some light on new structural and dynamical properties of such highly complex systems. In this work, we propose a novel…
We study vibrational modes and spectrum of a model system of atoms and springs on a scale-free network in order to understand the nature of excitations with many degrees of freedom on the scale-free network. We assume that the atoms and…
We consider a non-projective class of inhomogeneous random graph models with interpretable parameters and a number of interesting asymptotic properties. Using the results of Bollob\'as et al. [2007], we show that i) the class of models is…
We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size $N$ and power-law exponent $\gamma$, while keeping the average degree fixed. We study ensembles generated by…
We introduce a family of models incorporating random segmental substitutions and point mutations and demonstrate that such models reproduce algebraic length distributions of exact matches with the slope $-4$ observed earlier in pairwise…
We study the critical properties of the Bak-Sneppen coevolution model on scale-free networks by Monte Carlo method. We report the distribution of the avalanche size and fractal activity through the branching process. We observe that the…
Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…
Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree…
We study the average nearest neighbor degree $a(k)$ of vertices with degree $k$. In many real-world networks with power-law degree distribution $a(k)$ falls off in $k$, a property ascribed to the constraint that any two vertices are…
We propose a network model with a fixed number of nodes and links with a dynamics which favors links between nodes differing in connectivity. Parameter regimes where the degree distributions follow power-laws, P(k) ~ k^-gamma, high…
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved successful in explaining scale-free network properties such as…