# The Formation of Social Network Assortativity: A Cultural Trait-Matching Mechanism

Authors: Wei Wang; Xiaoming Sun; Yalan Wang; Wentian Cui
Journal: Complexity
 (2020)

---

## Abstract

The preferential attachment mechanism that forms scale-free network cannot display assortativity, i.e., the degree of one node is positively correlated with that of their neighbors in the network. Given the attributes of network nodes, a cultural trait-matching mechanism is further introduced in this paper. Both theoretical analysis and simulation results indicate that the higher selection probability of such mechanism, the more obvious the assortativity is shown in networks. Further, the degree of nodes presents a positive logarithm correlation with that of adjacent ones. Finally, this study discusses the theoretical and practical significances of the introduction of such a cultural trait-matching mechanism.


---

## Body

## 1. Introduction

The concept of assortativity was introduced by Newman in 2002 [1]. Note that Newman [1] put forward assortativity in the context of social networks rather, some scholars investigated assortative mating, characterized as “self-seeking like,” and assortation in broader contexts beyond networks (see Schwartz’s work [2] for a review), such as mate selection strategies, evolution of sex, choice of pets, genetic algorithms, and emergence and maintenance of social cooperation. In this study, we limit the implications of assortativity to social networks [1]. Namely, the high-degree nodes in social networks are, on average, connected to other nodes with high degree, and low degree nodes are, on average, connected to other nodes with low degree [1, 3, 4]. In short, similarity breeds connection [5]. Henceforth, assortative behaviors have been widely quantified and mimicked in a variety of real-world networks, e.g., Internet, World-Wide Web, Facebook, physics coauthorship, mathematics coauthorship, company directors, nand eutral network (see [6] for a review). Meanwhile, scale-free networks, given by Barabasi and Albert [7, 8], are formed by the preferential attachment mechanism. However, Newman proved that the assortativity coefficient of a network formed by preferential attachment mechanism tended to be zero when the network reached a very large scale [1]. Such a phenomenon is not consistent with the properties of real-life social networks. Therefore, a lot of scholars have investigated the issues as to the formation and characteristics of assortativity [5, 9–19]. Yet, our understanding of the role of cultural characteristics in the formation of social network assortativity is fairly limited.With respect to the formation of assortativity, Newman and Park [9] introduced a network model based on the formation mechanism of community networks. Using this model, they proved that since a social network could be divided into communities, community structure in turn resulted in positive correlation of node degree. In contrast, nonsocial networks did not usually present such structures. They therefore argued that the assortativity of social networks, which could not be found in nonsocial networks, may be attributable to community structure. Catanzaroa et al. [10, 11] established a mathematical model to reproduce the assortativity of collaborative networks between scientists specializing in condensed matter physics, wherein the networks were regarded as being derived from two mechanisms. One is the preferential attachment mechanism of the BA model, and the other is the mechanism allowing for the connection probability being determined by the similarity of the degrees of two nodes in embordering two unconnected nodes. Guo et al. [12] developed a combined (scale-free small-world) network with adjustable assortativity coefficients, which overcame the defect of the assortativity of a network tending to zero when the network scale became large. Vázquez [14] asserted that the local-world connection mechanism was important in the formation of degree correlation. Xulvi-Brunet and Sokolov [15] proposed an algorithm that could produce arbitrary sized assortativity coefficients to explore the assortativity in networks. They further applied this algorithm to the BA model and concluded that the network assortativity positively correlated with the shortest network path.Rather than the formation of assortativity, some scholars explored the characteristics of assortativity. For example, existing research of assortativity mainly focused on one dimension of attributes at a time, Block and Grund [16], instead, investigated multidimensional assortativity (also called as homophily in the study) in the context of network dynamics. They found that main effects for assortativity on various dimensions were positive, while the interaction of assortativity effects was negative. Peel et al. [17] argued that the distribution of assortativity in many real-world networks was skewed, overdispersed, and multimodal. Similarly, Piraveenan et al. [18] introduced a measure of local assortativity and found the various distribution of local assortativity in biological, social, and technological networks. Further, based on scalar assortativity, the extension of assortativity proposed by Newman [3], Piraveenan et al. [19] found scalar assortativity carried information about network dynamics.Recent literature reviewed above, however, is mainly from the perspective of physical evolution mechanisms and physical description, and limited attention has been paid to the role of social attributes of nodes in network assortativity. Notably, a recent study of Cantwell and Newman [4] indicated that assortativity captured only the average mixing behavior of nodes, neglecting individual difference in networks. They introduced a generative stochastic model to unveil the individual variation in mixing patterns, further argued that traditional average measures of assortative mixing offer an incomplete description of network structure. In line with this argument, Altenburger and Ugander [20] concentrated on the variability of assortativity. In the study of Facebook membership, they found that some individuals with extreme preferences for a particular attribute possibly unrelated to their own attribute, which was called as monophily. Therefore, the individual attributes of nodes should be emphasized in assortativity research. Actually, assortativity have been applied to some social attributes of nodes, including race [21], language [22], age [23], nationality [24], and social status [25]. As an example, employing sociological theory, Postmes et al. [25] pointed out that, although ordinary people expected to establish connections with celebrities or industry elites, these celebrities or industry elites preferred to communicate or cooperate with those of perceived equal social standing. Such phenomenon resulted in the positive correlation of node degree. Hence, positive degree correlation could only possibly be observed in such competitive scenarios. In contrast, online social networks, which broke competitive and social class, showed disassortativity [25]. Furthermore, Postmes et al. [25] speculated that positive correlation also depended on the irreplaceability of two collaborative parties, i.e., the research subject and knowledge background of researchers or the performing style of entertainers. Meanwhile, Liu et al. [13] designed a weighted network model by integrating the mutual selection mechanism between nodes and the self-learning mechanism. They proposed that, in the case of high probability of self-learning and low value of mutual selection, the assortativity of social networks emerged.On the other hand, empirical research also suggested that a social network was composed of individuals with various cultural characteristics. These individuals built relationships according to own cultural characteristics. The relationships were thus developed into a network group with different structures and characteristics [5, 26].Above two lines of arguments indicate that relationships between social individuals are not established completely in accordance with the preferential attachment mechanism. In other words, social individuals are not always prone to select nodes with higher connection degrees. Instead, they refer to the mechanisms that including more social characteristic, for example, cultural characteristics [27]. In sum, this study constructs a social network using cultural characteristic matching as its connection mechanism. Moreover, it explains the assortativity of a social network from the perspective of social attributes.


## 2. A New Network Model with Cultural Trait-Matching Mechanism

### 2.1. Cultural Traits and Features

Culture traits and features are described using the social individual culture characterizations proposed by Axelrod [27].(1)
Cultural traits refer to the society’s cultural symbols as selected by individuals. For example, social individuals can select one language (e.g., Chinese, English, and Korean) as their communication tool; each language is thus an independent cultural trait.(2)
Cultural features are abstract concepts of different cultural traits of individuals. For example, Chinese, English, and Korean can be abstractly defined as languages; Buddhism, Taoism, and Christianity can be defined as religious beliefs [28]. In turn, language is a cultural feature, and individuals can choose Chinese, English, or Korean as their own cultural traits. As noted by Axelrod [27], “…it describes a culture as a list of features or dimensions of culture. For each feature there is a set of traits, which are the alternative values the feature may have.”


### 2.2. Model Assumption

Social individuals are heterogeneous [29, 30]. Merely from the viewpoint of culture, each social individual has his/her different cultural traits. These specific cultural traits lead to the differences between social individuals [27].Connections of social individuals are built by two selection mechanisms. One is the preferential attachment mechanism [31], in which individuals mainly focus on the degree of nodes being connected. To be concrete, they are more concerned about the influences of target connection nodes, rather than whether or not the cultural traits of the target node match theirs. This phenomenon is widespread. In many cases, for instance, the connections between social individuals are a result of blind follow or demand on the influences of the other party, such as power or reputation. The other is the cultural trait-matching mechanism. With this mechanism, individuals are more likely to connect with nodes bearing higher matching degree with their cultural features [5, 25, 27]. This phenomenon is also common in practice. For example, amongst three people, two people who share a love of calligraphy are more likely to establish a connection and further become friends.


### 2.3. Network Formation

Employing Axelrod’s cultural diffusion model [27], each individual or agent i has its cultural features defined as a vector of F; each feature takes its integer values from a range of q possible cultural traits [28]. Thus, qF different cultural trait vectors are obtained [32, 33]. To be concrete, the formation mode of cultural features by individual i is represented as vector ci=αi1,αi2,…,αiF, where αi,f∈Cf,i=1,2,…,N;f=1,2,…,F; Cf=1,2,3,…,q−1,q, Cf=q [33]. The formation steps of networks are as follows:(1) Initialize a fully connected network withm0 nodes, and assign a cultural feature vector for each node.(2) At each time stept, a new node is added and connected with nodes available in the network. This new node has a cultural feature vector ct and m edges m≤m0 [7, 8].(3) The new node selects a preferential attachment mechanism with the probabilityp and adopts a cultural trait-matching connection mechanism according to probability 1−p. If the new node chooses a preferential attachment mechanism, it is connected to the existing node i with the probability in equation (1), where j denotes arbitrary node in the network except the newly introduced one [31]. Besides, if the new node chooses a cultural trait-matching connection mechanism, it is necessary to firstly calculate the cultural trait-matching degree between the new node and the existing one i by using equation (2). Further, the new node is connected to the nodes in the network with the probability in equation (3):(1)∏ki=ki∑jkj,(2)Mti=∑f=1Fλαtf,αif,λαtf,αif=1,ifαtf=αif,0,ifαtf≠αif,(3)PMti=Mti∑jMtj.(4)
Repeat steps (2) and (3) until the network scale reachesN.


## 2.1. Cultural Traits and Features

Culture traits and features are described using the social individual culture characterizations proposed by Axelrod [27].(1)
Cultural traits refer to the society’s cultural symbols as selected by individuals. For example, social individuals can select one language (e.g., Chinese, English, and Korean) as their communication tool; each language is thus an independent cultural trait.(2)
Cultural features are abstract concepts of different cultural traits of individuals. For example, Chinese, English, and Korean can be abstractly defined as languages; Buddhism, Taoism, and Christianity can be defined as religious beliefs [28]. In turn, language is a cultural feature, and individuals can choose Chinese, English, or Korean as their own cultural traits. As noted by Axelrod [27], “…it describes a culture as a list of features or dimensions of culture. For each feature there is a set of traits, which are the alternative values the feature may have.”


## 2.2. Model Assumption

Social individuals are heterogeneous [29, 30]. Merely from the viewpoint of culture, each social individual has his/her different cultural traits. These specific cultural traits lead to the differences between social individuals [27].Connections of social individuals are built by two selection mechanisms. One is the preferential attachment mechanism [31], in which individuals mainly focus on the degree of nodes being connected. To be concrete, they are more concerned about the influences of target connection nodes, rather than whether or not the cultural traits of the target node match theirs. This phenomenon is widespread. In many cases, for instance, the connections between social individuals are a result of blind follow or demand on the influences of the other party, such as power or reputation. The other is the cultural trait-matching mechanism. With this mechanism, individuals are more likely to connect with nodes bearing higher matching degree with their cultural features [5, 25, 27]. This phenomenon is also common in practice. For example, amongst three people, two people who share a love of calligraphy are more likely to establish a connection and further become friends.


## 2.3. Network Formation

Employing Axelrod’s cultural diffusion model [27], each individual or agent i has its cultural features defined as a vector of F; each feature takes its integer values from a range of q possible cultural traits [28]. Thus, qF different cultural trait vectors are obtained [32, 33]. To be concrete, the formation mode of cultural features by individual i is represented as vector ci=αi1,αi2,…,αiF, where αi,f∈Cf,i=1,2,…,N;f=1,2,…,F; Cf=1,2,3,…,q−1,q, Cf=q [33]. The formation steps of networks are as follows:(1) Initialize a fully connected network withm0 nodes, and assign a cultural feature vector for each node.(2) At each time stept, a new node is added and connected with nodes available in the network. This new node has a cultural feature vector ct and m edges m≤m0 [7, 8].(3) The new node selects a preferential attachment mechanism with the probabilityp and adopts a cultural trait-matching connection mechanism according to probability 1−p. If the new node chooses a preferential attachment mechanism, it is connected to the existing node i with the probability in equation (1), where j denotes arbitrary node in the network except the newly introduced one [31]. Besides, if the new node chooses a cultural trait-matching connection mechanism, it is necessary to firstly calculate the cultural trait-matching degree between the new node and the existing one i by using equation (2). Further, the new node is connected to the nodes in the network with the probability in equation (3):(1)∏ki=ki∑jkj,(2)Mti=∑f=1Fλαtf,αif,λαtf,αif=1,ifαtf=αif,0,ifαtf≠αif,(3)PMti=Mti∑jMtj.(4)
Repeat steps (2) and (3) until the network scale reachesN.


## 3. Theoretical Analysis

### 3.1. Degree Distribution

At each time step, a node with a cultural feature vector enters the network. Assuming that the elements inCf are selected with equal probability 1/q, not only within a cultural feature Cf but also between across different cultural feature sets [32]. As a consequence, a selection cycle emerges, i.e., T=qF, it can be considered that at each time T, and all cultural feature vectors are uniformly selected once and enter the network along with the associated nodes [32, 33]. Therefore, at time t, when a new node enters the network, the cultural trait-matching degree between the original node and this new one develops from completely mismatching, matching only one culture feature, to full matching. The matching degree can be numerically represented as 0,1/F,2/F,…,1 [27, 28]. Accordingly, at time t, the sum of matching degree between original nodes and the new node is S=m0+t/qF×s0, where s0 can be expressed by equation (4) [28]. It refers to the theoretical sum of matching degree in one selection cycle. The matching degree of the new node with original nodes in the network is set as a random, time independent variable:(4)s0=CF0q−1F×0+CF1q−1F−1×1F+⋯+CFFq−1F−F×1.According to mean field theory and thek continuum hypothesis [7, 8], the dynamical equation of the degree ki of node i can be obtained:(5)∂ki∂t=A∏ki,∏ki=∏1ki+∏2ki,where the value of A is m=2. ∏1ki and ∏2ki are the probabilities of preferential attachment and culture trait matching, respectively:(6)∂ki∂t=mpki2mt+m0+1−pLqFm0+ts0.where L is the matching degree of new added node with its arbitrary original node. The expected value of L is EL=CF0q−1F/qF×0+CF1q−1F−1/qF×1/F+⋯+CFFq−1F−F/qF×1, thus(7)∂ki∂t≈pki2t+1−pmLqFts0.LetG=LqF/s0, the degree of node i at time t can be calculated by equation (7):(8)kit=m+2m1−pGpttip/2−2m1−pGp.According to the definition of degree distribution,(9)Pk,t=∂Pkit<k∂k.Substituting equation (8) into equation (9), we obtain(10)Pk,t=2pm+2m1−pG2m1−pG+pkpm+2m1−pG−2+P/P.(1)
Whenp=1, such a model completely transforms into the BA model, in which the power law index of k is γp=2+p/p=3.(2)
Whenp=0,(11)Pk,tp=0=limpim2mp+2m1−pG2m1−pG+kpmp+2m1−pG−2/p.Let2m1−pG+kp/mp+2m1−pG−2/p=V,(12)limp⟶ilnV=−limp⟶iln2m1−pG+kp/pm+2m1−pG2pp=limpimmp+2m1−pG/2m1−pG+kp22m1−pG+kp/mp+2m1−pG2p1.By solving equation (12), we can find(13)V=m−k2m2G2.Hence, whenp=0, the degree distribution is(14)Pk,tp=0=1mGe−k/2m2G2+1/2mG2.


### 3.2. Degree Correlation

Letδ=p/2 and Zst is the sum of the degrees of adjacent nodes of node s. For arbitrary node j in adjacent node set ϑs of node s, there is(15)Zst=∑j∈ϑskjt.Thus, the mean degree of adjacent nodes of nodes is(16)knns=Zstkst.The rate equation ofZst [34] is(17)dZstdt=mm∏sk,t+m∑j∈ϑs∏jk,t.In equations (15), (16), and (17), k=k1t,k2t,…,kt−1t. The first section on right-hand side of equation (17) denotes that, when new node t is directly connected to node s, the degree of adjacent nodes of node s increases by m units. The second section on the right-hand side of equation (17) delineates that, when new node t is directly connected with the adjacent nodes of node s, the degree of adjacent nodes of node s increases by one unit. Therefore, to solve the rate equation, the boundary conditions should be obtained, i.e., the sum of degrees for all the adjacent nodes of node s at time s:(18)Zss=m∑j=1s∏jk,skjs+1.This implies that, at times, new node s is connected to an available node with degree of kjs in the network. According to this analysis, the probability of node s being connected to the available node is(19)∏sk,t=pki2mt+m0+1−pLqFm0+ts0.Substituting equation (19) into the rate equation (17), we obtain(20)dZstdt=m2pkst2mt+m0+1−pGm0+t+m∑j∈ϑspkjt2mt+m0+1−pGm0+t≈δm+κkst+κmt+δZstt,where κ=2mG1−p/p. By solving the rate equation, the general solution of Zst becomes(21)Zst=B0stδ+βm+κ2tsδlnt+κ2.where B0 is given by boundary conditions:(22)Zss=m∑j=1spkjs2m+m0t+1−pGm0+tkjs+1=δκ+2mδκ+1+δs∑j=1skj2s.Substitutingkjs=m+κs/jp/2−κ into equation (22) gives(23)Zss=m1−κ+δm+κ2s2δ−1∑j=1sj−2δ.(1)
Whenp=1, κ=0, and γ=3 [31], the result indicates that the network evolved from the model is a scale-free network. Ignoring the fact that the limit is zero when t and s are large, as independent variables, since ∑j=1sj−1≃lns,Zss≃m2/2lns is obtained,(24)Zst≃m22tslns.Under the limiting condition that whenk and N are large, s is replaced by the function of s in k, we get s=tk−1/βm+a1/β. Using the final scale N of the network to replace t, when t=N, according to equation (16), we find that(25)knnk,N≃m2lnN.Obviously, the degree correlation of two nodes in a scale-free network is related with the scale of network but independent of the degrees of the nodes. Thus, the assortativity coefficient of a scale-free network is zero [1].(2)
When0<p<1, namely, κ>0,γ>3, we get ∑j=1sj−2δ≃s1−2δ/1−2δ, thus(26)Zst≃δm+κ2tsδlnts+m1−κ+δm+κ21−2δ−κ2tsδ.Therefore, the degree correlation function of a given node is(27)knnk,N≃m+κlnkm+κ.Equation (27) shows that, under these conditions, as for any node, the mean degree function of its adjacent nodes presents a positive logarithmic correlation with node degree but is unrelated to network scale. Therefore, the network displays assortativity.


## 3.1. Degree Distribution

At each time step, a node with a cultural feature vector enters the network. Assuming that the elements inCf are selected with equal probability 1/q, not only within a cultural feature Cf but also between across different cultural feature sets [32]. As a consequence, a selection cycle emerges, i.e., T=qF, it can be considered that at each time T, and all cultural feature vectors are uniformly selected once and enter the network along with the associated nodes [32, 33]. Therefore, at time t, when a new node enters the network, the cultural trait-matching degree between the original node and this new one develops from completely mismatching, matching only one culture feature, to full matching. The matching degree can be numerically represented as 0,1/F,2/F,…,1 [27, 28]. Accordingly, at time t, the sum of matching degree between original nodes and the new node is S=m0+t/qF×s0, where s0 can be expressed by equation (4) [28]. It refers to the theoretical sum of matching degree in one selection cycle. The matching degree of the new node with original nodes in the network is set as a random, time independent variable:(4)s0=CF0q−1F×0+CF1q−1F−1×1F+⋯+CFFq−1F−F×1.According to mean field theory and thek continuum hypothesis [7, 8], the dynamical equation of the degree ki of node i can be obtained:(5)∂ki∂t=A∏ki,∏ki=∏1ki+∏2ki,where the value of A is m=2. ∏1ki and ∏2ki are the probabilities of preferential attachment and culture trait matching, respectively:(6)∂ki∂t=mpki2mt+m0+1−pLqFm0+ts0.where L is the matching degree of new added node with its arbitrary original node. The expected value of L is EL=CF0q−1F/qF×0+CF1q−1F−1/qF×1/F+⋯+CFFq−1F−F/qF×1, thus(7)∂ki∂t≈pki2t+1−pmLqFts0.LetG=LqF/s0, the degree of node i at time t can be calculated by equation (7):(8)kit=m+2m1−pGpttip/2−2m1−pGp.According to the definition of degree distribution,(9)Pk,t=∂Pkit<k∂k.Substituting equation (8) into equation (9), we obtain(10)Pk,t=2pm+2m1−pG2m1−pG+pkpm+2m1−pG−2+P/P.(1)
Whenp=1, such a model completely transforms into the BA model, in which the power law index of k is γp=2+p/p=3.(2)
Whenp=0,(11)Pk,tp=0=limpim2mp+2m1−pG2m1−pG+kpmp+2m1−pG−2/p.Let2m1−pG+kp/mp+2m1−pG−2/p=V,(12)limp⟶ilnV=−limp⟶iln2m1−pG+kp/pm+2m1−pG2pp=limpimmp+2m1−pG/2m1−pG+kp22m1−pG+kp/mp+2m1−pG2p1.By solving equation (12), we can find(13)V=m−k2m2G2.Hence, whenp=0, the degree distribution is(14)Pk,tp=0=1mGe−k/2m2G2+1/2mG2.


## 3.2. Degree Correlation

Letδ=p/2 and Zst is the sum of the degrees of adjacent nodes of node s. For arbitrary node j in adjacent node set ϑs of node s, there is(15)Zst=∑j∈ϑskjt.Thus, the mean degree of adjacent nodes of nodes is(16)knns=Zstkst.The rate equation ofZst [34] is(17)dZstdt=mm∏sk,t+m∑j∈ϑs∏jk,t.In equations (15), (16), and (17), k=k1t,k2t,…,kt−1t. The first section on right-hand side of equation (17) denotes that, when new node t is directly connected to node s, the degree of adjacent nodes of node s increases by m units. The second section on the right-hand side of equation (17) delineates that, when new node t is directly connected with the adjacent nodes of node s, the degree of adjacent nodes of node s increases by one unit. Therefore, to solve the rate equation, the boundary conditions should be obtained, i.e., the sum of degrees for all the adjacent nodes of node s at time s:(18)Zss=m∑j=1s∏jk,skjs+1.This implies that, at times, new node s is connected to an available node with degree of kjs in the network. According to this analysis, the probability of node s being connected to the available node is(19)∏sk,t=pki2mt+m0+1−pLqFm0+ts0.Substituting equation (19) into the rate equation (17), we obtain(20)dZstdt=m2pkst2mt+m0+1−pGm0+t+m∑j∈ϑspkjt2mt+m0+1−pGm0+t≈δm+κkst+κmt+δZstt,where κ=2mG1−p/p. By solving the rate equation, the general solution of Zst becomes(21)Zst=B0stδ+βm+κ2tsδlnt+κ2.where B0 is given by boundary conditions:(22)Zss=m∑j=1spkjs2m+m0t+1−pGm0+tkjs+1=δκ+2mδκ+1+δs∑j=1skj2s.Substitutingkjs=m+κs/jp/2−κ into equation (22) gives(23)Zss=m1−κ+δm+κ2s2δ−1∑j=1sj−2δ.(1)
Whenp=1, κ=0, and γ=3 [31], the result indicates that the network evolved from the model is a scale-free network. Ignoring the fact that the limit is zero when t and s are large, as independent variables, since ∑j=1sj−1≃lns,Zss≃m2/2lns is obtained,(24)Zst≃m22tslns.Under the limiting condition that whenk and N are large, s is replaced by the function of s in k, we get s=tk−1/βm+a1/β. Using the final scale N of the network to replace t, when t=N, according to equation (16), we find that(25)knnk,N≃m2lnN.Obviously, the degree correlation of two nodes in a scale-free network is related with the scale of network but independent of the degrees of the nodes. Thus, the assortativity coefficient of a scale-free network is zero [1].(2)
When0<p<1, namely, κ>0,γ>3, we get ∑j=1sj−2δ≃s1−2δ/1−2δ, thus(26)Zst≃δm+κ2tsδlnts+m1−κ+δm+κ21−2δ−κ2tsδ.Therefore, the degree correlation function of a given node is(27)knnk,N≃m+κlnkm+κ.Equation (27) shows that, under these conditions, as for any node, the mean degree function of its adjacent nodes presents a positive logarithmic correlation with node degree but is unrelated to network scale. Therefore, the network displays assortativity.


## 4. Simulation Analysis

The initial network in this paper includes 10 nodes with fully connected. Besides, at each time step, we induce two edges into the network. With MATLAB® and Monte Carlo simulation method, we use the algorithm of roulette wheel selection to set the mode of node connection. Further, we run the program under each condition for 10 times and get the final results from averaging the values at each point.


### 4.1. Degree Distribution in Social Networks

Based on equation (8), we depict the variation characteristics of degree distribution under N = 5000 and different parameters in Figure 1, where p=1, p=0, and p=0.4, respectively, describe the network degree distribution generated totally by the preferential attachment mechanism of BA network, wholly by the cultural trait-matching connection mechanism, and by the combination of above two mechanisms with a probability of 0.4 and 0.6. According to the characteristics of degree distribution, we can see clearly that, with the influence of cultural trait matching, the social network generated shows a wide degree distribution and follows a power law.Figure 1
Degree distribution for different probabilities of the connection mechanism.


### 4.2. Influences of Connection Mechanismp on the Assortativity of Social Networks

Figure2 describes the variation characteristics of assortativity coefficient γ under different network scales and selection probabilities of preferential attachment when q=5 and F=6. It can be found that, under the same network scale, the larger p is, the smaller γ is; under the same preferential attachment mechanism selection probability p, γ decreases with increasing network scale N. However, when p is small, variations in γ diminish.Figure 2
Assortativity coefficients for different network scales and probabilities of connection mechanism.The assortativity coefficientγ is calculated by equation (28) [1, 12], which is employed to analyze the causes of variation in Figure 2, where ji and ki represent the degrees of two nodes connected by the ith edge and M refers to the number of edges in the network:(28)γ=M−1∑ijiki−M−1∑i1/2ji+ki2M−1∑i1/2ji2+ki2−M−1∑i1/2ji+ki2.Given equation (28), both the numerator and the denominator minus one same term, the network assortativity coefficient is thus determined by the relationship of jiki and 1/2ji2+ki2, where ji2+ki2≥2jiki. Moreover, when and only when ji=ki, ji2+ki2=2jiki. Therefore, it can be found that the closer the degrees of two nodes connected by one edge, the larger the assortativity coefficient of the network, and vice versa.Besides, under the preferential attachment mechanism, new nodes are more likely to connect with nodes, which have higher degree in the network. Such phenomenon is called as Matthew effect (i.e., the rich get richer). Further, with the increasing of network size, this effect is enlarged. Therefore, a small number of hubs with very large degrees are generated. Given that a few hubs are connected with a large amount of nodes bearing very low degrees, the network’s assortativity coefficient is thus very low. However, when the matching mechanism of cultural traits is introduced, the formation of hubs by preferential attachment mechanism is weakened. Moreover, due to the heterogeneity of cultural traits, node selection is no longer limited to the influence of node degree. Thus, the degrees of nodes are relatively uniform and the network’s assortativity coefficient is higher.


### 4.3. Simulation of Degree Correlation of Nodes

Figure3 shows the comparison of simulated and theoretical results of degree correlation under different parameters when N = 5000 (L is approximated using its expected value). It can be seen that the actual simulation results were basically fit with theoretically derived results.Figure 3
Comparison of simulated and theoretical mean degree of adjacent nodes at (a)q=2 and F=3 and (b) q=4 and F=3.
(a)(b)


## 4.1. Degree Distribution in Social Networks

Based on equation (8), we depict the variation characteristics of degree distribution under N = 5000 and different parameters in Figure 1, where p=1, p=0, and p=0.4, respectively, describe the network degree distribution generated totally by the preferential attachment mechanism of BA network, wholly by the cultural trait-matching connection mechanism, and by the combination of above two mechanisms with a probability of 0.4 and 0.6. According to the characteristics of degree distribution, we can see clearly that, with the influence of cultural trait matching, the social network generated shows a wide degree distribution and follows a power law.Figure 1
Degree distribution for different probabilities of the connection mechanism.


## 4.2. Influences of Connection Mechanismp on the Assortativity of Social Networks

Figure2 describes the variation characteristics of assortativity coefficient γ under different network scales and selection probabilities of preferential attachment when q=5 and F=6. It can be found that, under the same network scale, the larger p is, the smaller γ is; under the same preferential attachment mechanism selection probability p, γ decreases with increasing network scale N. However, when p is small, variations in γ diminish.Figure 2
Assortativity coefficients for different network scales and probabilities of connection mechanism.The assortativity coefficientγ is calculated by equation (28) [1, 12], which is employed to analyze the causes of variation in Figure 2, where ji and ki represent the degrees of two nodes connected by the ith edge and M refers to the number of edges in the network:(28)γ=M−1∑ijiki−M−1∑i1/2ji+ki2M−1∑i1/2ji2+ki2−M−1∑i1/2ji+ki2.Given equation (28), both the numerator and the denominator minus one same term, the network assortativity coefficient is thus determined by the relationship of jiki and 1/2ji2+ki2, where ji2+ki2≥2jiki. Moreover, when and only when ji=ki, ji2+ki2=2jiki. Therefore, it can be found that the closer the degrees of two nodes connected by one edge, the larger the assortativity coefficient of the network, and vice versa.Besides, under the preferential attachment mechanism, new nodes are more likely to connect with nodes, which have higher degree in the network. Such phenomenon is called as Matthew effect (i.e., the rich get richer). Further, with the increasing of network size, this effect is enlarged. Therefore, a small number of hubs with very large degrees are generated. Given that a few hubs are connected with a large amount of nodes bearing very low degrees, the network’s assortativity coefficient is thus very low. However, when the matching mechanism of cultural traits is introduced, the formation of hubs by preferential attachment mechanism is weakened. Moreover, due to the heterogeneity of cultural traits, node selection is no longer limited to the influence of node degree. Thus, the degrees of nodes are relatively uniform and the network’s assortativity coefficient is higher.


## 4.3. Simulation of Degree Correlation of Nodes

Figure3 shows the comparison of simulated and theoretical results of degree correlation under different parameters when N = 5000 (L is approximated using its expected value). It can be seen that the actual simulation results were basically fit with theoretically derived results.Figure 3
Comparison of simulated and theoretical mean degree of adjacent nodes at (a)q=2 and F=3 and (b) q=4 and F=3.
(a)(b)


## 5. Conclusions

In this paper, we have considered the problem of assortativity in networks. Assortativity has a long history of study; however, little research investigated its formation by considering cultural traits of nodes. To fill the gap, this study established an assortative social network using two underlying mechanisms, i.e., preferential attachment and culture traits. Results indicated that the assortativity of a network was reduced due to the hubs formed by the preferential attachment mechanism. Such conclusion is in line with Newman [1]. Meanwhile, the higher the selection probability of culture trait-matching mechanism, the higher the assortativity of a network is. Hence, it is conclude that, to some extent, cultural similarity of nods formats assortativity in networks.To further analyze the assortativity in detail, this study theoretically investigated the degree correlation of nodes. A conclusion was drawn that node degree presented a positive logarithmic correlation with the mean degree of adjacent nodes. Further, the actual simulation results were fitted with theoretically derived results. Therefore, it is considered that the introduction of a cultural trait-matching mechanism interpreted the formation mechanism of network assortativity. This study is valuable with regards to two aspects. On the one hand, our conclusions can be used to explain the origin of assortativity in social networks. Although it has been a common knowledge that preferential attachment is one of core mechanisms underlying building networks [7, 8], in the context of network assortativity, such mechanism functions negatively. Instead, cultural similarity forms the backbone of breeding assortativity. Hence, it is appropriate to interpret assortativity from a sociological perspective.On the other hand, from the point view of cultural characteristics of nodes, the established network model effectively reflects the characteristics of real-life networks. The model is computationally efficient, with using the Monte Carlo simulation method, which puts applications to more social networks. The present study thus contributes to literature on assortativity by introducing a cultural trait-matching mechanism.This study is not without its limitations. First, we only account for assortativity by degree of the nodes in social networks. Assortativity has, however, been applied to other topology-related characteristics of nodes as well, such as coreness, node betweenness, and node weight [6]. Second, we have here considered only the cultural traits of nodes, neglecting other sociology-related characteristics of nodes, e.g., race, gender, and age. Future research may generalize our method by taking account of more topology-related and sociology-related features of nodes. Third, we only investigate assortativity in the context of scale-free networks. The small average distance and large clustering coefficients of small-world networks also affect the formation of assortativity [12]. Future research could discuss this topic to extend the study of assortativity.



---

*Source: 1873796-2020-12-07.xml*