# On the Emergence of Islands in Complex Networks

Authors: J. Esquivel-Gómez; R. E. Balderas-Navarro; P. D. Arjona-Villicaña; P. Castillo-Castillo; O. Rico-Trejo; J. Acosta-Elias
Journal: Complexity
 (2017)

---

## Abstract

Most growth models for complex networks consider networks comprising a single connected block or island, which contains all the nodes in the network. However, it has been demonstrated that some large complex networks have more than one island, with anisland size distribution (Is) obeying a power-law function Is~s-α. This paper introduces a growth model that considers the emergence of islands as the network grows. The proposed model addresses the following two features: (i) the probability that a new island is generated decreases as the network grows and (ii) new islands are created with a constant probability at any stage of the growth. In the first case, the model produces anisland size distribution that decays as a power-law Is~s-α with a fixed exponent α=1 and in-degree distribution that decays as a power-law Qi~i-γ with γ=2. When the second case is considered, the model describes island size and in-degree distributions that decay as a power-law with 2<α<∞ and 2<γ<∞, respectively.


---

## Body

## 1. Introduction

Research in complex networks (CN) has risen in interest and importance given that many natural and artificial systems can be abstracted, modeled, and analyzed using this type of networks. Examples of such systems are numerous: neuron connectivity [1], the plant pollination process [2], gene inheritance [3], metabolic interactions [4, 5], highway and road networks [6], emails [7], sexual partners [8], and many others.Before 1998, most networks were studied using the random network model, which assumes that each node randomly chooses other nodes to get connected. This random selection process produces certain topological properties [9]. For example, both the in-degree and out-degree distributions may approximate either a Poisson or an exponential function [9].Random models were employed before real data became available which allowed to verify the properties and characteristics obtained from this model. Still, it was difficult to emulate the behavior of real networks because many of the factors needed to perform these simulations were unknown. It is under this context that Paxon and Floyd published an article where they described the main difficulties in simulating the Internet [10].A new insight was provided by Redner in 1998, when he published a study about the distribution of citations in scientific publications [11]. In his study, publications are described as a network, where an article is represented as a node and the citations between papers are represented as a network edge. Redner discovered that the tail of the citation distribution decays as a power-law with an exponent γ=3.In 1999, Faloutsos et al. published important topological properties occurring in the Internet [12]. Among the most interesting ones is the conclusion that the Internet’s out-degree and in-degree distributions at the autonomous system scale follow a power-law distribution [12]. In that same year, Adamic et al. showed that the WWW also follows a power-law distribution in some of its topological properties [13]. These studies suggest that these networks cannot be analyzed using the random model, since some of their connectivity properties do not behave as a Poisson or as an exponential function but rather as a power-law function.It is important to notice that although these networks are fundamentally different they still have similar properties. For example, even when the Internet has doubled its number of nodes, its diameter has not changed significantly. In this context, diameter is the number of nodes that need to be visited for the longest of all the shortest paths between all the pairwise nodes in the network.These investigations have been the watershed that initiated the search of power-law behaviors and other properties in systems that can be modeled as a CN. In a few years this search has led to discoveries which have confirmed that power-law distributions and their properties, like clustering and diameter, can be found in most of these complex systems [14].In 1998, Watts and Strogatz published a study about CN where they affirmed that real networks are in an intermediate state between randomness and regularity. They named this type of systems as small-world networks because of their small diameter, and they also introduced a mechanism to produce them. However, there was no knowledge about the internal processes which were able to reproduce these properties and thus there was no growth model which would allow to study them. At this point, Barabási and Albert published a study [15] where they introduced a growth model for CN based on a node aggregation process with preferential attachment. This model yields networks with a degree distribution that decays as a power-law with an exponent equal to 3. Such a model, however, has some limitations: it only generates networks with a fixed degree distribution exponent. This result contrasts with real networks obeying a power-law out-degree and in-degree distributions, which both exhibit exponents γ≠3. Therefore, a new effort started the search for new processes that could be included into the Albert-Barabási model in order to reproduce the same topological properties found in real CN.Some of these local processes have already been studied. For example, Krapivsky et al. [16] implemented a nonlinear preferential attachment growth mechanism. Dorogovtsev and Mendes [17] proposed another model in which nodes get an initial attractiveness at the time of being born. This is how they solved a contradiction in Barabási’s original model for directed networks which could be illustrated by the following example: in the first day of term in a classroom nobody knows each other. Following Barabási’s model, the probability that a student obtains a new friend is proportional to the number of friends he or she already has. Since nobody has friends, no new friendships are created, which is not what happens in a real situation.Another local process studied is the one introduced by Dorogovtsev and Mendes [18] who considered that nodes may become old and decrease their attractiveness. For example, scientific articles’ citations decrease with time. Albert and Barabási introduced a model with rewiring [19], in which there is a probability q that some node i deletes link lij to a node j and then uses preferential attachment to a node j′ using a new link lij′. This process may be found in some networks, like the WWW when a web master deletes a hyperlink and adds a new one. Esquivel-Gómez et al. [20] described a model which prohibits multiple links between the same nodes. Acosta-Elias et al. [21] studied the impact of delays, which is based on the fact that each new node selects to which other node it should get connected using local information, instead of global topological information. In other words, delays allow for a behavior in which new nodes select new connections based on a partial view of the system.There are many other models, processes, and properties that have been studied about CN. Many of these may be consulted in various review articles [14, 22, 23]. However, after sixteen years of different studies and analyses of CN, it seems that there is a lack of consensus and knowledge about the fundamental laws that govern these systems.Using the percolation concept, there have been analytical studies about the properties of islands or connected components in random and CN [24]. Moreover, islands have been observed in real networks: Broder et al. [25] studied a WWW sample with approximately 200 million web pages with 1.5 billion of links and discovered islands with sizes, expressed as the number of pages, exhibiting a power-law distribution with an exponent equal to 2.54. This power-law distribution of island sizes allows the existence of giant islands (giant connected components). Determining the probability that any given node belongs to these giant islands is important because it allows to calculate the probability that a message generated by a node reaches another node or to model strategies that could stop the transmission of an epidemic disease. As a matter of fact, in the literature it is possible to find growth models capable of generating CN with community structure [26–30]; that is, networks containing groups of nodes strongly connected between them but weakly connected with the other nodes comprising the network. Likewise, there exist growth models [20, 31–35] that consider every node added to the network always connecting to the existing ones. In other words, all the nodes in these models form a single island, which contains all the nodes of the network. However, in some real networks, as in the US patent’s citation network [36], the nodes form more than one island and hence Is follows a power-law distribution Is~s-γ [37].A possible cause for the origination of islands in some real CN is that, during network growth, some nodes may be born with zero out-going links (i.e., patents without references to other patents) and this causes new islands to be generated.This paper proposes a growth model for directed CN that considers the emergence of islands as the network grows. In the proposed model new islands are created with probabilityΦ, contemplating two different cases: (1) Φ remains constant during the whole life of the network and (2) Φ decreases as the network grows. It is shown analytically and validated through numerical simulation that, for the first case, the model generates directed CN with power-law behavior in itsin-degree (Qi~i-γ) andisland size (Is~s-α) distributions with γ and α both tunable from 2 to ∞. For the second case of Φ the exponents are fixed to γ=2 and α=1, respectively.The paper is organized as follows. Section2 outlines the features of the model proposed in this paper. The analytical solution of the model and the experiment details and results are present in Section 3. Finally, the discussion and conclusion are given in Sections 4 and 5, respectively.


## 2. Model

We consider that the birth of new islands is governed by a probabilityΦ and by taking into account two cases:(i)
Φ=1/N, where N is the number of nodes in the network. In this case, the probability that a new island is born decreases as the number of nodes in the network increases. This idea is mapped from real networks as follows: in a scientific papers citation network, when there are few papers (nodes), it is more probable that a new paper does not cite other papers (generating a new island) because it addresses an entirely new scientific topic. Conversely, when the quantity of papers increases, the probability that a new paper addresses an entirely new theme decreases; thus the probability of generating a new island also decreases.(ii)
Φ=p, 0<p<1. In this case, the probability that a new island is created remains constant during the whole life of the network.Furthermore, the growth of the network is performed by adding one node at each time step. At the beginning, only noden0 exists in the network and for each new node nnew added to the network, either one of the following rules is performed:(i)
With probabilityΦ, nnew does not connect to any node in the network. That is, nnew generates a new island (see Figure 1).(ii)
With complementary probability1-Φ, nnew randomly selects a node nr and connects to it, as well as to all nodes that have one incoming link from nr (see Figure 1).Figure 1
Growth of a directed network using the proposed model.Φ describes the probability for a new island emerges. At the beginning (t0), only node n0 exists in the network. At the next time step (t1) node n1 is added to the network and it is assumed that it connects to node n0. In t2, node n2 is added and it is assumed that it does not connect to any node; thus a new island is generated. In t3, n3 is added and it is assumed that it connects to n1 and n0 (dashed arrow) because n0 has an incoming link from n1. In t4, n4 generates a new island as n2 in t2. At t5 and t6, nodes n5 and n6 are added and connect to the network as n3 did at t3.


## 3. Analytic Solution of the Model

### 3.1. Islands Size Distribution

In order to obtain the analytical solution forIs, the continuum method [38] was employed using the following differential equation:(1)dIsNdN=Φδs,1︷g1+1-Φs-1NIs-1N︸g2′-sNIsN︸g2′′︷g2.Equation (1) describes the variation of the number of islands Is with s nodes with respect to the total number N of nodes in the network. Term g1 describes the birth of a new island; that is, it models the situation that a new node nnew does not connect with any node (first rule of this model). The term g2 depicts the second rule of the model, term g2′ accounts for the situation that a new node nnew randomly selects a node nr belonging to an island with s-1 nodes and connects to it, and thus Is(N) increases. The term g2′′ describes the situation that a new node nnew randomly selects a node nr belonging to an island with s nodes and connects to it, and thus Is(N) decreases.Equation (1) may also be written in the standard form for a linear differential equation:(2)dIsNdN+1-ΦsNIsN=1-Φs-1NIs-1N+Φδs,1.In order to investigate the impact that Φ=1/N and Φ=p have in Is, (2) is solved for each one of them. With Φ=1/N, (2) takes the following form:(3)dIsNdN+N-1sN2IsN=N-1s-1N2Is-1N+δs,1N.In order to obtain Is(N), (3) is solved for s=1, s=2, and so on. For s=1, (3) takes the following form:(4)dI1NdN+N-1N2I1N=1N,and solving (4) gives(5)I1N=1-Ei1/NNe1/N+kNe1/N,where k is a constant and Ei(·) is the exponential integral function. As N≫1, (5) yields I1(N)≈1. Solving (3) for the following s values produces the following:(6)I2N≈12,I3N≈13,I4N≈14.From the previous result (see (6)) it is possible to deduce that(7)IsN≈1s,1<s<N.That is, with Φ=1/N the proposed model is able to produceisland size distributions with a power-law behavior Is~s-α with fixed exponent α=1.ForΦ=p, (2) takes the following form:(8)dIsNdN+1-psNIsN=1-ps-1NIs-1N+pδs,1.In order to obtain Is(N), (8) is solved for s=1, s=2, and so on. For s=1, (8) takes the following form:(9)dI1NdN+1-pNI1N=p.Solving (9) gives(10)I1N=pN1-p+1+kN1-p,where k is a constant. As N≫1, (10) can be approximated as(11)I1N≈pN1-p+1.Solving (8) for s>1 yields(12)I2N≈1-ppN1-p+121-p+1≈1-ppN∏x=12x1-p+1,I3N≈21-p2pN∏x=13x1-p+1,I4N≈321-p3pN∏x=14x1-p+1.From the previous results (see (11) and (12)) one can deduce that(13)IsN≈s-1!1-ps-1pN∏x=1sx1-p+1.Approximating with the Gamma Function Γ(·) we obtain(14)IsN≈Γ1/1-ppN1-p2ΓsΓs+1+1/1-p≈Γ1/1-ppN1-p2s-1+1/1-pfors≫1.From (14), when Φ=p the model is able to produceisland size distributions with a power-law behavior Is~s-α for 1<s<N with exponent α=1+1/1-p. This allows α to take values from 2 to ∞.


### 3.2. In-Degree Distribution

In order to obtain the analytical solution for the in-degree distribution generated with the proposed model, the continuum method is used [38]. Hence, the differential equation that describes the in-degree distribution may be written as follows:(15)dQiNdN=1-ΦQi-1NN︸g1′+i-1Qi-1NN︸g1′′︷g1-1-ΦQiNN︸g2′-iQiNN︸g2′′︷g2+1-Φδi,0︷g3+Φδi,0︷g4.Equation (15) describes the variation of the number Qi of nodes with i incoming links with respect to the number N of nodes in the network. The term g1 represents how the number of nodes with i incoming links increases, g1′ describes how a new node nnew randomly selects a node nr with i-1 incoming links and connects to it, and g1′′ describes how nnew randomly selects an in-neighbor of a node nj that has i-1 incoming links and connects to it (see Figure 2); thus Qi increases. The term g2 takes into account how the number of nodes with i incoming links decreases, and terms g2′ and g2′′ perform similar functions as g1′ and g1′′. Finally, the terms g3 and g4 model the effect of adding a new node with zero incoming links using the second and the first rule of the model.Figure 2
A network comprising three nodes (n0, n1, n2). In this network, the in-neighbors of n0 are n1 and n2. Also the number of nodes with three incoming links is Q3=0. There are two possible ways to increase Q3: (1) a new node n3 randomly selects node n0 and connects to it (g1′ in the figure and (15)); thus Q3=1; (2) a new node n3 randomly selects an in-neighbor of n0 and connects to it (solid line) and to n0 (dashed line), as stated by g1′′ in (15) and this figure.Equation (15) may be written in the standard form for a linear differential equation:(16)dQiNdN+1-Φi+1QiNN=1-ΦiQi-1NN+δi,0.In order to analyze the impact that Φ=1/N and Φ=p have in Qi, (16) is solved for each one of them.ForΦ=1/N, (16) takes the following form:(17)dQiNdN+N-1N2i+1QiN=N-1N2iQi-1N+δi,0.Solving (17) for some i values it is possible to deduce that(18)QiN≈N+1i+1i+2.That is, with Φ=1/N the proposed model is able to producein-degree distributions with a power-law behavior Qi~i-γ for 1<i<N with fixed exponent γ=2. The same result was previously obtained by Krapivsky and Redner [32] in a similar model without contemplating the emergence of islands during the network growth.ForΦ=p, (16) takes the following form:(19)dQiNdN+1-pNi+1QiN=1-pNiQi-1N+δi,0.Solving (19) for several i values produces(20)QiN≈i!1-piN∏x=1i+1x+1-xp.Approximating with the Gamma Function Γ(·) we obtain(21)QiN≈NΓ1/1-pp-12Γi+1Γi+2+1/1-p≈NΓ1/1-pp-12i-1+1/1-pfori≫1.Therefore, if Φ=p the proposed model is able to producein-degree distributions with a power-law behavior Qi~i-γ for 1<i<N with exponent γ=1+1/1-p. This allows γ to take values from 2 to ∞.


### 3.3. Experiment Details and Results

In order to validate the analytical predictions forIs (see (7) and (13)), four numerical simulations were performed. For each simulation, the growth of a directed network from N=1 to 104 nodes was realized taking into account the proposed model developed above. Figure 3 shows that Is produced by our simulations and by the analytical results fit appropriately.Figure 3
Comparison of the islands size distributions obtained numerically (symbols⊡  ⊙  Δ) and the analytical results (solid lines) as a function of the island size s. (a) Equation (7). (b) Equation (13) with p=0.1,0.5, and 0.7.
(a) (b)In order to validate the analytical predictions forQi (18) and (20), four numerical simulations were performed. For each simulation, we considered the growth of a directed network from N=1 to 104 nodes. Figure 4 shows the comparison of Qi produced by the simulations and the analytical results, showing that both fit appropriately.Figure 4
Comparison of the in-degree distributions obtained numerically (symbols⊡  ⊙  Δ) and the analytical results (solid lines) as a function of the in-degree i. (a) Equation (18). (b) Equation (20) with p=0.1,0.5, and 0.7.
(a) (b)Figure5 shows the experimental out-degree distribution Qout. It can be seen that when ϕ=1/N, the model produces networks with Qout following a Poisson distribution (Figure 5(a)). On the other hand, when ϕ=p, Qout decays as an exponential function as p→1, whereas it exhibits a combination of an exponential and Poisson distribution when p→0 (see Figure 5(b)).Figure 5
Out-degree distribution (Qout) obtained numerically with (a) ϕ=1/N and (b) ϕ=p taking values p=0.1 (⊡), p=0.5 (⊙), and p=0.7 (Δ) as a function of the out-degree (out).
(a) (b)


### 3.4. Numerical Study ofQi and Qout in the Islands

In order to investigate the in-degree and out-degree distributions occurring in the islands generated with our model, several numerical simulations were also performed. The numerical simulations consisted in simulating the growth of a network from1 to 104 nodes with ϕ=1/N and ϕ=p (with p=0.1,0.5,0.7) and three islands of different sizes were randomly selected.Figures6(a)–6(d) show that the in-degree distributions of the islands are all following a power-law with exponent γ=2. The only difference is the scale among them owing to the size of each island. More precisely, all the in-degree distributions are consistent with (18) and that obtained by Krapivsky and Redner [32]. The above result is easily interpreted since within each island, the in-degree distribution is governed only by the copy process, originating from the power-law with exponent γ=2. Similar behavior for the out-degree distribution is observed (Figure 7).Figure 6
In-degree distributions of islands with different sizes founded in the networks generated with the proposed model withϕ=1/N (a) and p=0.1,0.5, and 0.7 (b–d). The solid line is the plot of (18).
(a) (b) (c) (d)Figure 7
Out-degree distributions of islands with different sizes founded in the networks generated with the proposed model withϕ=1/N (a) and p=0.1,0.5, and 0.7 (b–d).
(a) (b) (c) (d)


## 3.1. Islands Size Distribution

In order to obtain the analytical solution forIs, the continuum method [38] was employed using the following differential equation:(1)dIsNdN=Φδs,1︷g1+1-Φs-1NIs-1N︸g2′-sNIsN︸g2′′︷g2.Equation (1) describes the variation of the number of islands Is with s nodes with respect to the total number N of nodes in the network. Term g1 describes the birth of a new island; that is, it models the situation that a new node nnew does not connect with any node (first rule of this model). The term g2 depicts the second rule of the model, term g2′ accounts for the situation that a new node nnew randomly selects a node nr belonging to an island with s-1 nodes and connects to it, and thus Is(N) increases. The term g2′′ describes the situation that a new node nnew randomly selects a node nr belonging to an island with s nodes and connects to it, and thus Is(N) decreases.Equation (1) may also be written in the standard form for a linear differential equation:(2)dIsNdN+1-ΦsNIsN=1-Φs-1NIs-1N+Φδs,1.In order to investigate the impact that Φ=1/N and Φ=p have in Is, (2) is solved for each one of them. With Φ=1/N, (2) takes the following form:(3)dIsNdN+N-1sN2IsN=N-1s-1N2Is-1N+δs,1N.In order to obtain Is(N), (3) is solved for s=1, s=2, and so on. For s=1, (3) takes the following form:(4)dI1NdN+N-1N2I1N=1N,and solving (4) gives(5)I1N=1-Ei1/NNe1/N+kNe1/N,where k is a constant and Ei(·) is the exponential integral function. As N≫1, (5) yields I1(N)≈1. Solving (3) for the following s values produces the following:(6)I2N≈12,I3N≈13,I4N≈14.From the previous result (see (6)) it is possible to deduce that(7)IsN≈1s,1<s<N.That is, with Φ=1/N the proposed model is able to produceisland size distributions with a power-law behavior Is~s-α with fixed exponent α=1.ForΦ=p, (2) takes the following form:(8)dIsNdN+1-psNIsN=1-ps-1NIs-1N+pδs,1.In order to obtain Is(N), (8) is solved for s=1, s=2, and so on. For s=1, (8) takes the following form:(9)dI1NdN+1-pNI1N=p.Solving (9) gives(10)I1N=pN1-p+1+kN1-p,where k is a constant. As N≫1, (10) can be approximated as(11)I1N≈pN1-p+1.Solving (8) for s>1 yields(12)I2N≈1-ppN1-p+121-p+1≈1-ppN∏x=12x1-p+1,I3N≈21-p2pN∏x=13x1-p+1,I4N≈321-p3pN∏x=14x1-p+1.From the previous results (see (11) and (12)) one can deduce that(13)IsN≈s-1!1-ps-1pN∏x=1sx1-p+1.Approximating with the Gamma Function Γ(·) we obtain(14)IsN≈Γ1/1-ppN1-p2ΓsΓs+1+1/1-p≈Γ1/1-ppN1-p2s-1+1/1-pfors≫1.From (14), when Φ=p the model is able to produceisland size distributions with a power-law behavior Is~s-α for 1<s<N with exponent α=1+1/1-p. This allows α to take values from 2 to ∞.


## 3.2. In-Degree Distribution

In order to obtain the analytical solution for the in-degree distribution generated with the proposed model, the continuum method is used [38]. Hence, the differential equation that describes the in-degree distribution may be written as follows:(15)dQiNdN=1-ΦQi-1NN︸g1′+i-1Qi-1NN︸g1′′︷g1-1-ΦQiNN︸g2′-iQiNN︸g2′′︷g2+1-Φδi,0︷g3+Φδi,0︷g4.Equation (15) describes the variation of the number Qi of nodes with i incoming links with respect to the number N of nodes in the network. The term g1 represents how the number of nodes with i incoming links increases, g1′ describes how a new node nnew randomly selects a node nr with i-1 incoming links and connects to it, and g1′′ describes how nnew randomly selects an in-neighbor of a node nj that has i-1 incoming links and connects to it (see Figure 2); thus Qi increases. The term g2 takes into account how the number of nodes with i incoming links decreases, and terms g2′ and g2′′ perform similar functions as g1′ and g1′′. Finally, the terms g3 and g4 model the effect of adding a new node with zero incoming links using the second and the first rule of the model.Figure 2
A network comprising three nodes (n0, n1, n2). In this network, the in-neighbors of n0 are n1 and n2. Also the number of nodes with three incoming links is Q3=0. There are two possible ways to increase Q3: (1) a new node n3 randomly selects node n0 and connects to it (g1′ in the figure and (15)); thus Q3=1; (2) a new node n3 randomly selects an in-neighbor of n0 and connects to it (solid line) and to n0 (dashed line), as stated by g1′′ in (15) and this figure.Equation (15) may be written in the standard form for a linear differential equation:(16)dQiNdN+1-Φi+1QiNN=1-ΦiQi-1NN+δi,0.In order to analyze the impact that Φ=1/N and Φ=p have in Qi, (16) is solved for each one of them.ForΦ=1/N, (16) takes the following form:(17)dQiNdN+N-1N2i+1QiN=N-1N2iQi-1N+δi,0.Solving (17) for some i values it is possible to deduce that(18)QiN≈N+1i+1i+2.That is, with Φ=1/N the proposed model is able to producein-degree distributions with a power-law behavior Qi~i-γ for 1<i<N with fixed exponent γ=2. The same result was previously obtained by Krapivsky and Redner [32] in a similar model without contemplating the emergence of islands during the network growth.ForΦ=p, (16) takes the following form:(19)dQiNdN+1-pNi+1QiN=1-pNiQi-1N+δi,0.Solving (19) for several i values produces(20)QiN≈i!1-piN∏x=1i+1x+1-xp.Approximating with the Gamma Function Γ(·) we obtain(21)QiN≈NΓ1/1-pp-12Γi+1Γi+2+1/1-p≈NΓ1/1-pp-12i-1+1/1-pfori≫1.Therefore, if Φ=p the proposed model is able to producein-degree distributions with a power-law behavior Qi~i-γ for 1<i<N with exponent γ=1+1/1-p. This allows γ to take values from 2 to ∞.


## 3.3. Experiment Details and Results

In order to validate the analytical predictions forIs (see (7) and (13)), four numerical simulations were performed. For each simulation, the growth of a directed network from N=1 to 104 nodes was realized taking into account the proposed model developed above. Figure 3 shows that Is produced by our simulations and by the analytical results fit appropriately.Figure 3
Comparison of the islands size distributions obtained numerically (symbols⊡  ⊙  Δ) and the analytical results (solid lines) as a function of the island size s. (a) Equation (7). (b) Equation (13) with p=0.1,0.5, and 0.7.
(a) (b)In order to validate the analytical predictions forQi (18) and (20), four numerical simulations were performed. For each simulation, we considered the growth of a directed network from N=1 to 104 nodes. Figure 4 shows the comparison of Qi produced by the simulations and the analytical results, showing that both fit appropriately.Figure 4
Comparison of the in-degree distributions obtained numerically (symbols⊡  ⊙  Δ) and the analytical results (solid lines) as a function of the in-degree i. (a) Equation (18). (b) Equation (20) with p=0.1,0.5, and 0.7.
(a) (b)Figure5 shows the experimental out-degree distribution Qout. It can be seen that when ϕ=1/N, the model produces networks with Qout following a Poisson distribution (Figure 5(a)). On the other hand, when ϕ=p, Qout decays as an exponential function as p→1, whereas it exhibits a combination of an exponential and Poisson distribution when p→0 (see Figure 5(b)).Figure 5
Out-degree distribution (Qout) obtained numerically with (a) ϕ=1/N and (b) ϕ=p taking values p=0.1 (⊡), p=0.5 (⊙), and p=0.7 (Δ) as a function of the out-degree (out).
(a) (b)


## 3.4. Numerical Study ofQi and Qout in the Islands

In order to investigate the in-degree and out-degree distributions occurring in the islands generated with our model, several numerical simulations were also performed. The numerical simulations consisted in simulating the growth of a network from1 to 104 nodes with ϕ=1/N and ϕ=p (with p=0.1,0.5,0.7) and three islands of different sizes were randomly selected.Figures6(a)–6(d) show that the in-degree distributions of the islands are all following a power-law with exponent γ=2. The only difference is the scale among them owing to the size of each island. More precisely, all the in-degree distributions are consistent with (18) and that obtained by Krapivsky and Redner [32]. The above result is easily interpreted since within each island, the in-degree distribution is governed only by the copy process, originating from the power-law with exponent γ=2. Similar behavior for the out-degree distribution is observed (Figure 7).Figure 6
In-degree distributions of islands with different sizes founded in the networks generated with the proposed model withϕ=1/N (a) and p=0.1,0.5, and 0.7 (b–d). The solid line is the plot of (18).
(a) (b) (c) (d)Figure 7
Out-degree distributions of islands with different sizes founded in the networks generated with the proposed model withϕ=1/N (a) and p=0.1,0.5, and 0.7 (b–d).
(a) (b) (c) (d)


## 4. Discussion

Importantly, in this model the case whenΦ increases as the number of nodes increases is not considered. This is because when N is large enough, new nodes added to the network would have a high probability of not connecting to other nodes, thus generating new islands. Therefore, the resulting network would be composed of a big quantity of isolated nodes. Also, the situation that a new node can connect to nodes present in different islands is not considered, because this would result in the fusion of two or more islands. These cases will be included in a future work.Also, the proposed model produces networks with out-degree distributions that follow exponential and Poisson distributions. This contrasts with the out-degree distributions of several real networks in which the out-degree distribution follows a power-law. This is a limitation of the proposed model and could be a future topic of study.Finally, it should be noted that the result obtained in (14) is similar to the model proposed by Simon [39], which was developed to explain the distribution of words in prose samples by their frequency of occurrence. It is remarkable that such different behaviors produce similar mathematical results.


## 5. Conclusions

In summary, large complex networks such as the US patents citation network [36] have more than one island and itsisland size distributionIs follows a power-law Is~s-a [37]. In order to reproduce this behavior, we have introduced a growth model for complex networks that considers the creation of islands during the growth of the network. In this model two cases are considered: namely, the creation of islands is more frequent in the networks early stages of growth and the probability of new islands remains constant as the network grows. When the first case is used, the network generated have Is and Qi with power-law behavior with scaling exponents α=1 and γ=2, respectively. When the second case is used, the network generated exhibits Is and Qi with power-law behavior with scaling exponent, both ranging from 2 to ∞.



---

*Source: 7157943-2017-01-16.xml*