Related papers: Weight-driven growing networks
In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$…
In this paper, a directed network model for world-wide web is presented. The out-degree of the added nodes are supposed to be scale-free and its mean value is $m$. This model exhibits small-world effect, which means the corresponding…
The role of weight on the weighted networks is investigated by studying the effect of weight on community structures. We use weighted modularity $Q^w$ to evaluate the partitions and Weighted Extremal Optimization algorithm to detect…
While gradient descent has proven highly successful in learning connection weights for neural networks, the actual structure of these networks is usually determined by hand, or by other optimization algorithms. Here we describe a simple…
Many classes of network growth models have been proposed in the literature for capturing real-world complex networks. Existing research primarily focuses on global characteristics of these models, e.g., degree distribution. We aim to shift…
In most networks, the connection between a pair of nodes is the result of their mutual affinity and attachment. In this letter, we will propose a Mutual Attraction Model to characterize weighted evolving networks. By introducing the initial…
The study of community networks has attracted considerable attention recently. In this paper, we propose an evolving community network model based on local processes, the addition of new nodes intra-community and new links intra- or…
We study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochastic component of evolution. New nodes are attached to the…
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…
Networked structure emerged from a wide range of fields such as biological systems, World Wide Web and technological infrastructure. A deeply insight into the topological complexity of these networks has been gained. Some works start to pay…
Using a model of wealth distribution where traders are characterized by quenched random saving propensities and trade among themselves by bipartite transactions, we mimic the enhanced rates of trading of the rich by introducing the…
In this paper we investigate networks whose evolution is governed by the interaction of a random assembly process and an optimization process. In the first process, new nodes are added one at a time and form connections to randomly selected…
Co-evolution exhibited by a network system, involving the intricate interplay between the dynamics of the network itself and the subsystems connected by it, is a key concept for understanding the self-organized, flexible nature of…
Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We…
In several real-world networks like the Internet, WWW etc., the number of links grow in time in a non-linear fashion. We consider growing networks in which the number of outgoing links is a non-linear function of time but new links between…
It has been discovered recently that many social, biological and ecological systems have the so-called small-world and scale-free features, which has provoked new research interest in the studies of various complex networks. Yet, most…
A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…
In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected…