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, which makes it is neither entirely degree preferential nor entirely weight preferential. Second, it can tell us not only the chance that each already-existing vertex being connected but also how much weight each new edge has. The generalized preferential attachment can generate four power-law distributions, besides the three for vertex degrees, vertex strengths, and edge weights, it yield a new power-law distribution for the subgraph degrees.
This paper expands the degree-based consideration of the preferential attachment growth process and applies five different connectivity criteria (node degree, clustering coefficient, betweenness centrality, closeness centrality, and eigenvector centrality) to define the development of new links in the networks. Based on statistical inference, the analysis shows that all the available control attributes are capable generating SF networks, that the proposed generalized preferential attachment growth process produces networks of statistically different topologies, under different control-attribut…
Preferential attachment is commonly invoked to explain the emergence of those heavy-tailed degree distributions characteristic of growing network representations of diverse real-world phenomena. Experimentally confirming this hypothesis in real-world growing networks is an important frontier in network science research. Conventional preferential attachment estimation methods require that a growing network be observed across at least two snapshots in time. Numerous publicly available growing network datasets are, however, only available as single snapshots, leaving the applied network scientist…
The network properties of a graph ensemble subject to the constraints imposed by the expected degree sequence are studied. It is found that the linear preferential attachment is a fundamental rule, as it keeps the maximal entropy in sparse growing networks. This provides theoretical evidence in support of the linear preferential attachment widely exists in real networks and adopted as a crucial assumption in growing network models. Besides, in the sparse limit, we develop a method to calculate the degree correlation and clustering coefficient in our ensemble model, which is suitable for all ki…
We perform an empirical study of the preferential attachment phenomenon in temporal networks and show that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network considered. The classical preferential attachment model for networks by Barabási and Albert (1999) assumes a linear relationship between the number of neighbors of a node in a network and the probability of attachment. Although this assumption is widely made in Web Science and related fields, the underlying linearity is rarely measured. To fill this gap, this paper pe…
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random {\em hypergraph} model to a random {\em preferential attachment hypergraph} model. We then analyze the degree distribution of random preferential attachment hypergraphs and show that they possess heavy tail degree distribution properties similar to those o…
Preferential attachment is a popular generative mechanism to explain the widespread observation of power law distributed networks. We introduce an alternative explanation for the phenomenon by allowing the link growth rates to vary across the nodes according to a randomized Poisson process. The distribution of rates, which reproduces the degree distribution of a preferential attachment process (Yule process) is derived analytically. We demonstrate with use of simulations that the degree distribution and growth rates in single time intervals are similar for the random process and the preferenti…
We analyze whether preferential attachment in scientific coauthorship networks is different for authors with different forms of centrality. Using a complete database for the scientific specialty of research about "steel structures," we show that betweenness centrality of an existing node is a significantly better predictor of preferential attachment by new entrants than degree or closeness centrality. During the growth of a network, preferential attachment shifts from (local) degree centrality to betweenness centrality as a global measure. An interpretation is that supervisors of PhD projects …
The mechanism of preferential attachment underpins most recent social network formation models. Yet few authors attempt to check or quantify assumptions on this mechanism. We call generalized preferential attachment any kind of preference to interact with other agents with respect to any node property. We then introduce tools for measuring empirically and characterizing comprehensively such phenomena, and apply these tools to a socio-semantic network of scientific collaborations, investigating in particular homophilic behavior. This opens the way to a whole class of realistic and credible soci…
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we identify a topological phase transition depending on the rate of node removal and the relative strength of preferential vs. random attachment, where the degree distribution goes from a power law to one with an exponential tail.
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 power law. Also, the global and the average local clustering coefficients were analyzed. We expand these results by analyzing the assortativity property of the PA-class of models. Namely, we analyze the behavior of $d_{nn}(d)$ which is the average degree of a neighbor of a vertex of degree $d$.
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 addition of both vertices and edges, and the edges attach themselves to a vertex with a probability proportional to its degree. Simulations hint, though not conclusively, that both growth and preferential attachment are necessary for scale free behavior. We derive analytic expressions for degree distributions for networks that grow by the addition of edges to a fix…
Network Inequality through Preferential Attachment, Triadic Closure, and Homophily
Complexity Science Hub（复杂性科学中心）；Department of Network and Data Science, Central European University（中欧大学网络与数据科学系）；Graz University of Technology（格拉茨工业大学）；Grupo de Sistemas Complejos, ETS de Arquitectura de Madrid, Universidad Politécnica de Madrid（马德里理工大学马德里建筑高等技术学院复杂系统小组）；Faculty of Engineering, Free University of Bozen-Bolzano（博尔扎诺-博岑自由大学工程学院）；Center for Computational and Stochastic Mathematics, Instituto Superior Tecnico（里斯本高等理工学院计算与随机数学中心）
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of preferential attachment indices which are different from the previous one. Traditionally, the preferential attachment index is defined by the product of the related nodes degrees, while the new indices will define the similarity score of a pair of nodes by either the maximum in the two nodes degrees or the summarization of their degrees. Extensive experiments ar…
All real networks are different, but many have some structural properties in common. There seems to be no consensus on what the most common properties are, but scale-free degree distributions, strong clustering, and community structure are frequently mentioned without question. Surprisingly, there exists no simple generative mechanism explaining all the three properties at once in growing networks. Here we show how latent network geometry coupled with preferential attachment of nodes to this geometry fills this gap. We call this mechanism geometric preferential attachment (GPA), and validate i…
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 paper, it is found that the global preferential attachment emerges from the local interaction models, including distance-dependent preferential attachment (DDPA) evolving model of weighted networks(M. Li et al, New Journal of Physics 8 (2006) 72), acquaintance network model(J. Davidsen et al, Phys. Rev. Lett. 88 (2002) 128701) and connecting nearest-neighbor(CNN…
We examine the effects of preferential attachment on a model of competing clusters. In the original model, cluster masses grow at the expense of their neighbours; on a lattice, this is known to result in the asymptotic survival and indefinite growth of clusters which are isolated from each other. The presence of preferential attachment results in an inhomogeneous topology, where hubs monopolize the connections, while most other nodes are sparsely connected. Interestingly, this results in the protection of the less massive clusters from annihilation, to which the hubs are doomed.
Relevance and importance are the main factors when humans build network connections. We propose an evolutionary network model based on preferential attachment(PA) considering these factors. We analyze and compute several important features of the network class generated by this algorithm including scale free degree distribution, high clustering coefficient, small world property and core-periphery structure. We then compare this model with other network models and empirical data such as inter-city road transportation and air traffic networks.
We investigate a class of network growth rules that are based on a redirection algorithm wherein new nodes are added to a network by linking to a randomly chosen target node with some probability 1-r or linking to the parent node of the target node with probability r. For fixed 0<r<1, the redirection algorithm is equivalent to linear preferential attachment. We show that when r is a decaying function of the degree of the parent of the initial target, the redirection algorithm produces sublinear preferential attachment network growth. We also argue that no local redirection algorithm can produc…
Complex systems can be characterized by classes of equivalency of their elements defined according to system specific rules. We propose a generalized preferential attachment model to describe the class size distribution. The model postulates preferential growth of the existing classes and the steady influx of new classes. We investigate how the distribution depends on the initial conditions and changes from a pure exponential form for zero influx of new classes to a power law with an exponential cutoff form when the influx of new classes is substantial. We apply the model to study the growth d…
The Mean Field Approximation (MFA), or continuum method, is often used in courses on Networks to derive the degree distribution of preferential attachment networks. This method is simple and the outcome is close to the correct answer. However, this paper shows that the method is flawed in several aspects, leading to unresolvable contradictions. More importantly, the MFA is not explicitly derived from a mathematical model. An analysis of the implied model shows that it makes an approximation which is far from the truth and another one which can not be motivated in general. The success of the MF…
We propose a simple preferential attachment model of growing network using the complementary probability of Barabási-Albert (BA) model, i.e., $Π(k_i) \propto 1-\frac{k_i}{\sum_j k_j}$. In this network, new nodes are preferentially attached to not well connected nodes. Numerical simulations, in perfect agreement with the master equation solution, give an exponential degree distribution. This suggests that the power law degree distribution is a consequence of preferential attachment probability together with "rich get richer" phenomena. We also calculate the average degree of a target node at ti…
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 proposed by Barabasi and Albert: nodes are added to the network connecting preferably to other nodes that are more connected. We also presented models that consider more representative elements from social perspectives, such as the homophily between the vertices or the fitness that each node has to build connections. Furthermore, we showed a version of these mo…
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 process with positive increments. We will define two regimes in which our graph reproduces some features of two well known preferential attachment models: the Bianconi-Barabási and the Barabási-Albert models. We will discuss a few conjectures on these models, including the convergence of the degree sequence and the appearance of Bose-Einstein condensation in …
Many complex systems have been shown to share universal properties of organization, such as scale independence, modularity and self-similarity. We borrow tools from statistical physics in order to study structural preferential attachment (SPA), a recently proposed growth principle for the emergence of the aforementioned properties. We study the corresponding stochastic process in terms of its time evolution, its asymptotic behavior and the scaling properties of its statistical steady state. Moreover, approximations are introduced to facilitate the modelling of real systems, mainly complex netw…
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 is similar to the one of the fitness model of Bianconi and Barabasi, with a fitness distribution dependent on the metric and the density of nodes. We show that curvature singularities in these spaces can give rise to asymptotic Bose-Einstein condensation, but transient condensation can be observed also in smooth hyperbolic spaces with strong curvature. We pr…
We propose a preferential attachment model for network growth where new entering nodes have a partial information about the state of the network. Our main result is that the presence of bounded information modifies the degree distribution by introducing an exponential tail, while it preserves a power law behaviour over a finite small range of degrees. On the other hand, unbounded information is sufficient to let the network grow as in the standard Barabási-Albert model. Surprisingly, the latter feature holds true also when the fraction of known nodes goes asymptotically to zero. Analytical res…
We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses neighbours by preferential attachment, and selects its type based on the number of initial neighbours of each type. The model is analysed in detail, and in particular, we determine the possible proportions of the various types in the limit of large networks. An important qualitative feature we find is that, in contrast to many current theoretical models, often se…
We propose a statistical method to estimate simultaneously the non-parametric transitivity and preferential attachment functions in a growing network, in contrast to conventional methods that either estimate each function in isolation or assume some functional form for them. Our model is shown to be a good fit to two real-world co-authorship networks and be able to bring to light intriguing details of the preferential attachment and transitivity phenomena that would be unavailable under traditional methods. We also introduce a method to quantify the amount of contributions of those phenomena i…
The classical preferential attachment model is sensitive to the choice of the initial configuration of the network. As the number of initial nodes and their degree grow, so does the time needed for an equilibrium degree distribution to be established. We study this phenomenon, provide estimates of the equilibration time, and characterize the degree distribution cutoff observed at finite times. When the initial network is dense and exceeds a certain small size, there is no equilibration and a suitable statistical test can always discern the produced degree distribution from the equilibrium one.…
We introduce a mechanism which models the emergence of the universal properties of complex networks, such as scale independence, modularity and self-similarity, and unifies them under a scale-free organization beyond the link. This brings a new perspective on network organization where communities, instead of links, are the fundamental building blocks of complex systems. We show how our simple model can reproduce social and information networks by predicting their community structure and more importantly, how their nodes or communities are interconnected, often in a self-similar manner.
The goal of the study is to determine the underlying processes leading to the observed collaborator distribution in modern scientific fields, with special attention to non-power law behavior. Nanoscience is used as a case study of a modern interdisciplinary field, and its coauthorship network for 2000-04 period is constructed from NanoBank database. We find three collaboration modes that correspond to three distinct ranges in the distribution of collaborators: (1) for authors with fewer than 20 collaborators (the majority) preferential attachment does not hold and they form a log-normal "hook"…
Many real-world systems are profitably described as complex networks that grow over time. Preferential attachment and node fitness are two simple growth mechanisms that not only explain certain structural properties commonly observed in real-world systems, but are also tied to a number of applications in modeling and inference. While there are statistical packages for estimating various parametric forms of the preferential attachment function, there is no such package implementing non-parametric estimation procedures. The non-parametric approach to the estimation of the preferential attachment…
Bitcoin and Ethereum transactions present one of the largest real-world complex networks that are publicly available for study, including a detailed picture of their time evolution. As such, they have received a considerable amount of attention from the network science community, beside analysis from an economic or cryptography perspective. Among these studies, in an analysis on the early instance of the Bitcoin network, we have shown the clear presence of the preferential attachment, or "rich-get-richer" phenomenon. Now, we revisit this question, using a recent version of the Bitcoin network …
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, under very general conditions, these two models yield the same dynamic equation of network growth, $\frac{dK}{dt}=A(t)(K+K_{0})$, where $A(t)$ is the aging constant, $K$ is the node's degree, and $K_{0}$ is the initial attractivity. Basing on this result, we show that the fitness model provides an underlying microscopic basis for the preferential attachment mech…
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 significance remain unsolved for decades. Here we study the dynamics of networks evolving according to preferential attachment, known to approximate well the large-scale growth dynamics of a variety of real networks. We show that this dynamics is Hamiltonian, thus casting the study of complex networks dynamics to the powerful canonical formalism, in which the time evol…
Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power grids, and biological networks, to name a few. Motivated by the application of key predistribution in wireless sensor networks (WSN), we initiate the study of preferential attachment with degree bound. Our paper has two important contributions to two different areas. The first is a contribution in the study of complex networks. We propose preferential attachment model with degree bound for the first time. In the norm…
We propose a model of network growth in which the network is co-evolving together with the dynamics of a quantum mechanical system, namely a quantum walk taking place over the network. The model naturally generalizes the Barabási-Albert model of preferential attachment and has a rich set of tunable parameters, such as the initial conditions of the dynamics or the interaction of the system with its environment. We show that the model produces networks with two-modal power-law degree distributions, super-hubs, finite clustering coefficient, small-world behaviour and non-trivial degree-degree cor…
Reciprocity characterizes the information exchange between users in a network, and some empirical studies have revealed that social networks have a high proportion of reciprocal edges. Classical directed preferential attachment (PA) models, though generating scale-free networks, may give networks with low reciprocity. This points out one potential problem of fitting a classical PA model to a given network dataset with high reciprocity, and indicates alternative models need to be considered. We give one possible modification of the classical PA model by including another parameter which control…
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 (PA) model does not match empirical evidence. In this paper, we extend the classical 3-scenario directed PA model by adding an additional parameter that controls the probability of creating a reciprocal edge. Our proposed model also allows edge creation between two existing nodes, making it a more realistic choice for fitting to real datasets. …
We study the following preferential attachment variant of the classical Erdos-Renyi random graph process. Starting with an empty graph on n vertices, new edges are added one-by-one, and each time an edge is chosen with probability roughly proportional to the product of the current degrees of its endpoints (note that the vertex set is fixed). We determine the asymptotic size of the giant component in the supercritical phase, confirming a conjecture of Pittel from 2010. Our proof uses a simple method: we condition on the vertex degrees (of a multigraph variant), and use known results for the con…
Preferential attachment drives the evolution of many complex networks. Its analytical studies mostly consider the simplest case of a network that grows uniformly in time despite the accelerating growth of many real networks. Motivated by the observation that the average degree growth of nodes is time-invariant in empirical network data, we study the degree dynamics in the relevant class of network models where preferential attachment is combined with heterogeneous node fitness and aging. We propose a novel analytical framework based on the time-invariance of the studied systems and show that i…
We present an analysis of the statistical properties and growth of the free on-line encyclopedia Wikipedia. By describing topics by vertices and hyperlinks between them as edges, we can represent this encyclopedia as a directed graph. The topological properties of this graph are in close analogy with that of the World Wide Web, despite the very different growth mechanism. In particular we measure a scale--invariant distribution of the in-- and out-- degree and we are able to reproduce these features by means of a simple statistical model. As a major consequence, Wikipedia growth can be describ…
We generalize the scale-free network model of Barabàsi and Albert [Science 286, 509 (1999)] by proposing a class of stochastic models for scale-free interdependent networks in which interdependent nodes are not randomly connected but rather are connected via preferential attachment (PA). Each network grows through the continuous addition of new nodes, and new nodes in each network attach preferentially and simultaneously to (a) well-connected nodes within the same network and (b) well-connected nodes in other networks. We present analytic solutions for the power-law exponents as functions of t…
Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist and no general model allows to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. We present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law and we give theoretical lower bounds for its modularit…
In the Yule-Simon process, selection of words follows the preferential attachment mechanism, resulting in the power-law growth in the cumulative number of individual word occurrences. This is derived using mean-field approximation, assuming a continuum limit of both the time and number of word occurrences. However, time and word occurrences are inherently discrete in the process, and it is natural to assume that the cumulative number of word occurrences has a certain fluctuation around the average behavior predicted by the mean-field approximation. We derive the exact and approximate forms of …
Many real-world networks exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Particularly in social networks, the contribution to the total assortativity varies with degree, featuring a distinctive peak slightly past the average degree. The way traditional models imprint assortativity on top of pre-defined topologies is via degree-preserving link permutations, which however destroy the particular graph's hierarchical traits of clustering. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties a…
Many networks generated by nature have two generic properties: they are formed in the process of {preferential attachment} and they are scale-free. Considering these features, by interfering with mechanism of the {preferential attachment}, we propose a generalisation of the Barabási--Albert model---the 'Fractional Preferential Attachment' (FPA) scale-free network model---that generates networks with time-independent degree distributions $p(k)\sim k^{-γ}$ with degree exponent $2<γ\leq3$ (where $γ=3$ corresponds to the typical value of the BA model). In the FPA model, the element controlling the…
Empirical studies show that online social networks have not only in- and out-degree distributions with Pareto-like tails but also a high proportion of reciprocal edges. A classical directed preferential attachment (PA) model generates in- and out-degree distribution with power-law tails, but theoretical properties of the reciprocity feature in this model have not yet been studied. We derive the asymptotic results on the number of reciprocal edges between two fixed nodes, as well as the proportion of reciprocal edges in the entire PA network. We see that with certain choices of parameters, the …
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth, as a function of time. We consider both uniform attachment, where incoming nodes form links to existing nodes selected uniformly at random, and preferential attachment, when probabilities are assigned proportional to the degrees of the existing nodes. We consider the cases of single and multiple links being formed by each newly-introduced node. The initial conditions are arbitrary, that is, the solution depends on the degree distribution of the initial graph which i…
In this paper, we propose that relations between high order moments of data distributions, for example between the skewness (S) and kurtosis (K), allow to point to theoretical models with understandable structural parameters. The illustrative data concerns two cases: (i) the distribution of income taxes and (ii) that of inhabitants, after aggregation over each city in each province of Italy in 2011. Moreover, from the rank-size relationship, for either S or K, in both cases, it is shown that one obtains the parameters of the underlying (hypothetical) modeling distribution: in the present cases…
We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by the model. The class of random graphs so defined admits a representation theorem reminiscent of residual allocation, or "stick-breaking" schemes. We characterize how the vertex arrival times affect the asymptotic degree distribution, and relate the latter to neutral-to-the-left processes. Our random graphs generate edges "one end at a time", which sets up a on…
In this paper, we study the clustering properties of the Spatial Preferential Attachment (SPA) model introduced by Aiello et al. in 2009. This model naturally combines geometry and preferential attachment using the notion of spheres of influence. It was previously shown in several research papers that graphs generated by the SPA model are similar to real-world networks in many aspects. For example, the vertex degree distribution was shown to follow a power law. In the current paper, we study the behaviour of C(d), which is the average local clustering coefficient for the vertices of degree d. …
The spatial preferential attachment (SPA) is a model for complex networks. In the SPA model, nodes are embedded in a metric space, and each node has a sphere of influence whose size increases if the node gains an in-link, and otherwise decreases with time. In this paper, we study the behaviour of the SPA model when the distribution of the nodes is non-uniform. Specifically, the space is divided into dense and sparse regions, where it is assumed that the dense regions correspond to coherent communities. We prove precise theoretical results regarding the degree of a node, the number of common ne…
Preferential attachment, homophily and, their consequences such as the glass ceiling effect have been well-studied in the context of undirected networks. However, the lack of an intuitive, theoretically tractable model of a directed, bi-populated~(i.e.,~containing two groups) network with variable levels of preferential attachment, homophily and growth dynamics~(e.g.,~the rate at which new nodes join, whether the new nodes mostly follow existing nodes or the existing nodes follow them, etc.) has largely prevented such consequences from being explored in the context of directed networks, where …
