#### Abstract

Many studies have considered the preferential attachment mechanism to cause scale-free networks. On the contrary, a network evolution model based on nonpreferential attachment is proposed to explain some non-scale-free network, and the existence of a stable degree distribution of the model is theoretically proven. Three methods are suggested to estimate the distribution. The model’s significance shows that preferential attachment is not the only mechanism of tail power-law distribution, which gives a reasonable explanation to non-scale-free phenomenon. Our results provide a new train of thought for understanding the degree distribution of network.

#### 1. Introduction

Network research is an effective way to study complex systems. Since the emergence of two landmark network models, such as the WS model [1] and the BA model [2], network models have been widely studied. Such studies are performed in many fields, including social interactions between individuals, protein or gene interactions in living organisms, synaptic connections, communication between computer networks, and various transportation systems. Generally, in network research, it is said that most or all real-world networks are scale-free [3–8]. That is, the node degree *k* of the network follows power-law distribution. Besides, in network science, studies on the application of a scale-free network have been extensively performed [2, 9, 10]. Various studies have evaluated how the existence of a scale-free structure affects the running of networks [7–12]. Scale-free networks have been used as the basis for numerical simulation and experiments. Studies have also investigated the generation mechanisms of scale-free networks [2, 5, 13–15]. Network models can describe many systems, and it is reported that preferential attachment can lead to scale-free [16]. In addition to the BA model, some representative development models have been used to describe this mechanism, for example, the earlier price model with an adjustable power rate [17, 18], the HK model with an adjustable clustering coefficient [19], the fitness model that is based on individual differences [20], and the local-world evolving network model that is based on local world evolution [21] among many others. Many real networks have some standard features, including power-law degree distribution, small average shortest path length, and high clustering. Some networks following the WS model (not all) have a small average shortest path length and high clustering with no power-law degree distribution, which contrasts with the BA network model [18–21].

The universality of scale-free networks has not been established. Some studies have reported that scale-free is universal [6, 10, 11, 22, 23]. ER random graph can also be “scale-free,” and classical random graphs with unbounded expected degrees are locally scale-free. The others hold the opposite view, based on data and statistical theory [4, 5, 24–30]. Broido and Clauset tested 1000 real network datasets [31], and they concluded that scale-free networks are very rare. Besides, they established that only about 15% of the network showed a strong or strongest scale-free structure features.

The generation mechanism is commonly discussed in scale-free network studies, particularly preferential attachment [2, 3, 17, 18]. One of the most famous connection mechanisms is that the probability of obtaining a connection is proportional to current node degrees. It is called preferential attachment, which means that the new node has a greater preference to connect to an old node with a bigger degree. Many studies are based on the connection mechanisms.

Many previous network generation models were based on scale-free assumptions. However, empirical data show that not all network distributions strictly conform to power-law distribution [31]. Occasionally, when lognormal distribution is used to fit the real network data, the result is the same as the power-law distribution, or even better [32–34]. Preference connections explain the mechanism of scale-free generation. Therefore, the question is as follows: are there other mechanisms to explain these distributions?

#### 2. Network Evolution Model

The initial number of nodes in the network is *N*_{0}, the average degree is <*k*>, and the final network size is *N*. The following were the network evolution rules:(i)Initial moment: the network contained *N*_{0} nodes, random connections, and (*N*-*N*_{0}) isolated potential nodes(ii)Nonpreferential disconnection (NPD): for node in the network, a neighbor is randomly selected to disconnect ( )(iii)Nonpreferential attachment (NPA): we randomly selected a node from the network and connected ( )(iv)NPD and NPA for each point in network(v)Steps (ii)–(iv) were repeated

The evolutionary steps take place one at a time, with only a rewiring involving two edges being involved. It seems to be counterintuitive to the objective of applying a fair and completely unbiased connectivity, as it restricts multiple such rewirings happening concurrently. However, when the network size is very large, the probability of simultaneous occurrence is very small, so the results of the sequential evolution of nodes and simultaneous evolution are very close. The sequential evolution brings great convenience to our computer simulation. In the following theoretical analysis, the evolution of some nodes has no sequence at all and is completely unbiased.

Preferential attachment exists in human relations. Human social contacts can be biased to a certain extent. However, some network nodes cannot be biased due to a lack of subjective consciousness, such as neural connections, metabolic networks, and protein regulatory networks. Compared to the BA model’s preferential attachment, disappearance and generation of edges between nodes in this model are fair and completely unbiased to every node. A mechanism of edge fading is presented in this model, while a mechanism of new edge generation is also proposed. This design is in tandem with the real network, where many node relationships fade and emerge over time. Node relationships of the network are not unchanged after generation. For example, a friend relationship of a social network will break down or make new friends [35–37], and synaptic plasticity of neural networks leads to the loss of synaptic connections or are newly formed and strengthened [38, 39]. This reconnection mechanism is a connection transfer mechanism, which has a particular practical significance in some networks, such as the trade and debt lending networks [40–43], where the trade volume and debt relationship are transferred between nodes. Under this mechanism, some old nodes are disconnected and leave the network, while some new nodes join the network and they are connected without preference. This is in tandem with the fact that aging nodes exit the network, whereas new nodes join the network.

#### 3. Degree Distribution Analysis

##### 3.1. Degree Distribution and Network Evolution

For time *t*, the probability of the node with degree *k* is . Consequently, the distribution is . “*T*” stands for transpose.

The probability that the node degree changes from *i* to *j* is . Obviously, in our model, it is impossible for degree *i* to become *j* when *j* < *i* − 1. Considering node with degree *i* > 1 and *j* ≥ *i* − 1, in addition to the node that was randomly selected in NPD, the other neighbor nodes and the node itself in the process did not change the degree. The degree is (*i* − 1) after NPD. To change its degree to *j*, it has to be selected (*j* − *i* + 1) times by the rest of the (*N* − *i*) nodes in NPA, with no preference to the probability, which is 1/(*N* − 1).

Thus, one could getwhere is the number of combinations of *N* choose *i*.

Therefore, the probability function of node degree at time *t* is

Notably , then .

This iterative process dynamically describes node degree distribution of the development model at any given time.

##### 3.2. Existence of Stability Distribution

We prove that stability distribution exists as the time approaches infinity. The lemmas and definitions to be used later are introduced first.

*Definition 1. *For a square matrix , is called column Gerschgorin circle, where .

*Definition 2. *For a square matrix , it is called a primitive matrix if there is a positive integer *n*, *M*^{n} > 0.

Lemma 1 (Gerschgorin disk theorem [44]). *If M is a square matrix, any eigenvalue of M belongs to at least one column Gerschgorin circle , belongs to union of them, .*

Lemma 2 (Perron–Frobenius theorem [44]). *If M is a primitive matrix, then the spectrum radius is a single root, and , where and are left and right Perron vectors.*

*Then, we prove that Lemmas 3 and 4 are true.*

Lemma 3. *Matrix is the primitive matrix.*

*Proof. *Let .

Becauseone can getWe take , obviously .

Therefore, .

We get that *A* is the primitive matrix.

Lemma 4. * is an eigenvalue of .*

*Proof. *Substituting into the eigenpolynomial , one getsWe add the first *N* − 2 rows to the last row.

Then,Its shown that is an eigenvalue of *A*.

Therefore, we prove the existence theorem for stable distributions.

Theorem 1. *It states that the network evolution model has a stable degree distribution, and the stable distribution is the eigenvector corresponding to the eigenvalue 1.*

*Proof. *For column Gerschgorin circlewhere .

Thus, , namely, any eigenvalue satisfies .

From Lemma 4, we have is an eigenvalue of *A.*

Therefore, 1 is the greatest eigenvalue and spectrum radius .

From Lemmas 2 and 3, spectrum radius is a single root, and , where and are left and right Perron vectors, namely, .

Then, . Let .

Taking the limit of the distribution iterating over time , then . That is, *P* is the eigenvector corresponding to the eigenvalue 1.

Remark: conclusion of the theorem shows that network evolution has a stable distribution. This distribution is the eigenvector corresponding to the eigenvalue of 1, and this distribution is independent of the initial state of the network. Though this conclusion provides the distribution computing method, it is very difficult to solve the matrix eigenvectors when the network size is large.

##### 3.3. Estimation of Stability Distribution

As the size of the matrix increases, the becomes unusually large, its computation is difficult, and accurate calculation is impossible. We used an approximate calculation:

It shows that when *N* is large, . Note that .

The approximate results .

It should be noted that because of the approximation, the maximum eigenvalue of *A* is not 1, just approximate 1, and the eigenvector cannot be a positive vector. The negative component’s absolute value is minimal, which can be treated as 0. Therefore, three estimation methods are proposed. Method 1: calculate the eigenvectors corresponding to the maximum eigenvalue of , ignore the negative components, and normalize it Method 2: solving equations Method 3: iterative estimation

#### 4. Comparisons between Model and Real Network

A simulation experiment is operated. The value of *N* needs to be large enough because too few nodes will affect two results. First, it will influence the statistical accuracy of the degree distribution. Second, the estimation of stable distribution requires Poisson distribution to approximate binomial distribution, and the error is large due to too few nodes.

If no parameters are specified, the simulation result is the average of 10 networks, the number of nodes in each network *N* = 10000, and the average degree <*k*> = 10.

Statistical analysis of real network data established that not all networks have strict scale-free degree distribution. A study [31] adopted mathematical methods to ascertain whether the real network meets the scale-free threshold. However, findings were greatly different from previous cognition. It was found that scale-free networks are rare. In this study, as illustrated in Figures 1(e)–1(h), we have shown four representative real network degree distributions. These networks are not strictly scale-free distributions, but a tail with approximate scale-free characteristics. Such distribution is not individual, but a large number. Broido et al. reported that, about 96% of networks are not strictly scale-free [31]. In particular, the form of pressure-head and heavy-tail in Figure 1(g) and degree distribution of tail approximate power law is prevalent and is significantly different from the BA model [2] in terms of head characteristics. In the simulation experiment, our model exhibits a strong network reproduction ability. Four different degree distribution patterns (Figures 1(a)–1(d)) correspond to degree distributions of four real networks in different evolution stages. Figures 1(i)–1(l) show the results of three degree distribution estimation methods after stability distribution analysis. They are consistent with the real network and simulation results, and it is also the approximate power-law distribution of the tail. Head distribution is slightly different and is due to differences between theoretical analysis, simulation experiment, and real network evolution mechanisms, namely, the reconnection of edges appears sequentially in simulation and real networks, but not in theoretical analysis.

**(a)**

**(b)**

**(c)**

**(d)**

**(e)**

**(f)**

**(g)**

**(h)**

**(i)**

**(j)**

**(k)**

**(l)**

As shown in Figure 2, we studied the average path length (*L*) and the average clustering coefficient (*C*) of the model. Performance of the model on the average path is consistent with that of the real network. It shows the small-world characteristic. With an increase in *N*, *L* is approximately proportional to the ln*N*, which is close to ER, WS, and BA models [47, 48]. With the increase in average network degree <*k*>, *L* descends rapidly, especially in the early stage, the descending speed is a power law, and in the middle and later stages, it approaches 1. Table 1 compares the average path length of some real networks with simulation networks of the same size and average degree. Real network data are from literature [15, 46, 49–55], and the results show that the model can well describe the small-world characteristics of real networks. However, the clustering coefficient changes in precisely the opposite way. With an increase in network size, *C* rapidly decreases to 0 by a power law, like in the BA model, while with an increase in <*k*>, *C* increases to 1 by a linear law. These findings suggest that the model network in the more massive network average degrees has a useful node aggregation. The network model can generate a high clustering coefficient of the network, and the clustering coefficient is adjustable. But it has obvious gaps when compared to the real network. Some smaller <*k*> of the real network also possesses a high clustering coefficient.

**(a)**

**(b)**

**(c)**

**(d)**

#### 5. Conclusion

We propose a new network evolution mechanism that is unbiased for all network nodes. It is believed that the scale-free network is caused by the preferred connection mechanism [16–21], and our study shows that scale-free results of real networks could have other mechanisms. Model results revealed that the head’s degree distribution is pressure-head, slightly smaller than that of the power-law distribution, and the empirical data is consistent. The pressure-head phenomenon is common in real network data [15, 35, 45, 46]. Models such as the BA model can only exhibit power-law distribution. They do not provide results of the pressure-head. However, this phenomenon was produced in our model. The simulation shows that it exhibits the tail power-law distribution and the pressure-head phenomenon. Another *nonpreferential attachment* mechanism was proposed [56]. The connection between two nodes depends asymmetrically on their types. The model results based on graph limit theory, in the sense that the number of copies of any fixed subgraph converges when network size tends to infinity, while network distribution converges when time tends to infinity in our work. However, their results do not involve scale-free distribution and the shortest path discussed.

The BA network model [2, 48] shows that the network’s degree distribution conforms to the power law , . Our model’s simulation implies that it has a broader range of and is a power-law adjustable model, consistent with the real network. In verifying small-world characteristics, simulation results showed excellent performance when compared with some real networks. The average path length of the network is very close to the real network. As the network size increases, the average path length is proportional to ln*N*, and it rapidly decreases as the average degree increases. However, the performance of the clustering coefficient is not consistent with that of real networks. As the network size increases and the average degree decreases, the clustering coefficient tends to approach zero. In contrast, many real networks have a high clustering coefficient at a larger scale. When the triangle connection mechanism [19] is employed in this model, the clustering coefficient could be quickly improved, but it will be challenging to theoretically prove stable distribution.

As mentioned above, many previous studies concluded that degree distribution of the network should be scale-free. However, some studies contradict this conclusion. Broido and Clauset reported that scale-free networks are rare [31], and only 4% of networks have the most vital scale-free characteristic. These are two seemingly opposite conclusions, but they may not be contradictory from a different perspective. This is because scale-free properties referred to tail distribution but strictly speaking is not on the whole range. This reason accounts for ‘scale-free networks are rare’ [31]. It is reported that very different networks may have the same degree distribution [57]. The degree distribution is *not* the only important thing in network. Even networks with identical degree distributions have completely different properties.

Pressure-head and heavy-tail distribution in the real network data seriously affects acceptance of scale-free distribution. The model proposed in this paper provides a unified explanation. Figures 1(a)–1(d) shows that various distributions can appear in the process of network evolution, with apparent non-power-law distribution and tail approximate power-law distribution, consistent with multiple distributions in real network data (Figures 1(e)–1(h)). In other words, network distribution can be scale-free or non-scale-free. Degree distribution of a network is always in the process of random evolution. It is a particular stage in the evolution process for all real network structures, rather than the network’s final state. Maybe the limit state of network evolution is scale-free as observed in many real networks with tail power laws. But many networks are not strictly scale-free because they have not yet achieved maturity or stability in their evolution. Two viewpoints can be unified into our model, which provides a new idea for the understanding degree distribution in network research. The real data employed are rather restricted and insufficient to support the strong claims of the paper. More extensive comparison with real networks should be performed regarding the degree distribution. The amount of data used in this paper is relatively limited, and the more the data, the better it can support the viewpoints of this paper.

#### Data Availability

The data used to support the findings of this study are included within the article.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Acknowledgments

This work was supported by the National Natural Science Foundation of China under Grant no. 11502062.