Related papers: Evolution of reference networks with aging
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$…
We study a new class of preferential attachment trees with \emph{self-reinforcement}. At each time, each vertex is assigned a weight equal to the cumulative sum over past times of an affine function of its degree. A new vertex attaches…
We show that the protein-protein interaction networks can be surprisingly well described by a very simple evolution model of duplication and divergence. The model exhibits a remarkably rich behavior depending on a single parameter, the…
Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law decays of the distribution of cluster sizes in the…
Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…
Are biological networks different from other large complex networks? Both large biological and non-biological networks exhibit power-law graphs (number of nodes with degree k, N(k) ~ k-b) yet the exponents, b, fall into different ranges.…
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…
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability…
Individual nodes in evolving real-world networks typically experience growth and decay --- that is, the popularity and influence of individuals peaks and then fades. In this paper, we study this phenomenon via an intrinsic nodal fitness…
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…
We introduce a model for directed spatial networks. Starting from an age-based preferential attachment model in which all arcs point from younger to older vertices, we add \emph{reciprocal} connections whose probabilities depend on the age…
In this letter, we study some evolution networks that grow with linear preferential attachment. Based upon some recent results on the quotient Gamma function, we give a rigorous proof of the asymptotic Mandelbrot law for the degree…
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…
In this paper we present a generalized model for network growth that links the microscopical agent strategies with the large scale behavior. This model is intended to reproduce the largest number of features of the Internet network at the…
This paper presents an evolution model of weighted networks in which the structural growth and weight dynamics are driven by human behavior, i.e. passenger route choice behavior. Transportation networks grow due to people's increasing…
In a highly influential paper twenty years ago, Barab\'asi and Albert [Science 286, 509 (1999)] showed that networks undergoing generic growth processes with preferential attachment evolve towards scale-free structures. In any finite…
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…
We introduce and simulate a growth model of the world-wide Web based on the dynamics of outgoing links that is motivated by the conduct of the agents in the real Web to update outgoing links (re)directing them towards constantly changing…
We propose a scale-free network model with a tunable power-law exponent. The Poisson growth model, as we call it, is an offshoot of the celebrated model of Barab\'{a}si and Albert where a network is generated iteratively from a small seed…
We study the organization and dynamics of growing directed networks. These networks are built by adding nodes successively in such a way that each new node has $K$ directed links to the existing ones. The organization of a growing directed…