ID: cond-mat/0401057

Weighted evolving networks: coupling topology and weights dynamics

January 6, 2004

View on ArXiv
Alain Barrat, Marc Barthelemy, Alessandro Vespignani
Condensed Matter
Disordered Systems and Neura...
Statistical Mechanics

We propose a model for the growth of weighted networks that couples the establishment of new edges and vertices and the weights' dynamical evolution. The model is based on a simple weight-driven dynamics and generates networks exhibiting the statistical properties observed in several real-world systems. In particular, the model yields a non-trivial time evolution of vertices' properties and scale-free behavior for the weight, strength and degree distributions.

Similar papers 1

Modeling the evolution of weighted networks

June 10, 2004

97% Match
Alain Barrat, Marc Barthelemy, Alessandro Vespignani
Statistical Mechanics

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 mechanism coupled to the local network growth. That coupling can be generalized in order to include the effect of additional randomness and non-linearities which can be present in real-world networks. The model generates weighted graphs exhibiting ...

Find SimilarView on arXiv

Weighted Evolving Networks

January 19, 2001

94% Match
S. H. Yook, H. Jeong, ... , Tu Y.
Disordered Systems and Neura...
Statistical Mechanics

Many biological, ecological and economic systems are best described by weighted networks, as the nodes interact with each other with varying strength. However, most network models studied so far are binary, the link strength being either 0 or 1. In this paper we introduce and investigate the scaling properties of a class of models which assign weights to the links as the network evolves. The combined numerical and analytical approach indicates that asymptotically the total we...

Find SimilarView on arXiv

Weighted Assortative And Disassortative Networks Model

July 14, 2006

93% Match
C. C. Leung, H. F. Chau
Physics and Society

Real-world networks process structured connections since they have non-trivial vertex degree correlation and clustering. Here we propose a toy model of structure formation in real-world weighted network. In our model, a network evolves by topological growth as well as by weight change. In addition, we introduce the weighted assortativity coefficient, which generalizes the assortativity coefficient of a topological network, to measure the tendency of having a high-weighted lin...

Find SimilarView on arXiv

A comprehensive weighted evolving network model

June 13, 2004

93% Match
Chunguang Li, Guanrong Chen
Disordered Systems and Neura...

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...

Find SimilarView on arXiv

A Synthetical Weights' Dynamic Mechanism for Weighted Networks

September 7, 2007

93% Match
Lujun Fang, Zhongzhi Zhang, ... , Guan Jihong
Physics and Society

We propose a synthetical weights' dynamic mechanism for weighted networks which takes into account the influences of strengths of nodes, weights of links and incoming new vertices. Strength/Weight preferential strategies are used in these weights' dynamic mechanisms, which depict the evolving strategies of many real-world networks. We give insight analysis to the synthetical weights' dynamic mechanism and study how individual weights' dynamic strategies interact and cooperate...

Find SimilarView on arXiv

A weighted evolving network model more approach to reality

August 7, 2004

93% Match
Chuan-Ji Fu, Qing Ou, Wen Chen, Bing-Hong Wang, Ying-Di Jin, ... , Zhou Tao
Disordered Systems and Neura...

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...

Find SimilarView on arXiv

General Dynamics of Topology and Traffic on Weighted Technological Networks

January 10, 2005

93% Match
Wen-Xu Wang, Bo Hu, Gang Yan, ... , Wang Bing-Hong
Disordered Systems and Neura...

For most technical networks, the interplay of dynamics, traffic and topology is assumed crucial to their evolution. In this paper, we propose a traffic-driven evolution model of weighted technological networks. By introducing a general strength-coupling mechanism under which the traffic and topology mutually interact, the model gives power-law distributions of degree, weight and strength, as confirmed in many real networks. Particularly, depending on a parameter W that contro...

Find SimilarView on arXiv

Scale-free networks with self-growing weight

January 15, 2007

93% Match
Takuma Tanaka, Toshio Aoyagi
Disordered Systems and Neura...
Physics and Society

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 existing nodes but also by self-growing weight of existing links based on a simple weight-driven rule. This model is analytically tractable, so that the various statistical properties, such as the distribution of weight, can be derived. Fina...

Find SimilarView on arXiv

Minimal models of weighted scale-free networks

August 15, 2004

92% Match
S. N. Dorogovtsev, J. F. F. Mendes
Statistical Mechanics

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...

Find SimilarView on arXiv

Scale-free properties of weighted networks with connectivity-driven topology

December 8, 2004

92% Match
W. Jezewski
Disordered Systems and Neura...

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...

Find SimilarView on arXiv