We study a self-organized scale-free network model generated using the Merging-and-Creation dynamics with preferential attachment. We show analytically that the introduction of preferential attachment has minimal impact on the steady-state degree distribution. However, we find also that the...

Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large...

Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment rule using time-dependent data. Model networks are grown...

An important property of networked systems is their robustness against removal of network nodes, through either random node failure or targeted attack. Although design methods have been proposed for creating, ab initio, a network that has optimal robustness according to a given measure, one is...

Exploring temporal behaviors of the epidemic spreading is of particular importance, in which field an interesting phenomenon of hierarchical spreading cascade has already been demonstrated. By taking into account the effect of density of infected neighbors around an individual in the definition...

In this work, we consider the topological analysis of symbolic formal systems in the framework of network theory. In particular, we analyse the network extracted by Principia Mathematica of B. Russell and A.N. Whitehead, where the vertices are the statements and two statements are connected with...

This study proposes a probability routing strategy for improving traffic capability on scale-free networks. Compared with the shortest path routing strategy depending on central nodes largely and the efficient routing strategy avoiding hub routers as much as possible, the probability routing...

In this work we introduce a neural network model for associative memory based on a diluted Hopfield model, which grows through a neurogenesis algorithm that guarantees that the final network is a small-world and scale-free one. We also analyze the storage capacity of the network and prove that...

Networks constructed from credit relationships in the interbank market have been found to exhibit disassortative mixing together with a scale-free degree distribution, in contrast to most social networks that are assortative and not necessarily scale-free. This provokes the question whether...

We employ the random graph theory approach to analyze the protein–protein interaction database DIP. Several global topological parameters are used to characterize the protein–protein interaction networks (PINs) for seven organisms. We find that the seven PINs are well approximated by the...