Related papers: Diffusion-annihilation proecesses in weighted scal…
We study the betweenness centrality of fractal and non-fractal scale-free network models as well as real networks. We show that the correlation between degree and betweenness centrality $C$ of nodes is much weaker in fractal network models…
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree…
We have analysed some structural properties of scale-free networks with the same degree distribution. Departing from a degree distribution obtained from the Barab\'asi-Albert (BA) algorithm, networks were generated using four additional…
The growth of an interface formed by the hierarchical deposition of particles of unequal size is studied in the framework of a dynamical network generated by a horizontal visibility algorithm. For a deterministic model of the deposition…
The compressive yield stress of particle gels shows a highly nonlinear dependence on the packing fraction. We have studied continuous compression processes, and discussed the packing fraction dependence with the particle scale…
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease…
Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks.…
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 study the kinetics of diffusion-limited coalescence, A+A->A, and annihilation, A+A->0, in random media consisting of disconnected domains of reaction. Examples include excitons fusion and annihilation in porous matrices and along polymer…
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree…
In many systems, communication proceeds by broadcasting rather than single source-target routing, but network structures that maximize signal lifetime are not well understood. Degree correlations are known to influence robustness and…
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…
We show that fractality in complex networks arises from the geometric self-similarity of their built-in hierarchical community-like structure, which is mathematically described by the scale-invariant equation for the masses of the boxes…
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $\gamma$ restricted to a range between 2…
There is great interest in predicting rare and extreme events in complex systems, and in particular, understanding the role of network topology in facilitating such events. In this work, we show that degree dispersion -- the fact that the…
It is suggested that the degree distribution for networks of the cell-metabolism for simple organisms reflects an ubiquitous randomness. This implies that natural selection has exerted no or very little pressure on the network degree…
We find that the fractal scaling in a class of scale-free networks originates from the underlying tree structure called skeleton, a special type of spanning tree based on the edge betweenness centrality. The fractal skeleton has the…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any…
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…