The most of the recent models of directed weighted network evolution capture the growth process based on two conventional assumptions: constant average degree assumption and slowly growing diameter assumption. Such evolution models cannot fully support and reflect the dense power law and diameter shrinkage in the process of evolution of real networks. In this paper, a new evolution model, called BBVd, is proposed for directed weighted networks by extending BBV model with the idea of the Forest Fire model. In BBVd, new directed edges are established with probabilities computed based on in/our-strength of nodes, with dynamical evolution of weights for local directed edges. The experimental result shows that the generated networks using BBVd d...
This paper is a progress report on investigations into methods for evolving scalefree networks using...
Many complex networks in practice can be described by weighted network models, and the BBV model is ...
Networks with bimodal degree distribution are most robust to targeted and random attacks. We present...
The most of the recent models of directed weighted network evolution capture the growth process base...
We present a general model for the growth of weighted networks in which the structural growth is cou...
This paper proposes a weighted clique evolution model based on clique (maximal complete subgraph) gr...
A model for the growth of weighted networks is proposed. The model is based on the edge preferential...
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, a...
doi:10.1088/1367-2630/9/8/282 Abstract. We study the organization and dynamics of growing directed n...
In this paper, a simple model for the strength dynamics of weighted evolving networks is proposed to...
Weighted scale-free networks exhibit two types of degree-strength relationship: linear and nonlinear...
In this work we analyze the implications of using a power law distribution of vertice's quality in t...
In this paper, the dynamical behaviors of a class of weighted local-world evolving networks with agi...
We study a class of network growth models in which the choice of attachment by new nodes is governed...
In this paper, we present a local-world evolving model to characterize weighted networks. By introdu...
This paper is a progress report on investigations into methods for evolving scalefree networks using...
Many complex networks in practice can be described by weighted network models, and the BBV model is ...
Networks with bimodal degree distribution are most robust to targeted and random attacks. We present...
The most of the recent models of directed weighted network evolution capture the growth process base...
We present a general model for the growth of weighted networks in which the structural growth is cou...
This paper proposes a weighted clique evolution model based on clique (maximal complete subgraph) gr...
A model for the growth of weighted networks is proposed. The model is based on the edge preferential...
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, a...
doi:10.1088/1367-2630/9/8/282 Abstract. We study the organization and dynamics of growing directed n...
In this paper, a simple model for the strength dynamics of weighted evolving networks is proposed to...
Weighted scale-free networks exhibit two types of degree-strength relationship: linear and nonlinear...
In this work we analyze the implications of using a power law distribution of vertice's quality in t...
In this paper, the dynamical behaviors of a class of weighted local-world evolving networks with agi...
We study a class of network growth models in which the choice of attachment by new nodes is governed...
In this paper, we present a local-world evolving model to characterize weighted networks. By introdu...
This paper is a progress report on investigations into methods for evolving scalefree networks using...
Many complex networks in practice can be described by weighted network models, and the BBV model is ...
Networks with bimodal degree distribution are most robust to targeted and random attacks. We present...