Related papers: Coexistence in preferential attachment networks
We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
A few of evolving models in hypernetworks have been proposed based on uniform growth. In order to better depict the growth mechanism and competitive aspect of real hypernetworks, we propose a model in term of the non-uniform growth. Besides…
In order to better understand dynamical functions on amounts of natural and man-made complex systems, lots of researchers from a wide range of disciplines, covering statistic physics, mathematics, theoretical computer science, and so on,…
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…
We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of "splitting" nodes of degree $k$ into $k$ nodes of degree 1. Four networks are considered, each…
We extend the study of a model of competitive cluster growth in an active medium to a basis of networks; this is done by adding nonlocal connections with probability $p$ to sites on a regular lattice, thus enabling one to interpolate…
Many networks exhibit scale free behavior where their degree distribution obeys a power law for large vertex degrees. Models constructed to explain this phenomena have relied on preferential attachment where the networks grow by the…
In this contribution we introduce local attachment as an universal network-joining protocol for peer-to-peer networks, social networks, or other kinds of networks. Based on this protocol nodes in a finite-size network dynamically create…
Global degree/strength based preferential attachment is widely used as an evolution mechanism of networks. But it is hard to believe that any individual can get global information and shape the network architecture based on it. In this…
Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…
We highlight intriguing features of complex networks that are grown by \emph{redirection}. In this mechanism, a target node is chosen uniformly at random from the pre-existing network nodes and the new node attaches either to this initial…
In this paper, we analyze assortativity of preferential attachment models. We deal with a wide class of preferential attachment models (PA-class). It was previously shown that the degree distribution in all models of the PA-class follows a…
Ever since the Barab\'{a}si-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured…
We study the evolution of cooperation in the prisoner's dilemma game, whereby a coevolutionary rule is introduced that molds the random topology of the interaction network in two ways. First, existing links are deleted whenever a player…
The preferential attachment (PA) model is a popular way of modeling dynamic social networks, such as collaboration networks. Assuming that the PA function takes a parametric form, we propose and study the maximum likelihood estimator of the…
Prediction and control of network dynamics are grand-challenge problems in network science. The lack of understanding of fundamental laws driving the dynamics of networks is among the reasons why many practical problems of great…
Inspired by language competition processes, we present a model of coupled evolution of node and link states. In particular, we focus on the interplay between the use of a language and the preference or attitude of the speakers towards it,…
We study collaboration networks in terms of evolving, self-organizing bipartite graph models. We propose a model of a growing network, which combines preferential edge attachment with the bipartite structure, generic for collaboration…
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…