# Scale-Free Graph with Preferential Attachment and Evolving Internal Vertex Structure

## Abstract

We extend the classical Barabási-Albert preferential attachment procedure to graphs with internal vertex structure given by weights of vertices. In our model, weight dynamics depends on the current vertex degree distribution and the preferential attachment procedure takes into account both weights and degrees of vertices. We prove that such a coupled dynamics leads to scale-free graphs with exponents depending on parameters of the weight dynamics.

### Keywords

Random graphs Scale-free graphs Preferential attachment## 1 Introduction

Many systems of interacting objects or individuals in natural and social sciences can be described by complex graphs [1, 5, 8, 10, 18]. Individuals positioned in vertices of such graphs interact along edges with their neighbors. The structure of neighborhoods may have a quite complex topology resulting from various random processes which describe mechanisms of growing graphs. To mimic the “the rich get richer” rule, Barabási and Albert used the preferential attachment in growing their graphs [1, 2, 3]. A preferential attachment rule says that a new vertex is linked with already existing ones with probabilities proportional to their degrees. Such a procedure leads to a scale-free graph with a power-law degree distribution, *P*(*k*)∼*k*^{−3}. This was heuristically understood in [1, 2, 3] and proved mathematically in [7, 11].

Since then there were proposed many generalizations and extensions of the preferential attachment procedure. In the Erdös-Rényi random graph [13], an edge is created with a fixed probability between any two vertices of a given finite set. It is easy to see that degrees of vertices in the Erdös-Rényi graph follow the Poisson distribution. The Erdös-Rényi procedure was generalized to graphs with vertices with an internal fitness in [4, 6]. In such models, the probability of creating an edge between two vertices depends on their fitnesses. Various distributions of internal fitnesses lead to scale-free graphs with various exponents. In growth models which generalize directly the preferential attachment rule, probability of linking a new vertex with an already existing one is proportional to the product of its degree and fitness [4, 17].

In this paper, we generalize the above procedure to allow both vertex fitnesses and degrees to evolve in the coupled dynamics. Namely, we introduce a variable which describes an internal state of a given vertex—its weight. We allow weights of vertices to undergo a simple dynamics with rates proportional to their current degrees. At the same time, our preferential attachment procedure takes into account both weights and degrees of vertices—a probability of linking a new vertex with an already existing one is proportional to the product of its degree and weight. Our model is a coupled dynamics toy model. Its simplicity allows us to prove rigorously that generated graphs are scale free and to derive analytically power-law exponents which depend on parameters of the weight dynamics.

Recently, in the framework of evolutionary game theory, there were analyzed models with co-evolving graph structure and strategy profile [12, 14, 16, 19]. In spatial games, players are located at vertices and play games with their neighbors. The payoff of any player is then the sum of payoffs resulting from individual games. Players may simultaneously change their strategies and rewire connections with other players taking into account their payoffs. This leads to co-evolutionary model of graph structure and strategies. In [14], scale free networks were obtained in special multi-adaptive games. In above and other models, topological and strategic properties were obtained by means of computer simulations and various approximations. To the best of our knowledge, our model is the first coupled dynamics with analytically derived power-law exponents. To prove our results we introduce a fairly general new approach.

## 2 Coupled Dynamics of Graph Growth and Weights

We will now define precisely our discrete-time dynamical model. We assume that every vertex may have one of two weights, *w*_{1}>0 and *w*_{2}>0, satisfying *w*_{1}+*w*_{2}=1. The mechanism of the graph growth combines a classical procedure of the preferential attachment [1, 2, 3] and a simple mutation dynamics of weights. At time *t*=1, the graph consists of two vertices connected by a single edge, both with the *w*_{1} weight. Now we describe inductively the dynamics. At any time *t*+1 we have two substeps. In the first substep, we add one new vertex with the weight *w*_{1} and connect it with the probability \(\frac{k_{i}w_{i}}{2t}\) to one of the vertices present at time *t*, where *k*_{i} is the degree of the vertex *i* and *w*_{i} is its weight. Observe that the sum of degrees of all vertices at time *t* is equal to 2*t*. Because \(\sum_{i}\frac{k_{i}w_{i}}{2t} < 1\), it is possible that no vertex will be chosen to be linked with the new one. In that case we link the new vertex with itself and assume that its degree is 2. In the second substep, we choose one vertex with the probability proportional to its degree, in order to upgrade its weight. Then we assign to the chosen vertex a weight *w*_{i} with the probability *w*_{i}, *i*=1,2.

Let us observe that for *w*_{1}=1 we retrieve the original Barabási-Albert model. On the other hand, in the case of *w*_{1}=*w*_{2}=1/2, although vertices do not differ with respect to their weights, our model is not reduced to the original one because at every step, with 1/2 probability a self-connected vertex is created. As a consequence, with a very high probability our graph is not connected.

*N*

_{k}(

*t*)=[

*N*

_{k}(1,

*t*),

*N*

_{k}(2,

*t*)]

^{T}be the column vector of expected number of vertices of the degree

*k*and weights

*w*

_{1}and

*w*

_{2}at time

*t*. We assume that both substeps are performed independently. It follows that for

*k*>2,

*t*≥2 and

*i*,

*j*=1,2;

*i*≠

*j*, with the initial condition

*N*

_{1}(1,1)=2. We do not write recurrence relations for

*N*

_{k}(

*i*,

*t*),

*k*=1,2; the asymptotic behavior of

*N*

_{k}(

*i*,

*t*) does not depend on them as it will be seen below.

*G*

_{k}=[

*g*

_{ij}]

_{i,j=1,2}, where \(g_{ij} = -\frac{k}{2}w_{i}\) if

*i*≠

*j*and \(g_{ii} = \frac{k}{2}\),

*F*=[

*f*

_{ij}]

_{i,j=1,2}, where

*f*

_{ii}=

*w*

_{i}/2 and

*f*

_{ij}=0 for

*i*≠

*j*.

The above recurrence equation is a two-dimensional generalization of a scalar equation which served as a starting point in the analysis of the original Barabási-Albert model [9]. Our approach is different. As a special case (*w*_{1}=1) we re-derive the exponent for the original Barabási-Albert model. Using the induction on *k* in Eq. (2), we can prove that like in the original model, the graph evolves in the linear way, that is for every *k*, \(\frac{N_{k}}{t} \to v_{k}\) when *t*→∞, for some vector of constants *v*_{k}=[*v*_{k}(1),*v*_{k}(2)]^{T}. To be more precise, the linear evolution follows from the fact that the matrix (*I*+*G*_{k}) is positive definite (details will be provided in a separate paper).

*v*

_{k}, satisfy the following system of linear equations:

*s*

_{k}=

*v*

_{k}(1)+

*v*

_{k}(2), then \(r_{k}(i)=\frac {v_{k}(i)}{s_{k}},i=1,2\), is the fraction of vertices of the weight

*w*

_{i}in the population of

*k*-degree vertices. It is easy to see that

*r*

_{k}(

*i*) converges to

*w*

_{i}as

*k*→∞. Our main result is that the appropriate rate of this convergence implies the power law of vertex degree distribution. Our approach is very general and it enables us to calculate analytically the exponent of the power law and to show its dependence on the weight

*w*

_{1}. From Eq. (3) we get that

## 3 Results and Proofs

Let us now formulate our main result.

### Theorem

*The distribution of vertex degrees in our coupled preferential attachment and weight dynamics satisfies the power law*,

*that is*

*s*

_{k}

*k*

^{β}→

*c*

*for some positive constant*

*c*,

*where*

*where*

*d*(

*w*

_{1})

*is given in*(30).

*β*, an exponent of the power law, as a function of the weight

*w*

_{1}. For

*w*

_{1}→0 and

*w*

_{1}→1, the exponent tends to 3. For

*w*

_{1}=1 it is expected because in that case our model becomes the standard Barabási-Albert one. For

*w*

_{1}=0, our model behaves like the Barabási-Albert one in the limit of the infinite

*k*. We also see that the exponent of the power law is symmetric with respect to the line

*w*

_{1}=

*w*

_{2}=1/2 which again is a consequence of the fact that the exponent describes the behavior of the network in the limit of the infinite

*k*and therefore it does not depend on initial conditions. The maximum

*β*=5 is obtained for

*w*

_{1}=

*w*

_{2}=1/2. As it was mentioned before, although vertices do not differ with respect to their degrees, our model is not reduced to the original one because self-connected vertices are created with 1/2 probability.

We have also performed stochastic simulations of the graph growth for certain values of *w*_{1} and obtained power-law exponents numerically. We build the network of 10^{9} vertices and we repeat the simulation 1000 times to have more data. Results of computer simulations agree with the analytical solution quite well as it can be seen in Fig. 1. The discrepancy grows as we approach *w*_{1}=1/2. In the limiting case we get numerically *β*=4.92 instead of the rigorous analytical result *β*=5. In this case, self-connected vertices are created with 1/2 probability. One then needs to build big networks to get the right exponent. Necessity of having big networks to get large exponents was discussed in [15]. They showed there that to get *β*=5 one really needs 10^{12} vertices which is beyond our computational capabilities.

### Special Cases

We will first derive an approximate formula for *β* as a function of *w*_{1} in the vicinity of *w*_{1}=1/2. The starting point is Eq. (3). We begin with the following mathematical result.

### Lemma

*If a sequence*

*n*

_{k},

*k*=0,1,…,

*of positive real numbers satisfies the following recurrence equations*:

*where*

*θ*>1,

*then for some constant*

*c*

*we have*

### Proof

*n*

_{k}in the form:

*n*

_{k}=

*k*

^{−β}which satisfies the assumption of the lemma. It is easy to see that the second product has a limit. We then multiply Eq. (8) by

*n*

_{k}=

*k*

^{−β}and the lemma is proved. □

*w*

_{1}=

*w*

_{2}=1/2. We add the above two equations and get one-dimensional recurrence equations,

*β*=5. Now we set

*w*

_{1}=1/2+

*ϵ*, expand Eqs. (9) in powers of

*ϵ*, keep linear terms only and get

*s*

_{k}=

*v*

_{k}(1)+

*v*

_{k}(2) and

*w*

_{k}=

*v*

_{k}(1)−

*v*

_{k}(2).

*w*

_{k}=2(

*d*(

*ϵ*)/

*k*+

*ϵ*)

*s*

_{k}for some function

*d*(

*ϵ*). At the moment this is an ansatz allowing us to solve the system of recurrence equations. It follows directly from the proposition stated and proved below. Equation (12) now read

*ϵ*

^{2}term, then the first equation in (13) tells us that

*s*

_{k}satisfies the power law with the exponent

*β*=5−8

*ϵd*(

*ϵ*) and the second one tells us that the exponent is equal to \(1+\frac{2d(\epsilon )}{\epsilon}\). The consistency requires that these two expressions are equal and we get

*β*is given below in (30).

### Proofs

Let us now come back to our theorem. We will examine the rate of convergence of *r*_{k}(*i*) to *w*_{i}. □

### Proposition

\(r_{k}(i) = w_{i} + \frac{d_{i}}{k} + O(\frac{1}{k^{\theta}})\), *where**θ*>1 *and**d*_{1}+*d*_{2}=0.

The theorem follows directly from the above proposition and Eqs. (4–5) with *d*(*w*_{1})=*d*_{1}.

### Proof of the Proposition

*A*

_{k},

*B*

_{k}and

*C*

_{k}in powers of 1/

*k*and get

*A*,

*B*, and

*C*are limits of

*A*

_{k},

*B*

_{k}, and

*C*

_{k}as

*k*→∞, so we have:

### Proof of the convergence of the sequence *k*(*r*_{k}(*i*)−*w*_{i})

*r*

_{k}(1) and obtain the following equation: where

*η*(

*k*) is convergent, the limit is denoted by

*η*.

*γ*(

*k*)=

*k*(

*r*

_{k}(1)−

*w*

_{1}). It follows from Eqs. (20–21) that

*m*,

*b*, where 0<

*m*<1. Now let

*γ*

_{2}(

*k*)=

*mγ*(

*k*−1)+

*b*for

*k*>1 and

*γ*

_{2}(1)=

*γ*(1). It can be easily shown that

*P*. Now we have to prove that the sequence \(l_{k} = \sum_{i=1}^{k-1} \frac{m^{i}}{k-i}\) converges to 0. We have

### Proof that \(r_{k}(i)= w_{i} + \frac{d_{i}}{k} + O(\frac {1}{k^{\theta}})\) for some *θ*>1

*γ*(

*k*) by

*γ*hence

*γ*=

*mγ*+

*b*. We would like to prove that there exists

*σ*>0 such that lim

_{k→∞}

*k*

^{σ}(

*γ*(

*k*)−

*γ*)=0. We denote

*k*

^{σ}(

*γ*(

*k*)−

*γ*) by

*ζ*

_{σ}(

*k*). We subtract

*γ*=

*mγ*+

*b*from (22) and multiply the new equation by

*k*

^{σ}(for

*σ*∈(0,1)) and obtain

*ζ*(0)=

*ζ*

_{θ}(0) and

*ζ*(

*k*)=

*mζ*(

*k*−1). We get

*W*. We use again the Stolz theorem and obtain that sequences, {

*ζ*(

*k*)} and {

*ζ*

_{σ}(

*k*)}, have the same limit hence it is equal to 0. We can take

*θ*=1+

*σ*and the Proposition is proved.

*d*(

*w*

_{1}) present in (6),

Let us observe that *ϵ* expansion around *w*_{1}=1/2 agrees with (14).

## 4 Conclusions

We introduced a coupled dynamics of growing scale-free graphs with evolving vertex weights. In our generalized preferential attachment procedure, a probability of a new link is proportional to the product of a degree and a weight of a given vertex. Vertex weights evolve as the graph grows. Our main general result is that an appropriately fast convergence of the percentage of vertices of a given weight implies the power law of the overall degree distribution. We derive analytically power-law exponents and show that they depend on parameters of the weight dynamics. Our approach involves two-dimensional recurrence relations as opposed to the original one-dimensional Barabási-Albert model. To the best of our knowledge, our model is the first one with the coupled dynamics of the graph growth and evolution of vertex weights (fitnesses) with analytically derived power-law exponents. Methods developed here can be used in other models of growing graphs.

## Notes

### Acknowledgements

J.M. would like to thank the Ministry of Science and Higher Education for a financial support under the grant N201 023 31/2069 and M.M. thanks PL-Grid Infrastructure for a support and Warsaw Center of Mathematics and Computer Science for a financial support within the framework of the PhD internship.

### References

- 1.Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys.
**74**, 47–97 (2002) ADSMATHCrossRefGoogle Scholar - 2.Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science
**286**, 509–512 (1999) MathSciNetADSCrossRefGoogle Scholar - 3.Barabási, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A
**272**, 173–187 (1999) ADSCrossRefGoogle Scholar - 4.Bianconi, G., Barabási, A.-L.: Competition and multiscaling in evolving networks. Europhys. Lett.
**54**, 436–442 (2001) ADSCrossRefGoogle Scholar - 5.Boccalettia, S., Latorab, V., Moreno, Y., Chavez, M., Hwanga, D.-U.: Complex networks: structure and dynamics. Phys. Rep.
**424**, 175–308 (2006) MathSciNetADSCrossRefGoogle Scholar - 6.Caldarelli, G., Capocci, A., De Los Rios, P., Munoz, M.A.: Scale-free networks from varying vertex intrinsic fitness. Phys. Rev. Lett.
**89**, 258702 (2002) ADSCrossRefGoogle Scholar - 7.Chung, F., Lu, L.: Complex Graphs and Networks. Am. Math. Soc., Providence (2006) MATHGoogle Scholar
- 8.Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003) MATHGoogle Scholar
- 9.Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks with preferential linking. Phys. Rev. Lett.
**85**, 4633–4636 (2000) ADSCrossRefGoogle Scholar - 10.Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: Critical phenomena in complex networks. Rev. Mod. Phys.
**80**, 1275–1335 (2008) ADSCrossRefGoogle Scholar - 11.Durrett, R.: Random Graph Dynamics. Cambridge University Press, Cambridge (2007) MATHGoogle Scholar
- 12.Ebel, H., Bornholdt, S.: Coevolutionary games on networks. Phys. Rev. E
**66**, 056118 (2002) ADSCrossRefGoogle Scholar - 13.Erdös, P., Rényi, A.: On random graphs. Publ. Math. (Debr.)
**6**, 290–297 (1959) MATHGoogle Scholar - 14.Lee, S., Holme, P., Wu, Z.-X.: Emergent hierarchical structures in multiadaptive games. Phys. Rev. Lett.
**106**, 028702 (2011) ADSCrossRefGoogle Scholar - 15.Onnela, J.-P., Saramäki, J., Hyvönen, J., Szabó, G., Lazer, D., Kaski, K., Kertész, J., Barabási, A.-L.: Structure and tie strengths in mobile communication networks. Proc. Natl. Acad. Sci. USA
**104**, 7332–7336 (2007) ADSCrossRefGoogle Scholar - 16.Pacheco, J.M., Traulsen, A., Nowak, M.A.: Coevolution of strategy and structure in complex networks with dynamical linking. Phys. Rev. Lett.
**97**, 258103 (2006) ADSCrossRefGoogle Scholar - 17.Santiago, A., Benito, R.M.: An extended formalism for preferential attachment in heterogeneous complex networks. Europhys. Lett.
**82**, 58004 (2008) ADSCrossRefGoogle Scholar - 18.Watts, D.: Small Worlds. Princeton University Press, Princeton (1999) Google Scholar
- 19.Zimmermann, M.G., Eguiluz, V.M., San Miguel, M.: Coevolution of dynamical states and interactions in dynamic networks. Phys. Rev. E
**69**, 065102(R) (2004) ADSCrossRefGoogle Scholar

## Copyright information

**Open Access** This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.