相关论文: Signatures of small-world and scale-free propertie…

Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These…

One explanation for the impressive recent boom in network theory might be that it provides a promising tool for an understanding of complex systems. Network theory is mainly focusing on discrete large-scale topological structures rather…

We propose a natural model of evolving weighted networks in which new links are not necessarily connected to new nodes. The model allows a newly added link to connect directly two nodes already present in the network. This is plausible in…

We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us…

We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of…

This paper aims to measure the efficiency of urban street networks (a kind of complex networks) from the perspective of the multidimensional chain of connectivity (or flow). More specifically, we define two quantities: flow dimension and…

All crucial features of the recently observed real-world weighted networks are obtained in a model where the weight of a link is defined with a single non-linear parameter $\alpha$ as $w_{ij}=(s_is_j)^\alpha$, $s_i$ and $s_j$ are the…

The local minima (inherent structures) of a system and their associated transition links give rise to a network. Here we consider the topological and distance properties of such a network in the context of spin glasses. We use steepest…

A number of recent studies have focused on the statistical properties of networked systems such as social networks and the World-Wide Web. Researchers have concentrated particularly on a few properties which seem to be common to many…

Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks…

A large software system is often composed of many inter-related programs of different sizes. Using the public Eclipse dataset, we replicate our previous study on the distribution of program sizes. Our results confirm that the program sizes…

We present a novel type of weighted scale-free network model, in which the weight grows independently of the attachment of new nodes. The evolution of this network is thus determined not only by the preferential attachment of new nodes to…

It has been found that the networks with scale-free distribution are very resilient to random failures. The purpose of this work is to determine the network design guideline which maximize the network robustness to random failures with the…

We introduce a minimal extended evolving model for small-world networks which is controlled by a parameter. In this model the network growth is determined by the attachment of new nodes to already existing nodes that are geographically…

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 study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochastic component of evolution. New nodes are attached to the…

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

We analyze the degree distribution's cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices $N$ is ruled by the topological constraints induced by the connectivity structure of the network.…

Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free…

Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…