June 10, 2004
Similar papers 2
June 13, 2004
Many social, technological, biological, and economical systems are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the connection weights among their nodes. However, most existing research work on complex network models are concentrated on network structures, with connection weights among their nodes being either 1 or 0. In this paper, we propose a new weighted evolving network model. Numerical simulations ind...
August 7, 2004
In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head and heavy-tail. We present a new model for the growth of weighted networks considering the connection of nodes with low strengths. Numerical simulations indicate that this network model yields three power-law distributions of the node degrees, node strengths and connection weights. Particularly, the d...
May 20, 2004
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynamics and generates weighted directed graphs exhibiting the statistical properties observed in the Web. In particular, the model yields a non-trivial time evolution of vertices and heavy-tail distributions for the topological and traffic properties. The generated graphs exhibit a complex architecture with ...
December 8, 2004
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree distribution and thereby the weight distribution remain unchanged when the probability rate of attaching new nodes is replaced with some unnormalized rate determined by the ratio of the degree of a randomly selected old node to the maximal node deg...
May 5, 2004
Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In this letter we propose a new mechanism for the construction of SF networks: Evolving networks as interaction networks of systems which are distinguished by their stability if perturbed out of equilibrium. Stability is measured by the largest r...
August 15, 2004
We consider a class of simple, non-trivial models of evolving weighted scale-free networks. The network evolution in these models is determined by attachment of new vertices to ends of preferentially chosen weighted edges. Resulting networks have scale-free distributions of the edge weight, of the vertex degree, and of the vertex strength. We discuss situations where this mechanism operates. Apart of stochastic models of weighted networks, we introduce a wide class of determi...
December 15, 2020
For decades, complex networks, such as social networks, biological networks, chemical networks, technological networks, have been used to study the evolution and dynamics of different kinds of complex systems. These complex systems can be better described using weighted links as binary connections do not portray the complete information of the system. All these weighted networks evolve in a different environment by following different underlying mechanics. Researchers have wo...
January 27, 2005
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered. Compared with the BA model and other evolving models with preferential attachment, there are two significant generalizations. First, besides the new vertex added in at every time step, old vertices can also attempt to build up new links, or to rec...
December 15, 2004
Different weighted scale-free networks show weights-topology correlations indicated by the non linear scaling of the node strength with node connectivity. In this paper we show that networks with and without weight-topology correlations can emerge from the same simple growth dynamics of the node connectivities and of the link weights. A weighted fitness network is introduced in which both nodes and links are assigned intrinsic fitness. This model can show a local dependence o...
August 19, 2014
Complex network theory has been used to study complex systems. However, many real-life systems involve multiple kinds of objects . They can't be described by simple graphs. In order to provide complete information of these systems, we extend the concept of evolving models of complex networks to hypernetworks. In this work, we firstly propose a non-uniform hypernetwork model with attractiveness, and obtain the stationary average hyperdegree distribution of the non-uniform hype...