Related papers: Recency-based preferential attachment models

In this article we presented a brief study of the main network models with growth and preferential attachment. Such models are interesting because they present several characteristics of real systems. We started with the classical model…

The preferential attachment network with fitness is a dynamic random graph model. New vertices are introduced consecutively and a new vertex is attached to an old vertex with probability proportional to the degree of the old one multiplied…

We study a random graph $G_n$, which combines aspects of geometric random graphs and preferential attachment. The resulting random graphs have power-law degree sequences with finite mean and possibly infinite variance. In particular, the…

In this paper we define a family of preferential attachment models for random graphs with fitness in the following way: independently for each node, at each time step a random fitness is drawn according to the position of a moving average…

Preferential attachment models form a popular class of growing networks, where incoming vertices are preferably connected to vertices with high degree. We consider a variant of this process, where vertices are equipped with a random initial…

We obtain the degree distribution for a class of growing network models on flat and curved spaces. These models evolve by preferential attachment weighted by a function of the distance between nodes. The degree distribution of these models…

We propose a new preferential attachment-based network growth model in order to explain two properties of growing networks: (1) the power-law growth of node degrees and (2) the decay of node relevance. In preferential attachment models, the…

We present a detailed study of the part of the Web related to media content, i.e., the Media Web. Using publicly available data, we analyze the evolution of incoming and outgoing links from and to media pages. Based on our observations, we…

In this paper, we first discuss the origin of preferential attachment. Then we establish the generalized preferential attachment which has two new properties; first, it encapsulates both the topological and weight aspects of a network,…

We consider a preferential attachment model that incorporates an anomaly. Our goal is to understand the evolution of the network before and after the occurrence of the anomaly by studying the influence of the anomaly on the structural…

We analyze the growth models for complex networks including preferential attachment (A.-L. Barabasi and R. Albert, Science 286, 509 (1999)) and fitness model (Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002)) and demonstrate that,…

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…

Reciprocity in social networks helps understand information exchange between two individuals, and indicates interaction patterns between pairs of users. A recent study indicates the reciprocity coefficient of a classical directed…

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

Many complex networks from the World-Wide-Web to biological networks are growing taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document as…

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…

In real life, networks are dynamic in nature; they grow over time and often exhibit power-law degree sequences. To model the evolving structure of the internet, Barab\'{a}si and Albert introduced a simple dynamic model with a power-law…

This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality…

In an affiliation network vertices are linked to attributes and two vertices are declared adjacent whenever they share a common attribute. For example, two customers of an internet shop are called adjacent if they have purchased the same or…

Many important real-world networks manifest "small-world" properties such as scale-free degree distributions, small diameters, and clustering. The most common model of growth for these networks is "preferential attachment", where nodes…