A Solving Equation (12) for Uniform Single Attachment

# Network Growth with Arbitrary Initial Conditions: Degree Dynamics for Uniform and Preferential Attachment

## Abstract

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 is the substrate of the growth. Previous work in the literature focuses on the asymptotic state, that is, when the number of nodes added to the initial graph tends to infinity, rendering the effect of the initial graph negligible. Our contribution provides a solution for the expected degree distribution as a function of time, for arbitrary initial condition. Previous results match our results in the asymptotic limit. The results are discrete in the degree domain, and continuous in the time domain, where the addition of new nodes to the graph are approximated by a continuous arrival rate.

1

## I Introduction

The complex network literature spans various strands of research such as sociology Granovetter (1973); Wasserman and Faust (1994); Degenne and Forse (1999), economics Jackson and Rogers (2005); Bala and Goyal (2000), computer science Adamic (1999); Adamic et al. (2001); Leskovec et al. (), marketing Leskovec et al. (2007); Delre et al. (2010); Kim et al. (2006); Martins et al. (2009), epidemiology Newman (2002); Pastor-Satorras and Vespignani (2001a), genetics Elowitz and Leibler (2000), and bibliometrics Redner (2005). These domains aim to extract macro-scale behavior from given micro-scale interactions..

The structure of the underlying graph, which connects the agents and consequently regulates their interactions, is necessary for studying the dynamism of various phenomena, such as flow of information (news, rumors, trends, etc.) in the society Ben-Naim et al. (2003); Acemoglu et al. (2011), resilience against node or link failures (for the internet, it means survival of the system if certain nodes are shut down) Holme et al. (2002); Cohen et al. (2001), pace of diffusion of a contagious disease throughout a population and also optimal immunization strategies Pastor-Satorras and Vespignani (2001b, 2002a, 2002b), the effect of the network structure among actors on their chance of winning awards G. Rossmana (2010), to name a few. Models have been proposed to emulate different structural properties observed in real life graphs D.S.Price (2007); Price (1965); Erdős and Rényi (1959, 1960); Bollobás (2001a, b); Watts and Strogatz (1998); Newman and Watts (1999); Barabasi and Albert (1999); Barabasi et al. (1999).

In many applications, such as the world wide web Jeong et al. (2007); Zhou and Mondragón (2004) and scientific collaborations Newman (2004), networks are dynamic, that is, subject to growth. This provides motivation to view the problem of network formation dynamically. In this formulation, nodes are introduced successively, and they select from existing nodes whom to attach to. It mimics, for example, the mechanism by which new papers cite existing ones. Barabasi et al. (1999) takes this approach and introduces the preferential attachment mechanism, which is explained below. Also, in Krapivsky et al. (2000); Krapivsky and Redner (2001); Krapivsky et al. (2001); Krapivsky and Redner (2002) the problem is tackled by the conventional techniques of polymer physics. Both of these approaches employ approximations to solve the problem. In what follows, we go over these approximations and the corresponding results.

### i.1 Previous Work: Network Growth

In the linear preferential attachment scheme introduced in Barabasi et al. (1999), the growth mechanism is as follows. The growth process starts with nodes. Then, nodes are introduced one per unit time. Each node picks existing nodes to link to, with probabilities assigned to them proportional to their degrees. This means that an existing node with a higher degree will be more likely to attract the newly-introduced node. Denote the degree distribution of the graph when the total number of nodes is by . Their result can be expresses as follows:

 limt→∞pk(t)∼k−3. (1)

The analysis is done within the mean-field simplification and the solution is valid in the asymptotic case of . In Bollobás (2001b), this result is ameliorated by reformulating the problem more rigorously. Denote by the number of links that each newly-born node emanates to the existing nodes. The network growth process starts from a cycle. Let be defined as above. Also, define:

 ξβ,k\lx@stackreldef=2(β)(β+1)k(k+1)(k+2). (2)

In Theorem 1 in Bollobás (2001b), it is shown that in the limit , for any positive and for , the following holds:

 (1−ϵ)ξβ,k≤pk(N)≤(1+ϵ)ξβ,k. (3)

Note that the expression in (2) agrees with (1) for large values of .

The problem is also closely related to the so-called Polya’s urn problem F.Chung et al. (2003) in combinatorics. Given a finite number of bins, additional balls arrive one at a time. With a given probability, a new bin is created for the new ball. The ball otherwise joins an existing bin. It picks the destination bin with probabilities dependent on the existing number of balls within the bins. In F.Chung et al. (2003), the case where probabilities are proportional to is solved. The case of is akin to the linear preferential attachment scheme mentioned above.

A novel way to tackle the problem was presented in Krapivsky et al. (2000); Krapivsky and Redner (2001); Krapivsky et al. (2001); Krapivsky and Redner (2002, 2003) by employing the master equation approach which authors borrow from polymer physics. The result of (2) for the case of has been obtained using this approach (equation (2) inKrapivsky et al. (2000), (5) in Krapivsky and Redner (2003), (2) in Krapivsky and Redner (2001) and (2) in Krapivsky and Redner (2002)). For a treatment of finite size effects (when is not infinitely large) with primary focus on nodes with degree , see Krapivsky and Redner (2002). In Dorogovtsev et al. (2000), the generating function approach has been used to solve the master equation and the asymptotic distribution (2) for  has been recovered, and the asymptotic degree distribution up to the leading order of  has been obtained (for the initial condition of a single node with a specified number of incoming links from outside the network, since in Dorogovtsev et al. (2000), directed links can originate from unspecified sources, even from outside the network), in the form of , as a function of time  and time of birth , which is the time at which each node is introduced to the network. In the present paper, we seek   for arbitrary times, and links are necessarily emanated from the newly introduced nodes at each timestep, and also the links are undirected.

In Krapivsky et al. (2000), the uniform attachment scheme is also examined. This means that, new nodes attach to existing nodes with equal probabilities, regardless of their degrees. If we start from a single node at the outset, the resulting graph is called a Random Recursive Tree (RRT). The result presented in Krapivsky et al. (2000) for the asymptotic degree distribution of RRTs is as follows:

 limt→∞pk(t)=12k. (4)

The same result is also presented in Theorem 1 inNa and Rapoport (1970) and equation (49) in Janson (2005) following a combinatorial approach.

### i.2 Time-dependent Solution, Motivation

Previous work has been primarily revolved around the asymptotic degree distribution, that is, when the number of nodes tends to infinity. Also, in some case, further simplification is acquired by limiting the range of degrees. For long times, the effect of the initial graph is neglected. In this contribution, we start from an initial graph with known degree distribution . We solve for the expected degree distribution at time . We consider both uniform and linear preferential attachment (eventuating in a scale-free graph in the long run). The time-dependent solution, first develops intuition about the growth process, and the path that the system undergoes until it reaches the steady state. More importantly, the effect of the initial conditions is taken into account. Different substrates reach the equilibrium approximation of the degree distribution which is at hand, with different paces. The time-dependent solution illuminates the effect of the initial condition on the accuracy of the above-mentioned approximations.

Equipped with the time-dependent solution, one can also examine the short-time behavior, in marked contrast with the convention, which limits the solution to the long-time behavior. As an example of how the need for extracting the short-time growth of an existing graph is elicited in realistic applications, consider the network of supporters in a political campaign. Nodes are fanatics who absorb new people into the campaign, causing the network to expand throughout the potential electorate. The change in the network of followers in one day is not substantial compared to the existing size of the network. As another example, consider the social network within a country, with a small number of immigrants joining and enlarging the network. The number of immigrants typically constitutes a small fraction of the population of the host country (with possible exceptions of wars or other abrupt phase transitions, to minor degrees). Then, if one wants to study the social network of the host country, the conventional models cease to perform, because the fraction of new nodes to existing nodes does not tend to infinity, but is small. The same is true for any slowly-growing realistic network where the extrapolation of the near future provided information on the current state is called for.

### i.3 Organization of the Paper

First in subsection II.1 we consider the uniform attachment scheme, with each newly introduced node linking to one existing node picked uniformly at random. We compare our results with the ones present in the literature. Then in subsection II.2 we consider the uniform attachment for multiple linking, where each new node connects to existing nodes drawn uniformly at random. In III we examine the preferential attachment scheme. First in III.1 we consider each new node linking to only one existing node with probabilities assigned to existing nodes proportional to their degrees. Then in III.2 we assume each new node attaches to existing nodes. So each new node has degree upon birth. We solve for the expected degree distribution in all cases. Throughout the paper, we compare our theoretical findings with simulations.

## Ii Uniform Attachment

### ii.1 Single Connection

We start from an initial graph at time with nodes. We denote the degree distribution at the outset by . At each timestep, a new node is introduced. It picks one of the existing nodes uniformly at random and connects to it. Nodes are added one by one. If the initial condition is a single node, the resulting graph will be the conventional Random Recursive Tree Na and Rapoport (1970); Janson (2005); Krapivsky et al. (2000).

Let represent the rate at which new nodes are introduced, that is, nodes are added in a time interval of duration . It also means that each node is added within  unit times. So for example, if , then 100 nodes are introduced per unit time, and each of them arrives at 0.01 unit times. At time  there are nodes. Let denote the expected number of nodes whose degree is at time . Let us focus on the expected variation in in the time increment within which one new node is added.

With probability , a node with degree receives a link, and its degree increments. Consequently, decrements and increments, both by one. Similarly, with probability , a node with degree receives a link, hence increments and decrements, both by one. So we have:

 Nk(t+1α)−Nk(t)=Nk−1(t)−Nk(t)N(0)+αt. (5)

Note that the case of is distinct. Each new node increments by one. So,

 N1(t+1α)−N1(t)=−N1(t)N(0)+αt+1. (6)

These two equations can be condensed into one:

 Nk(t+1α)−Nk(t)=1N(0)+αt(Nk−1−Nk)+δk,1, (7)

where is the Kronecker delta function (i.e., if , and otherwise). Dividing both sides by , and denoting  by  (which means that one node arrives per ), we can recast this equation as the following:

 Nk(t+Δt)−Nk(t)Δt=αN(0)+αt(Nk−1−Nk)+αδk,1. (8)

In the limit , the following differential equation is obtained for the dynamics of the expected degree distribution:

 ˙Nk=αN(0)+αt(Nk−1−Nk)+αδk,1, (9)

where is the first derivative of with respect to time, and explicit dependence on time is omitted for expositional simplification.

Approximating the difference equation (7) with its differential analog (9) has error of order  (readily seen through the Taylor expansion of )), which can be controlled by rescaling of time. Error shrinks as  grows:

 ˙Nk=αN(0)+αt(Nk−1−Nk)+αδk,1+O(1α). (10)

This continuous approximation is justified more rigorously using martingales in Wormald (1995); Kurtz (1981) (also see Mitzenmacher (2004); Drinea et al. (2000)). In this paper the goodness of this approximation is empirically verified through simulations.

Note that, from (7), we see that the increments take rational values proportional to . Approximating the left-hand side with a differential yields (9). Since the denominator of (7) has the factor , the approximation becomes more accurate as grows, hence increasing . The approximation is also more accurate when is large. When both and are small, then the continuous approximation in the domain becomes less accurate. Note that, as long as is large, need not be large. This is particularly important for applications where networks are already large (such as those mentioned in Section I), and one would like to predict the short-term evolution of the degree distribution. In these settings, the expressions obtained throughout this paper are applicable for any time regime.

To solve (9), we use the generating function , which is the conventional Z-transform in the domain. Using (9) we get

 ∂ψ(z,t)∂t=αN(0)+αt(z−1−1)ψ(z,t)+αz. (11)

So we intend to solve the following differential equation in the time domain:

 ∂ψ(z,t)∂t−α(z−1−1)N(0)+αtψ(z,t)=αz. (12)

After solving this equation and applying the initial conditions (Appendix A), we obtain the generating function:

 ψ(z,t) =N(0)+αtz(2−1z)+N(0)N(0)+αt[ψ(z,0)(1+αtN(0))1z] −N(0)2N(0)+αt1z(2−1z)(1+αtN(0))1z. (13)

To take the inverse transform, first note that:

 ∞∑k=112kz−k=1z(2−1z). (14)

Also, denoting by , note that we have:

 (1+λ)1z=eln(1+λ)z. (15)

Using the Taylor expansion of the exponential, we get:

 Missing or unrecognized delimiter for \big (16)

So the inverse transforms are:

 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩1z(2−1z)Z−1−−→12ku(k−1)(1+αtN(0))1zZ−1−−→[ln[1+αtN(0)]]kk!, (17)

where is the Heaviside step function (i.e., for , and for ). Finally, note that the multiplication of Z-transforms yields convolution after inversion. Let us denote the degree distribution of the initial graph by , that is, is the fraction of nodes at the outset with degree . So by inverting (13), for  and  we obtain:

 Nk(t)=N(0)+αt2ku(k−1) +N(0)2N(0)+αt⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩nk∗[ln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭ −N(0)2N(0)+αt⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩(u(k−1)2k)∗[ln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭, (18)

where denotes the convolution operator. For general sequences and , the convolution is another sequence in the domain which is defined as follows:

 (a∗b)k\lx@stackreldef=+∞∑η=−∞aηbk−η. (19)

If the sequences are zero for negative values of (which is the case in our problem), this can be simplified to:

 (a∗b)k=k∑η=0aηbk−η. (20)

To get the degree distribution, we divide the result in (18) by the total number of nodes at time , which is equal to . So for  and  we obtain:

 pk(t)=u(k−1)2k +(N(0)N(0)+αt)2⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩nk∗[ln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭ −(N(0)N(0)+αt)2⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩(u(k−1)2k)∗[ln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭. (21)

As , the effect of initial conditions vanish. So the first term dominates. In this limit, the asymptotic degree distribution is:

 limt→∞pk(t)=12k. (22)

Note that this matches the asymptotic behavior previously found for RRTs as presented in Na and Rapoport (1970); Janson (2005); Krapivsky et al. (2000).

To compare theoretical prediction with simulation results, first we start off with a 6-regular graph. This means that all nodes have 6 neighbors. We build this graph by first making a ring of 50 nodes, and then connect each node to the pairs of second and third closest neighbors. Figure 1 shows the degree distribution at time , that is, . The results are average over 50 Monte Carlo trials. Also, , so nodes are introduced one at a time. As can be seen in the figure, the second majority belongs to degree 1, which are the newly born nodes. Nodes of degree 6 are mostly the initial ones who have received no new link yet, and those with degree 7 have received only one additional link.

Next, the mean and variance of simulations are tabulated to provide estimates for fluctuations around the mean values which are solved for. Table 1 presents these values for a 4-regular ring of 20 nodes, at different times.

### ii.2 Multiple Connections

Now, let us consider multiple attachments. Each new node that is introduced, chooses existing nodes (where  is an integer) uniformly at random and links to them. An essential difference of this scheme from the previous one is that, if one starts from a disconnected graph, then the probability of ending up with a connected graph is nonzero. This probability was zero in the previous case, because each newly-introduced node only linked to one existing node and could not make a connection between two disconnected components. Also note that in this case one must have , so that the growth mechanism can start off. Otherwise, link multiplicity arises, that is, more than a link should be allowed between two nodes, which is tacitly assumed not to be the case throughout.

Taking the similar steps that led to (7), the change in is given by:

 Nk(t+Δt)−Nk(t)Δt=βαN(0)+αt(Nk−1−Nk)+αδk,β. (23)

Note that the last term indicates that each new node adds one to , because its degree is . The differential equation analog for becomes

 ˙Nk=βαN(0)+αt(Nk−1−Nk)+αδk,β . (24)

Taking the Z-transform, we get

 ∂ψ(z,t)∂t=αβN(0)+αt(z−1−1)ψ(z,t)+αzβ. (25)

So we arrive at the following differential equation:

 ∂ψ(z,t)∂t−βα(z−1−1)N(0)+αtψ(z,t)=αzβ. (26)

The solution procedure is given in B. The generating function is

 ψ(z,t) =1zβN(0)+αt1+β(1−z−1) +ψ(z,0)[N(0)N(0)+αt]β(1−z−1) −N(0)zβ[1+β(1−z−1)][N(0)N(0)+αt]β(1−z−1). (27)

Now we must invert this, term by term. This is done in appendix C. After inversion, for  and  we obtain:

 Nk(t)=N(0)+αtβ(ββ+1)k−β+1u(k−β) Missing or unrecognized delimiter for \left −[N(0)β+1β(N(0)+αt)β]× ⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩(ββ+1)k−β+1u(k−β)∗[βln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭. (28)

Then we divide by the total number of nodes  to get the degree distribution for  and . The result is:

 pk(t)=1β(ββ+1)k−β+1u(k−β) +(N(0)N(0)+αt)β+1⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩nk∗[βln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭ −(N(0)N(0)+αt)β+11β× ⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩(ββ+1)k−β+1u(k−β)∗[βln(1+αtN(0))]kk!⎫⎪ ⎪ ⎪⎬⎪ ⎪ ⎪⎭, (29)

Now let us look at the long-time behavior of the result. When , the second and the third terms vanish. The first term prevails and tends to the following:

 pk(t)∼1β(ββ+1)k−β+1u(k−β). (30)

Note that for the case of , the same asymptotic distribution is obtained as the previous section. Also note that in the asymptotic limit, all nodes have degree at least  and the fraction of nodes with degree less than  tends to zero.

Figure 4 shows the simulation results for a ring (2-regular) of 30 nodes, and is depicted versus time, for . The value of is 3. The number of Monte Carlo trials is 30. It can be seen in the graph that the nodes with degree 4, who are mostly the initial nodes who have received one link from the newcomers, outgrow those with degree 5. This is because they also outnumber them, giving them greater link reception probabilities. After a while, this trend declines because many nodes will have degree 4, and now that they receive a new link, they will turn into nodes of degree 5, enhancing the growth of the degree 5 nodes, diminishing the portion of nodes with degree 4. Similarly, the overshoot of degree 6 curve happens after that of degree 5, and so on.

Figure 5 shows for , for a 6-regular ring of total 50 nodes. The number of Monte Carlo trials is 50. The value of is 3. The peak at   seen in the figure is due to the newly added nodes, who all have degree 3. Most of the initial nodes have received zero or one links by this time, hence the other peak at .

The mean and variance of simulations are presented in Table 2.

In this section we are going to focus on preferential attachment. New nodes, instead of selecting from the existing nodes uniformly at random, assign to them probabilities of connection, proportional to their degrees. So, each existing node has the chance of receiving a link from the newly-introduced node equal to its degree, divided by the sum of the degrees of every existing node. First we will assume the case where a new node only attaches to a single existing node, and then the case of multiple connections is considered.

### iii.1 Single Connection

As mentioned above, in the preferential attachment scheme, an existing node with degree receives a link with probability , where the denominator is the sum of the degrees of all existing nodes. So the probability that the destination node selected by a newly-born node has degree is equal to . Using the same approach that led to (9), we arrive at the following differential equation for the evolution of :

 ˙Nk=α∑ℓℓNℓ((k−1)Nk−1−kNk)+αδk,1. (31)

Now to proceed as before, we take the Z-transform of this equation. First note that if is the Z-transform of a discrete function , then is the Z-transform for the the function . This means that, if the Z-transform of is , then the Z-transform of the first term on the right hand side is as follows:

 (k−1)Nk−1−kNkZ→(z−1)dψ(z)dz. (32)

Second, note that the denominator of the attachment probabilities, , is twice the number of links in the graph. Let us denote the number of links in the graph by . Note that, since each new node adds one new link, we have:

 L(t)=L(0)+αt⟹2L(t)=2L(0)+2αt. (33)

Twice the number of links in the initial graph equals , where denotes the average degree of the initial graph. So we get:

 2L(t)=N(0)¯k0+2αt⟹∑ℓℓNℓ=N(0)¯k0+2αt. (34)

We will temporarily use

 λ\lx@stackreldef=N(0)¯k0 (35)

for brevity. The Z-transform of (31) is:

 ∂ψ∂t−α(z−1)λ+2αt∂ψ∂z=αz−1. (36)

This is a first-order partial differential equation. We solve this equation using the method of characteristics. For the convenience of the reader, we briefly shed light on how this method works through a simple example in appendix D (we refer the reader to R. Courant (1989); Zauderer (2011); Zwillinger (1998), or other elementary references on partial differential equations, for further details), and then provide the solution in appendix E, where we obtain:

 ψ(z,t)=ψ0[(z−1)√λ+2αtλ+1]−2αt(z−1)+αt −2α2(z−1)2ln(1−z−1)+(z−1)λ√λ+2αtλ −λ(z−1)−λ(z−1)2ln(1−z−1) −(z−1)2(λ+2αt)ln[1+1z−1√λλ+2αt]. (37)

Note that from the argument of the logarithm, we know the region of convergence of the Z-transform is , since the logarithm is not defined otherwise (this agrees with what one would expect intuitively, that since  is zero for  by definition, the region of convergence would be ). Now let us define the new variable

 c(t)\lx@stackreldef=1−√λλ+2αt. (38)

This quantity is positive and less than unity at all times. Now, note that we have:

 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩1+1z−1√λλ+2αt=1−cz−11−z−1(z−1)√λ+2αtλ+1=z−c1−c. (39)

So we simplify (37) further and arrive at:

 ψ(z,t)=ψ0(z−c1−c)−2αt(z−1)+αt −(λ+2αt)(z−1)2ln(1−z−1)+λ(z−1)√λ+2αtλ −λ(z−1)−(λ+2αt)(z−1)2ln(1−cz−11−z−1). (40)

Note that the two terms cancel out. Also, note that there are three terms having the factor . These three terms add up to:

 −2αt(z−1)+λ(z−1)√λ+2αtλ−λ(z−1) =(z−1)√λ+2αt(√λ−√λ+2αt) =−(z−1)(λ+2αt)c. (41)

These simplifications transform (40) into the following:

 ψ(z,t) =ψ0(z−c1−c)+αt−(z−1)(λ+2αt)c −(λ+2αt)(z−1)2ln(1−cz−1). (42)

We find the inverse Z-transform of this expression in appendix F. The result is:

 Nk(t) =∑ℓNℓ(0)(1−c)ℓck−ℓ(k−1ℓ−1) +(λ+2αt)(ckk−2ck+1k+1+ck+2k+2). (43)

Replacing by , for  and we get:

 Nk(t) =∑ℓNℓ(0)(k−1ℓ−1)(1−c)ℓck−ℓ +(N(0)¯k0+2αt)(ckk−2ck+1k+1+ck+2k+2), t≥0,1≤k≤N(0). (44)

Now to get the degree distribution, we divide this expression by the number of nodes at time , which is equal to . As above, we denote the degree distribution of the initial graph by , that is, is the fraction of nodes at the outset with degree . Thus the final result for the degree distribution for  and is the following:

 pk(t) =N(0)N(0)+αt∑ℓnℓ(k−1ℓ−1)(1−c)ℓck−ℓ +N(0)¯k0+2αtN(0)+αt(ckk−2ck+1k+1+ck+2k+2), . (45)

Now to find the asymptotic limit of this expression, first by combining (38) and (35), we get

 c=1− ⎷N(0)¯k0N(0)¯k0+2αt. (46)

Now note that as we have:

 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩limt→∞N(0)N(0)+αt=0limt→∞N(0)¯k0+2αtN(0)+αt=2limt→∞c=1. (47)

Thus, the asymptotic behavior of the degree distribution is given by:

 limt→∞pk(t)=2(1k+2−2k+1+1k), (48)

which simplifies to

 limt→∞pk(t)=4k(k+1)(k+2). (49)

As we mentioned previously, this asymptotic result was derived in Krapivsky et al. (2000); Krapivsky and Redner (2001, 2002). Also, for large values of , this pertains to the power law derived in Barabasi et al. (1999).

Figure 6 shows for , for a 6-regular ring of total 50 nodes. It is seen in the figure that the second majority comprises of newcomers. The initial nodes of degree 6 who have received no new link are most frequent. Those who have received one new link and hence have degree 7 are 3rd-most frequent.

Figure 7 illustrates the simulation results and theoretical predictions for a ring  (2-regular) of 30 nodes, and is presented as a function of time, for . As seen in the figure, nodes with degree 2 are mostly the initial nodes who have received no link from the newcomers, and their population diminishes as they receive new links and consequently turn into nodes of degree 3.

The mean and variance of simulations are presented in Table 3.

### iii.2 Multiple Connection

Now let us consider the preferential attachment scheme again, but this time, each new node attaches to existing nodes. At time , the number of nodes will be . Also, at time , the sum of the degrees of all nodes (which equals twice the number of links) will be . Each newly born node adds one to at that instant. Let us once again denote by . Similar to (31), the evolution of is

 ˙Nk=αβ∑ℓℓNℓ((k−1)Nk−1−kNk)+αδk,β. (50)

Taking the Z-transform leads us to:

 ∂ψ∂t−αβ(z−1)λ+2αβt∂ψ∂z=αz−β. (51)

We solve this differential equation via the method of characteristics in appendix G. The result is:

 ψ(z,t)=ψ0((z−1)√λ+2αβtλ+1) −(z−1)2(λ+2αβt)β ×[F(z)−F((z−1)√λ+2αβtλ+1)], (52)

where the function is defined as follows:

 F(z)\lx@stackreldef=∫zx−β(x−1)3dx. (53)

Let us generalize (38) and define the following:

 c\lx@stackreldef=1−√λλ+2αβt. (54)

As above, this quantity is less than one and tends to one as . Then (52) is simplified to:

 ψ(z,t)=ψ0(z−c1−c) −(z−1)2(λ+2αβt)β[F(z)−F(z−c1−c)]. (55)

We invert the generating function in appendix H. Consequently, for  and  we arrive at:

 Nk(t)=k∑ℓ=1Nℓ(0)(1−c)ℓck−ℓ(k−1ℓ−1) +(N(0)¯k0+2αβt)ββ(β+1)k(k+1)(k+2)u(k−β) −N(0)¯k0βk∑ℓ=ββ(β+1)ℓ(ℓ+1)(ℓ+2)(1−c)ℓck−ℓ(k−1ℓ−1), (56)

Dividing this by the number of nodes at time , which is equal to , yields the degree distribution at time . As above, let us denote the degree distribution of the initial graph by . The final result for the degree distribution for  and  is as follows:

 pk(t)=N(0)N(0)+αt∑ℓnℓ(1−c)ℓck−ℓ(k−1ℓ−1) +(N(0)¯k0+2αβt)N(0)+αt(β+1)k(k+1)(k+2)u(k−β) −N(0)¯k0N(0)+αtk∑ℓ=β(β+1)ℓ(ℓ+1)(ℓ+2)(1−c)ℓck−ℓ(k−1ℓ−1). (57)

The equivalence of this result for the special case of  with (45) is proved in appendix I.

Now let us focus on the long time behavior, when , we have:

 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩limt→∞N(0)N(0)+αt=0limt→∞N(0)¯k0+2αβtN(0)+αt=2βlimt→∞c=1. (58)

Using these values, the asymptotic degree distribution is obtained:

 limt→∞pk(t)=2β(β+1)k(k+1)(k+2)u(k−β), (59)

which matches (2).

Figure 8 shows for , for a 6-regular ring of total 50 nodes. The value of is 3. As seen in the figure, the left-most peak belongs to those with degree , that are the newly added nodes. Those with degree 6 and 7, that are mostly the initial nodes who have received zero and one links from the newcomers respectively, are first and second most frequent, as seen in the graph.

Figure 9 is a depiction the simulation results and theoretical predictions for a ring  (2-regular) of 30 nodes, and is presented as a function of time, for . The value of is 3. It is observable in the figure that the network keeps losing nodes of degree 2 (the initial nodes) as they receive links from the newcomers.

The mean and variance of simulations are presented in Table 4.

Let us also compare theoretical predictions and simulation results for a graph which is not regular, which means that the degree of all nodes are not necessarily the same 2. We use a Small-world graph Watts and Strogatz (1998). To construct the graph, we take a 6-regular ring of 100 nodes and add random links between nodes that are not connected. Each link is formed with probability 0.2. The degree distribution of the resulting substrate is given in Figure 10. Then the preferential growth on the network begins with . The degree distribution at is illustrated in Figure 11, and the degree distribution at time is presented in Figure 12. Figure 13 is a depiction of the degree distribution at , which is close to the ‘long time limit’. The effect of the initial graph has almost disappeared and the distribution is close to the power-law form. Also note that the fraction of nodes with degree smaller than tends to zero in this time regime.

## Iv Summary and Future Work

Previous work in the literature of network growth models mainly focus on the degree distribution of the graph in the asymptotic limit, that is, when the number of nodes tends to infinity and the effect of initial conditions can be neglected. In this contribution we found time-dependent expressions for the expected degree distribution, which depend explicitly on the degree distribution of the initial graph. We considered two growth schemes. One in which new nodes choose from existing nodes uniformly at random, and then connect to them, and the other where these probabilities are proportional to degrees. Uniform and multiple attachments for the newly-born nodes are considered separately for both cases. Simulation results were accompanying theoretical predictions for each case.

One possible extension of the results presented in this work would be as follows. Suppose a given graph is subject to growth. The current state of the graph is known, and the growth mechanism can be approximated to be uniformly at random or be preferential attachment. Suppose quite on the contrary to the previous work in the literature, we are interested in the short-time behavior of the degree distribution. Then one could employ the results in this work, and expand the expressions in the vicinity of the initial condition up to arbitrary order of , and find the degree distribution perturbatively, to arbitrary precision.

Our analysis focuses on the expected degree distribution. Due to the random nature of the growth process, has a distribution of its own, whose mean value is presented in this work. One can also focus on the variance, or other statistical properties, of this distribution.

## V Acknowledgment

This work was funded in part by the Natural Sciences and Engineering Research Council of Canada.

## Appendix A Solving Equation (12) for Uniform Single Attachment

The equation is repeated here for easy reference:

 ∂ψ(z,t)∂t−α(z−1−1)N(0)+αtψ(z,t)=αz, (60)

with the following general form of a first order linear equation in time domain:

 ˙ψ+p(z,t)ψ=q(z,t), (61)

Multiply both sides by an unknown integrating factor to make both sides equal to . Then