Related papers: A Mutual Attraction Model for Both Assortative and…
For most networks, the connection between two nodes is the result of their mutual affinity and attachment. In this paper, we propose a mutual selection model to characterize the weighted networks. By introducing a general mechanism of…
In this paper, we propose a self-learning mutual selection model to characterize weighted evolving networks. By introducing the self-learning probability $p$ and the general mutual selection mechanism, which is controlled by the parameter…
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…
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.…
A network's assortativity is the tendency of vertices to bond with others based on similarities, usually excess vertex degree. In this paper we consider assortativity in weighted networks, both directed and undirected. To this end, we…
We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathematical framework, and hence exhibit some common behaviors, for…
We model a social-encounter network where linked nodes match for reproduction in a manner depending probabilistically on each node`s attractiveness. The developed model reveals that increasing either the network`s mean degree or the…
Motivated by a recently introduced network growth mechanism that rely on the ranking of node prestige measures [S. Fortunato \emph{et al}., Phys. Rev. Lett. \textbf{96}, 218701 (2006)], a rank-based model for weighted network evolution is…
Mutualism is a biological interaction mutually beneficial for both species involved, such as the interaction between plants and their pollinators. Real mutualistic communities can be understood as weighted bipartite networks and they…
We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathematical framework, and hence exhibit some common behaviors, for…
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…
The configuration model is one of the most successful models for generating uncorrelated random networks. We analyze its behavior when the expected degree sequence follows a power law with exponent smaller than two. In this situation, the…
In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free…
We study mixing patterns in networks, meaning the propensity for nodes of different kinds to connect to one another. The phenomenon of assortative mixing, whereby nodes prefer to connect to others that are similar to themselves, has been…
Since some realistic networks are influenced not only by increment behavior but also by tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this…
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 review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…
The principle that 'the brand effect is attractive' underlies preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly develop a general framework…
A simple model is proposed to simulate the evolution of interpersonal relationships in a class. The small social network is simply assumed as an undirected and weighted graph, in which students are represented by vertices, and the extent of…
Assortativity measures the tendency of a vertex in a network being connected by other vertexes with respect to some vertex-specific features. Classical assortativity coefficients are defined for unweighted and undirected networks with…