Related papers: Growing Scale-Free Networks with Small World Behav…
We propose a simple growing model for the evolution of small-world networks. It is introduced as a modified BA model in which all the edges connected to the new nodes are made locally to the creator and its nearest neighbors. It is found…
Activity or spin patterns on random scale-free network are studied by mean field analysis and computer simulations. These activity patterns evolve in time according to local majority-rule dynamics which is implemented using (i) parallel or…
We propose a novel paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter…
We investigate the presence of triangles in a class of correlated random graphs in which hidden variables determine the pairwise connections between vertices. The class rules out self-loops and multiple edges and allows for negative degree…
We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical…
We extend the standard scale-free network model to include a ``triad formation step''. We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model…
Apart from the role the clustering coefficient plays in the definition of the small-world phenomena, it also has great relevance for practical problems involving networked dynamical systems. To study the impact of the clustering coefficient…
In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs-the well connected…
Many real systems possess accelerating statistics where the total number of edges grows faster than the network size. In this paper, we propose a simple weighted network model with accelerating growth. We derive analytical expressions for…
Networks in nature are often formed within a spatial domain in a dynamical manner, gaining links and nodes as they develop over time. We propose a class of spatially-based growing network models and investigate the relationship between the…
Small-worlds represent efficient communication networks that obey two distinguishing characteristics: a high clustering coefficient together with a small characteristic path length. This paper focuses on an interesting paradox, that…
We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement…
Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…
Discoveries of the scale-free and small-world features are reported on a network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the…
We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant…
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a…
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…
A dynamical model of small-world network, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of every site to the imput message are introduced to simulate real systems.…
We present a simple mechanism for generating undirected scale-free networks using random walkers, where the network growth is determined by choosing parent vertices by sequential random walks. We show that this mechanism produces scale-free…
Complex networks as the World Wide Web, the web of human sexual contacts or criminal networks often do not have an engineered architecture but instead are self-organized by the actions of a large number of individuals. From these local…