We propose a biologically motivated quantity, twinness, to evaluate local similarity between nodes in a network. The twinness of a pair of nodes is the number of connected, labeled subgraphs of size n in which the two nodes possess identical neighbours. The graph animal algorithm is used to...

In this paper, we proposed an ungrowing scale-free network model, indicating the growth may not be a necessary condition of the self-organization of a network in a scale-free structure. The analysis shows that the degree distributions of the present model can varying from the Poisson form to the...

We propose a growing network model of the distribution of wealth in a society with local redistribution. Individuals, represented by nodes in the model, provide goods and services to one of their neighbors and they simultaneously produce wealth using goods and services received from their...

The Internet is one of the most interesting realizations of a “complex” network. As a non-supervised growing object, it allows the study of the selective pressure which drives the network to assume its current structure. The DIMES and the ROUTEVIEWS projects are ongoing projects aimed at...

Using the context of routing efficiency in a complex scale-free network, we study the problem of how a limited amount of resources should be distributed to the nodes in a network so as to achieve a better performance, without imposing a certain pre-determined distribution. A dynamical...

In this paper, we analyze statistical properties of a communication network constructed from the records of a mobile phone company. The network consists of 2.5 million customers that have placed 810 million communications (phone calls and text messages) over a period of 6 months and for whom we...

Dynamical scalings for the end-to-end distance Ree and the number of distinct visited nodes Nv of random walks (RWs) on finite scale-free networks (SFNs) are studied numerically. 〈Ree〉 shows the dynamical scaling behavior 〈Ree(ℓ¯,t)〉=ℓ¯α(γ,N)g(t/ℓ¯z), where ℓ¯ is the...

Software systems represent one of the most complex man-made artifacts. Understanding the structure of software systems can provide useful insights into software engineering efforts and can potentially help the development of complex system models applicable to other domains. In this paper, we...

This paper investigates the evolutionary prisoner’s dilemma on weighted scale-free networks. The weighted networks are generated by adopting Barabási–Albert scale-free network and assigning link weight with wij=(ki×kj)β. Simulation results show that the cooperation frequency has a strong...

Although recent studies have revealed that degree heterogeneity of a complex network has significant impact on the network performance and function, a unified definition of the heterogeneity of a network with any degree distribution is absent. In this paper, we define a heterogeneity index...