# Analysis and Research of Key Genes in Gene Expression Network Based on Complex Network

Authors: Guobin Chen; Jun Qi; Chao Tang; Ying Wang; Yongzhong Wu; Xiaolong Shi
Journal: Complexity
 (2020)

---

## Abstract

Gene expression network is also a type of complex network. It is challenging to analyze the gene expression network through relevant knowledge and algorithms of a complex network. In this paper, the existing characteristics of genes are analyzed from various indexes of the gene expression network to analyze key genes and TOP genes. Firstly, gene chip data are screened, gene data with obvious characteristics are selected, and relevant clustering characteristics are analyzed. Then, the complex gene network structure is established, and gene networks with different threshold shapes and different sizes are selected. Finally, the relevant indexes and PR values after the PageRank algorithm are analyzed for complex networks under different thresholds, thus establishing the TOP gene and PR sequence.


---

## Body

## 1. Introduction

With the development of gene chip and second-generation sequencing and the emergence of new technologies, the analysis of the human genetic structure has become a reality, the association information between genes is analyzed, being able to express genes related to key genes, and it is possible to analyze the correlation between genes and diseases more effectively. Establishing a biological network can obviously discover and analyze the correlation and influence between expression elements in various biological systems. It makes it possible to study the characteristics of organisms at a certain level [1]. Unlike the research on inherent single molecules, the information at the whole system level can be displayed by establishing networks.At present, molecular biology network analysis tools in this field mainly include metabolic network [2], protein-protein interaction network [3], gene coexpression network [4], gene regulatory network [5], and signal transmission network [6]. In order to expand the scope and depth of the current research, the transition from a single molecule to a network system level becomes the next major development direction of interactive networks because of, in general, the complex biological phenomena and pathology that cannot be caused by only one factor. Therefore, as a tool to explore complex pathological and life phenomena, the interactive network provides an effective analysis method, to perfect the comprehensive research. These networks have great research value, among them; the gene coexpression network has irreplaceable research characteristics in some aspects. Whether the amount of gene expression can establish the correlation of related diseases, the expression network can establish the complex network, and it is challenging to analyze the gene correlation with the related technologies of the complex network.


## 2. Related Works

The reconstruction algorithm of the gene regulatory network and the exploration of a series of related models began in the middle of the 20th century. Raterproposed the system and characteristics to control the interaction and interaction between all genes in prokaryotic cells exploring the mutual influences and interactions between genes in prokaryotic cells, as well as system relationships and characteristics. In 1969, Kauffman discovered and described the exploration research with epoch-making significance, using popular binary logic rules to stipulate the basic construction model and reconstruction algorithm of gene network [7–9]. D’Haeseleer et al. [10] were the first to use ordinary differential equations to do some research on time series data. Gardner et al. [11] were the first to prove that, by using their multivariate regression network identification (NIR) algorithm, the steady state measurements can be used to infer the network structure. They studied a data set, overexpression of specific genes in bacterial models with plasmids, when the gene expression level reaches a new steady state value, using its measured values. This method has been suggested for transcriptase data sets including siRNA knockout experiments [12]. In the past decades, numerous computational methods have been proposed to infer gene regulatory networks. These methods can be roughly divided into coexpression-based methods [13], supervised learning method [14], the model-based method [15], and the information theory-based method [16, 17] with lower computational complexity. However, direct correlation and model system dynamics cannot be inferred. Based on the supervised learning method, we mainly use the known rules to infer gene regulatory networks on genome-wide data, such as SEREND [14], GENIES [15], and SIRENE [18], but all need additional information of regulatory relationships to cultivate models. By guiding reasoning from prior information of known rules, we can achieve higher accuracy and be superior to many other methods.Constructing complex gene expression networks and using large-scale gene expression data sets for network analysis are effective methods to reveal new biological knowledge. However, methods for gene association in the construction of these coexpression networks have not been thoroughly evaluated. Because different methods lead to different coexpression networks with different structures and provide different information, it is very important to select the best gene association method. Zhang et al. [19] proposed the identification of protein complexes in protein interaction network (IPC-RPIN), which effectively fused topological structure, gene expression profile, and GO functional annotation information to achieve gene-protein expression complex. Hua et al. [20] proposed the fusion research of three commonly used reasoning algorithms to establish a genome-scale and high-quality gene coexpression network. After applying this expression network to monocotyledonous plant rice, the network quality has been verified and evaluated through the selected gene function association data sets, which is obviously superior to other methods. Li et al. [21] predicted subcellular location information by integrating time-history gene expression data with the spatial and temporal active protein interaction network (ST-APIN). In order to evaluate the efficiency of the proposed method, the commonly used classical clustering algorithm has obvious advantages in identifying protein complexes in ST-APIN and the other three dynamic PIN.


## 3. Technical Indicators Related to Complex Networks

### 3.1. Gene Degree

Degree is an important index to describe the attributes of nodes. The degree of nodes refers to the measurement that genes are associated with genes. In directed complex networks, the degree of nodes can be divided into exit degree and entry degree, which indicates the number of genes pointing to other genes and the number of other genes pointing to the gene. The average degree of a complex network reflects the density program of the network, and the degree distribution can describe the importance of different genes through the number of genes and gene connections. When the scale of gene expression network is very large, the degree distribution of genes can fully display the distribution law of genes and can identify and distribute different types of networks.The distribution of gene complex network degree is described as follows:(A)
Gene distribution functionPx: It indicates the proportion of gene x in the gene expression network in the whole expression network.(B)
Cumulative degree distribution functionPx: The Px description degree is not less than the probability distribution of gene x, and the distribution function is as follows:(1)Px=∑k=x∞Pk.If the gene degree of the gene expression complex network obeys the distribution functionPx∞k−γ of the power index γ, it is said that the gene complex network obeys the scale-free network of power-law distribution, while the accumulation degree distribution function Px obeys the power-law distribution Px∞x1−γof power γ−1.


### 3.2. Gene Network Density

Gene network densitydG is used to describe the density of connection edges between genes in the gene network and is defined as the ratio of the actual number of gene connections in the gene network to the upper limit of the number of gene connections that can be accommodated. Dense programs and dynamic evolution laws used to measure the relationship between gene expression networks in gene complex networks. There are N gene nodes and L edges in the gene complex network, and the density formula (2) of the gene complex network is defined as follows:(2)dG=2LNN−1.The density range of the gene complex network is [0, 1]. WhendG=1, the network is all connected. When dG=0, there are no connections in the network. In the actual gene network, the network with density 1 does not exist. In most networks, it is around 0.5. The density of large-scale networks is smaller than that of small-scale networks, and the density of networks of different sizes cannot be directly compared. The absolute density formula (3) can be used to compare the network densities of different sizes:(3)dG=M∗3D4SR3.In the above,D represents the diameter of the network, R represents the radius, and S represents the circumference of the network.


### 3.3. Aggregation Coefficient of Gene Network

Gene network clustering coefficient is used to describe the degree of node neighbors associated with gene nodes in a gene network. In the gene network, the nodevi and the gene network aggregation coefficient Ci represent the probability of interconnection with its adjacent gene nodes. ki is used to represent the number of neighbors interconnected by gene nodes vi, and ei is used to represent the number of interconnected neighbors existing in ki. kiki−1/2 represents the maximum number of interconnections, and equation (4) represents the aggregation coefficient of gene node vi:(4)Ci=2eikiki−1.The aggregation coefficient of gene nodes is vividly described in the gene complex network, which can be understood as the correlation between one gene node and another gene node, the probability of connection between this gene node and the neighbor of another gene also exists, and the probability comparison of correlation exists, so it has strong aggregation in the gene complex network. The aggregation of the whole gene network is evaluated by the average aggregation coefficient. The average aggregation coefficient of the gene complex network is defined as the average aggregation coefficient of all gene nodes in the gene network. Equation (5) is described as follows:(5)C=∑i∈viCiV,where V represents the number of gene nodes, Ci represents the aggregation coefficient of gene node vi, and its value range is [0, 1]. When C=0, there are no connected gene nodes in the gene network; whenC=1, the gene network node is all connected.The average aggregation coefficient in the gene expression network describes the probability of connection between any associated genes in the gene network and reflects the closeness of the node relationship of the whole gene.


## 3.1. Gene Degree

Degree is an important index to describe the attributes of nodes. The degree of nodes refers to the measurement that genes are associated with genes. In directed complex networks, the degree of nodes can be divided into exit degree and entry degree, which indicates the number of genes pointing to other genes and the number of other genes pointing to the gene. The average degree of a complex network reflects the density program of the network, and the degree distribution can describe the importance of different genes through the number of genes and gene connections. When the scale of gene expression network is very large, the degree distribution of genes can fully display the distribution law of genes and can identify and distribute different types of networks.The distribution of gene complex network degree is described as follows:(A)
Gene distribution functionPx: It indicates the proportion of gene x in the gene expression network in the whole expression network.(B)
Cumulative degree distribution functionPx: The Px description degree is not less than the probability distribution of gene x, and the distribution function is as follows:(1)Px=∑k=x∞Pk.If the gene degree of the gene expression complex network obeys the distribution functionPx∞k−γ of the power index γ, it is said that the gene complex network obeys the scale-free network of power-law distribution, while the accumulation degree distribution function Px obeys the power-law distribution Px∞x1−γof power γ−1.


## 3.2. Gene Network Density

Gene network densitydG is used to describe the density of connection edges between genes in the gene network and is defined as the ratio of the actual number of gene connections in the gene network to the upper limit of the number of gene connections that can be accommodated. Dense programs and dynamic evolution laws used to measure the relationship between gene expression networks in gene complex networks. There are N gene nodes and L edges in the gene complex network, and the density formula (2) of the gene complex network is defined as follows:(2)dG=2LNN−1.The density range of the gene complex network is [0, 1]. WhendG=1, the network is all connected. When dG=0, there are no connections in the network. In the actual gene network, the network with density 1 does not exist. In most networks, it is around 0.5. The density of large-scale networks is smaller than that of small-scale networks, and the density of networks of different sizes cannot be directly compared. The absolute density formula (3) can be used to compare the network densities of different sizes:(3)dG=M∗3D4SR3.In the above,D represents the diameter of the network, R represents the radius, and S represents the circumference of the network.


## 3.3. Aggregation Coefficient of Gene Network

Gene network clustering coefficient is used to describe the degree of node neighbors associated with gene nodes in a gene network. In the gene network, the nodevi and the gene network aggregation coefficient Ci represent the probability of interconnection with its adjacent gene nodes. ki is used to represent the number of neighbors interconnected by gene nodes vi, and ei is used to represent the number of interconnected neighbors existing in ki. kiki−1/2 represents the maximum number of interconnections, and equation (4) represents the aggregation coefficient of gene node vi:(4)Ci=2eikiki−1.The aggregation coefficient of gene nodes is vividly described in the gene complex network, which can be understood as the correlation between one gene node and another gene node, the probability of connection between this gene node and the neighbor of another gene also exists, and the probability comparison of correlation exists, so it has strong aggregation in the gene complex network. The aggregation of the whole gene network is evaluated by the average aggregation coefficient. The average aggregation coefficient of the gene complex network is defined as the average aggregation coefficient of all gene nodes in the gene network. Equation (5) is described as follows:(5)C=∑i∈viCiV,where V represents the number of gene nodes, Ci represents the aggregation coefficient of gene node vi, and its value range is [0, 1]. When C=0, there are no connected gene nodes in the gene network; whenC=1, the gene network node is all connected.The average aggregation coefficient in the gene expression network describes the probability of connection between any associated genes in the gene network and reflects the closeness of the node relationship of the whole gene.


## 4. Key Gene Determination Method Based on PageRank Algorithm

### 4.1. Construction of Complex Network for Gene Expression

Gene chip expression matrix reflects different gene expression levels of different sequencing samples, which can be described byn×mmatrix, where Xnm represents the expression level of the nth gene in m samples:(6)X=x11x12...x1mx21x22...x2m............xn1xn2...xnm=X1X2...Xn.In this paper, the WGCNA algorithm [22] is used to construct the gene expression network. The WGCNA algorithm is based on a scale-free network. Whether there is a correlation between the two genes can be expressed by the correlation coefficient, forming the following formula:(7)Mij=corXi,Xj,Mij represents the similarity of gene i and gene j in the expression amount of samples in the chip and M represents the similarity matrix in [0, 1]. In the construction of the gene expression matrix, the similarity is calculated through the expression of different genes in all samples. The similarity is an important measurement index to measure the strength between genes and is also the basis for the construction of complex networks. In the WGCNA algorithm, Sij is measured by weighting using a soft threshold, andβ is used to represent the soft threshold, while the general network structure adopts a hard threshold. The gene expression network using a soft threshold is more prominent, and its strong correlation is more prominent. Equation (8) is as follows:(8)Mij=corXi,Xjβ.The weighting coefficient is defined according to scale network, and the correlation betweenlogk of network node number K and logpk of node occurrence probability in a scale-free network is required to reach more than 0.8. Considering the correlation between genes and genes, the correlation between the individual genes and genes is expressed by the adjacency matrix, and topological overlap measure (TOM) is expressed by the strong relationship between genes and genes:(9)TOM=∑k≠ijMikMkj+Mijmin∑kMik+∑kMjk+1−Mij.Then, set the correlation thresholdλ (generally referring to the hard threshold) and compare it with the value of TOM matrix. If the matrix value in TOM is greater than λ, it indicates that there is a correlation between gene i and gene j (which can be expressed by adjacency matrix MJij=1). If the matrix value in TOM is less than λ, it means that there is no correlation between gene i and gene j (which can be expressed by adjacency matrix MJij=0). The generation of gene coexpression network according to the above principles is also the basis of this study and provides the basic conditions for analyzing core genes.


### 4.2. Convergence of PageRank Algorithm

In the complex network of genes, there is a correlation between each gene and the genes related to it, but the influence of genes related to genes should also be considered. Through the correlation between genes, the PageRank algorithm is used to realize this correlation between genes, thus determining key genes.Feature vector centrality and its variants are widely used. For example, the most famous PageRank algorithm [23] in the field of web page sorting is the core algorithm of Google search engine. At the initial time, each gene is given the same PR value, and then iteration is carried out, and the current PR value of each gene is divided equally to all genes it points to in each step. The new PR value of each gene is the sum of the PR values it obtains, so that the PR value of the node Pi at time t is defined as the following equation:(10)PRit=∑j=1naijPRjt−1kjout,where kjout is the output of node Pi, aij gene expresses the initial matrix of the correlation network, and PR iterates until the value of each node reaches stability.The PageRank algorithm is applied in many fields. Through continuous iteration, a relatively stable value is reached. As the number of iterations increases, the errorε of the values generated before and after is expressed. When a reasonable error value ε is reached, the PageRank algorithm ends, as expressed by the following equation:(11)PRit−PRit−1<ε.Theoretically,ε is determined according to the user’s experimental results. When the error comparison is required to be small, e comparison is set. When i− > o, e = 0.The relevant literature of the PageRank algorithm does not give the relevant convergence proof process, only the iterative process is used to explain its convergence, and no relevant mathematical methods are used to explain it. The following author gives the relevant proof process.Theorem 1.
If the sum of the values of all columns of a gene correlation matrix is 1, then the matrix is a convergence matrix.
Proof: LetPRt=PR1t,PR2t,…,PRnt′(12)M=a11k1outa12k2out…a1nknouta21k1outa22k2out…a2nknout⋮⋮⋮⋮an1k1outan2k2out…annknout,PRt=M∗PRt−1,=>PRit=Mt∗PR1,in which∑i=1nPRit=1; it is sufficient to prove that Mtin formula (12) converges.
LetM=m11m12…m12m21m21…m21⋮⋮⋮⋮mn1mn1…mn1. The eigenvalue of M is Λ=λ10…00λ2…0⋮⋮⋮⋮00…λn,(13)M=P∗Λ∗P−1⇒Mt=P∗Λt∗P−1,in which the sum of each column is 1 andmii=0, which is proved−1≤λi≤1.
According to the disk theorem,M=mij has N disks whose N eigenvalues all fall on the plane:(14)DiM=λiλi−mii≤Ri,i=1,2,…,n,in whichλi∈∪i=1nDiM,Ri=∑j=1andj≠inmij.
In the matrixM, N disks of M given according to equation (14) are(15)DiM=λiλi≤1,i=1,2,…,n.
TheN eigenvalues of M′ all fall in the union set of n disks on the complex plane. The disk eigenvalues are seen as shown in Figure 1.
Therefore, whenm = t is a convergence matrix, the proof is complete.
λi is in the white disk of Figure 1; we can look at N eigenvalues λi≤1 of M′, according to equation (13).
Mt=P∗λ1t0…00λ2t…0⋮⋮⋮⋮00…λnt∗P−1 , where t⟶∞,λit∈−1,0,1, so that(16)limt⟶∞Mt=P∗limt⟶∞λ1t0…00limt⟶∞λ2t…0⋮⋮⋮⋮00…limt⟶∞λnt∗P−1,=>limt⟶∞Mt⇒P∗10…000…0⋮⋮⋮⋮00…−1∗P−1.
Therefore, whenlimt⟶∞Mt is a convergence matrix, the proof is complete.Figure 1
Disk eigenvalues.


### 4.3. Disk Analysis of Improved PageRank Algorithm

The above PageRank algorithm is based on the traditional method to prove convergence. Because the traditionalβl PageRank algorithm does not satisfy the characteristics of strong connectivity and traps, that is, some web pages do not have links and loops pointing to other web pages, there are links pointing to them or links not pointing to other web pages. The improved PageRank algorithm is(17)A=α∗M+1−α∗1NN∗N.M satisfies the normalized matrix of the traditional PageRank algorithm. After β takes 0.8, the form of A matrix is as follows:(18)A=0.2∗1N0.8∗m12+0.2∗1N…0.8∗m12+0.2∗1N0.8∗m21+0.2∗1N0.2∗1N…0.8∗m21+0.2∗1N⋮⋮⋮⋮0.8∗mn1+0.2∗1N0.8∗mn1+0.2∗1N…0.2∗1N.At this time, the convergence of matrixA is proved with 0.2∗1/N as the center of the circle, as shown in Figure 2.Figure 2
PageRank disk.As can be seen from Figure2, the center of the improved PageRank algorithm is 0.2×1/N, and the radius is 0.8+0.2×N−1/N or 1−0.2×1/N, so that the disk can pass through the point of 1, but the disk does not pass through the point of −1, so the maximum eigenvalue of the improved PageRank transfer matrix takes 1 and the minimum value cannot take −1. Therefore, when t⟶∞,λit∈0,1 is easier to converge.


### 4.4. Calculation of PR Value Whent⟶∞

Through the above proof, the PageRank algorithm is convergent. How to find the PR value is a problem studied by many scholars, especially in the improved PageRank algorithm, there are a large amount of literature, and some scholars have done relevant work on how to quickly find the PR value and accelerate convergence. This section proposes a PR value calculation method whent⟶∞. When t⟶∞, the PR value is the actual value. Iterative calculation of the PR value through other PageRank algorithms is an approximate value. The accuracy cannot be compared with the PR value when t⟶∞. The following calculation process is given. The formula of the PageRank algorithm is as follows:(19)RN=M∗RN−1.LetRN−RN−1<=ε , when limN⟶∞ε=0 , RN=RN−1, the formula became(20)R1,R2,R3,…,Rn′=a11…a1n⋮⋱⋮an1…ann∗R1,R2,R3,…,Rn′.Namely,(21)0+a12∗R2+a13∗R3+⋯+a1n∗Rn=R11,a21∗R1+0+a23∗R3+⋯+a2n∗Rn=R22,⋮an1∗R1+an2∗R2+an3∗R3+⋯+0=Rnn.Theorem 2.
Whent⟶∞ , the polynomials 1,2,3,…,n are linearly correlated.Proof.
The sum of the formern−1, 1+2+⋯+n−1=a21+a31+⋯+an−11∗R1+a12+a32+⋯+an−12∗R2+a13+a23+⋯+an−13∗R3+⋯+a1n+a2n+⋯+an−1n∗Rn=R1+R2+⋯+Rn−1.
When∑j=1naji=1,(22)⇒1−an1∗R1+1−an2∗R2+1−an3∗R3+⋯+1−0∗Rn=R1+R2+⋯+Rn−1⇒R1+R2⋯+Rn−an1∗R1−an2∗R2−an3∗R3⋯−ann−1∗Rn−1=R1+R2+⋯Rn−1⇒an1∗R1+an2∗R2+an3∗R3+⋯+ann−1∗Rn−1=Rnn.
From the above, it can be seen that polynomial1+2+3⋯+n−1=n holds, and it is deduced that any N−1 correlation is equal to another term, so the above polynomial is linearly correlated.Theorem 3.
Whent⟶∞, polynomials 1,2,3,…,n−1 are linearly independent.Proof.
Assume thatk1,k2,…,kn−2 makes the firstn−2 term represent the n−1 term; that is,(23)k1∗1+k2∗2⋯+kn−2∗n−2=n−1.
According to Theorem1, it is concluded that 1+2⋯+n−2+n=n−1 is equal on both sides:(24)k1∗1+k2∗2⋯+kn−2∗n−2=1+2⋯+n−2+n⇒k1−1∗1+k2−1∗2…+kn−2−1∗n−2=n.
According to Theorem1, it is concluded that 1+2⋯+n−2+n−1=n is equal on both sides:(25)⇒k1−1∗1+k2−1∗2⋯+kn−2−1∗n−2=1+2⋯+n−2+n−1⇒k1−2∗1+k2−2∗2⋯+kn−2−2∗n−2=n−1,n equal to equation (11).(26)⇒1+2⋯+n−2+n−2=0.
According to Theorem1, the conclusion is 1+2⋯+n−2+n−1=n=>n−1=n.
Similarly, it is possible to obtain that all multiple terms are equal, which is contradictory to the problem, so1,2,3,…,n−1 are linearly independent.
According to the properties of the PageRank algorithm,R1+R2+R3+⋯+Rn=1 takes any polynomial n−1 term and combines it with the above:(27)−R1+a12∗R2+a13∗R3+⋯+a1n∗Rn=01a21∗R1−R2+a23∗R3+⋯+a2n∗Rn=02⋮R1+R2+R3+⋯+Rn=1n.
Aftern terms are added, the above N terms are linearly independent. Equation (27) can be transformed into(28)A′∗R=−1a12…a1na21−1…a2n⋮⋮⋮⋮11…1∗R1R2R3,…,Rn′=000…1′.
A′ matrix is reversible, and the value of R is(29)R1R2R3,…,Rn′=A′−1∗000…1′.


## 4.1. Construction of Complex Network for Gene Expression

Gene chip expression matrix reflects different gene expression levels of different sequencing samples, which can be described byn×mmatrix, where Xnm represents the expression level of the nth gene in m samples:(6)X=x11x12...x1mx21x22...x2m............xn1xn2...xnm=X1X2...Xn.In this paper, the WGCNA algorithm [22] is used to construct the gene expression network. The WGCNA algorithm is based on a scale-free network. Whether there is a correlation between the two genes can be expressed by the correlation coefficient, forming the following formula:(7)Mij=corXi,Xj,Mij represents the similarity of gene i and gene j in the expression amount of samples in the chip and M represents the similarity matrix in [0, 1]. In the construction of the gene expression matrix, the similarity is calculated through the expression of different genes in all samples. The similarity is an important measurement index to measure the strength between genes and is also the basis for the construction of complex networks. In the WGCNA algorithm, Sij is measured by weighting using a soft threshold, andβ is used to represent the soft threshold, while the general network structure adopts a hard threshold. The gene expression network using a soft threshold is more prominent, and its strong correlation is more prominent. Equation (8) is as follows:(8)Mij=corXi,Xjβ.The weighting coefficient is defined according to scale network, and the correlation betweenlogk of network node number K and logpk of node occurrence probability in a scale-free network is required to reach more than 0.8. Considering the correlation between genes and genes, the correlation between the individual genes and genes is expressed by the adjacency matrix, and topological overlap measure (TOM) is expressed by the strong relationship between genes and genes:(9)TOM=∑k≠ijMikMkj+Mijmin∑kMik+∑kMjk+1−Mij.Then, set the correlation thresholdλ (generally referring to the hard threshold) and compare it with the value of TOM matrix. If the matrix value in TOM is greater than λ, it indicates that there is a correlation between gene i and gene j (which can be expressed by adjacency matrix MJij=1). If the matrix value in TOM is less than λ, it means that there is no correlation between gene i and gene j (which can be expressed by adjacency matrix MJij=0). The generation of gene coexpression network according to the above principles is also the basis of this study and provides the basic conditions for analyzing core genes.


## 4.2. Convergence of PageRank Algorithm

In the complex network of genes, there is a correlation between each gene and the genes related to it, but the influence of genes related to genes should also be considered. Through the correlation between genes, the PageRank algorithm is used to realize this correlation between genes, thus determining key genes.Feature vector centrality and its variants are widely used. For example, the most famous PageRank algorithm [23] in the field of web page sorting is the core algorithm of Google search engine. At the initial time, each gene is given the same PR value, and then iteration is carried out, and the current PR value of each gene is divided equally to all genes it points to in each step. The new PR value of each gene is the sum of the PR values it obtains, so that the PR value of the node Pi at time t is defined as the following equation:(10)PRit=∑j=1naijPRjt−1kjout,where kjout is the output of node Pi, aij gene expresses the initial matrix of the correlation network, and PR iterates until the value of each node reaches stability.The PageRank algorithm is applied in many fields. Through continuous iteration, a relatively stable value is reached. As the number of iterations increases, the errorε of the values generated before and after is expressed. When a reasonable error value ε is reached, the PageRank algorithm ends, as expressed by the following equation:(11)PRit−PRit−1<ε.Theoretically,ε is determined according to the user’s experimental results. When the error comparison is required to be small, e comparison is set. When i− > o, e = 0.The relevant literature of the PageRank algorithm does not give the relevant convergence proof process, only the iterative process is used to explain its convergence, and no relevant mathematical methods are used to explain it. The following author gives the relevant proof process.Theorem 1.
If the sum of the values of all columns of a gene correlation matrix is 1, then the matrix is a convergence matrix.
Proof: LetPRt=PR1t,PR2t,…,PRnt′(12)M=a11k1outa12k2out…a1nknouta21k1outa22k2out…a2nknout⋮⋮⋮⋮an1k1outan2k2out…annknout,PRt=M∗PRt−1,=>PRit=Mt∗PR1,in which∑i=1nPRit=1; it is sufficient to prove that Mtin formula (12) converges.
LetM=m11m12…m12m21m21…m21⋮⋮⋮⋮mn1mn1…mn1. The eigenvalue of M is Λ=λ10…00λ2…0⋮⋮⋮⋮00…λn,(13)M=P∗Λ∗P−1⇒Mt=P∗Λt∗P−1,in which the sum of each column is 1 andmii=0, which is proved−1≤λi≤1.
According to the disk theorem,M=mij has N disks whose N eigenvalues all fall on the plane:(14)DiM=λiλi−mii≤Ri,i=1,2,…,n,in whichλi∈∪i=1nDiM,Ri=∑j=1andj≠inmij.
In the matrixM, N disks of M given according to equation (14) are(15)DiM=λiλi≤1,i=1,2,…,n.
TheN eigenvalues of M′ all fall in the union set of n disks on the complex plane. The disk eigenvalues are seen as shown in Figure 1.
Therefore, whenm = t is a convergence matrix, the proof is complete.
λi is in the white disk of Figure 1; we can look at N eigenvalues λi≤1 of M′, according to equation (13).
Mt=P∗λ1t0…00λ2t…0⋮⋮⋮⋮00…λnt∗P−1 , where t⟶∞,λit∈−1,0,1, so that(16)limt⟶∞Mt=P∗limt⟶∞λ1t0…00limt⟶∞λ2t…0⋮⋮⋮⋮00…limt⟶∞λnt∗P−1,=>limt⟶∞Mt⇒P∗10…000…0⋮⋮⋮⋮00…−1∗P−1.
Therefore, whenlimt⟶∞Mt is a convergence matrix, the proof is complete.Figure 1
Disk eigenvalues.


## 4.3. Disk Analysis of Improved PageRank Algorithm

The above PageRank algorithm is based on the traditional method to prove convergence. Because the traditionalβl PageRank algorithm does not satisfy the characteristics of strong connectivity and traps, that is, some web pages do not have links and loops pointing to other web pages, there are links pointing to them or links not pointing to other web pages. The improved PageRank algorithm is(17)A=α∗M+1−α∗1NN∗N.M satisfies the normalized matrix of the traditional PageRank algorithm. After β takes 0.8, the form of A matrix is as follows:(18)A=0.2∗1N0.8∗m12+0.2∗1N…0.8∗m12+0.2∗1N0.8∗m21+0.2∗1N0.2∗1N…0.8∗m21+0.2∗1N⋮⋮⋮⋮0.8∗mn1+0.2∗1N0.8∗mn1+0.2∗1N…0.2∗1N.At this time, the convergence of matrixA is proved with 0.2∗1/N as the center of the circle, as shown in Figure 2.Figure 2
PageRank disk.As can be seen from Figure2, the center of the improved PageRank algorithm is 0.2×1/N, and the radius is 0.8+0.2×N−1/N or 1−0.2×1/N, so that the disk can pass through the point of 1, but the disk does not pass through the point of −1, so the maximum eigenvalue of the improved PageRank transfer matrix takes 1 and the minimum value cannot take −1. Therefore, when t⟶∞,λit∈0,1 is easier to converge.


## 4.4. Calculation of PR Value Whent⟶∞

Through the above proof, the PageRank algorithm is convergent. How to find the PR value is a problem studied by many scholars, especially in the improved PageRank algorithm, there are a large amount of literature, and some scholars have done relevant work on how to quickly find the PR value and accelerate convergence. This section proposes a PR value calculation method whent⟶∞. When t⟶∞, the PR value is the actual value. Iterative calculation of the PR value through other PageRank algorithms is an approximate value. The accuracy cannot be compared with the PR value when t⟶∞. The following calculation process is given. The formula of the PageRank algorithm is as follows:(19)RN=M∗RN−1.LetRN−RN−1<=ε , when limN⟶∞ε=0 , RN=RN−1, the formula became(20)R1,R2,R3,…,Rn′=a11…a1n⋮⋱⋮an1…ann∗R1,R2,R3,…,Rn′.Namely,(21)0+a12∗R2+a13∗R3+⋯+a1n∗Rn=R11,a21∗R1+0+a23∗R3+⋯+a2n∗Rn=R22,⋮an1∗R1+an2∗R2+an3∗R3+⋯+0=Rnn.Theorem 2.
Whent⟶∞ , the polynomials 1,2,3,…,n are linearly correlated.Proof.
The sum of the formern−1, 1+2+⋯+n−1=a21+a31+⋯+an−11∗R1+a12+a32+⋯+an−12∗R2+a13+a23+⋯+an−13∗R3+⋯+a1n+a2n+⋯+an−1n∗Rn=R1+R2+⋯+Rn−1.
When∑j=1naji=1,(22)⇒1−an1∗R1+1−an2∗R2+1−an3∗R3+⋯+1−0∗Rn=R1+R2+⋯+Rn−1⇒R1+R2⋯+Rn−an1∗R1−an2∗R2−an3∗R3⋯−ann−1∗Rn−1=R1+R2+⋯Rn−1⇒an1∗R1+an2∗R2+an3∗R3+⋯+ann−1∗Rn−1=Rnn.
From the above, it can be seen that polynomial1+2+3⋯+n−1=n holds, and it is deduced that any N−1 correlation is equal to another term, so the above polynomial is linearly correlated.Theorem 3.
Whent⟶∞, polynomials 1,2,3,…,n−1 are linearly independent.Proof.
Assume thatk1,k2,…,kn−2 makes the firstn−2 term represent the n−1 term; that is,(23)k1∗1+k2∗2⋯+kn−2∗n−2=n−1.
According to Theorem1, it is concluded that 1+2⋯+n−2+n=n−1 is equal on both sides:(24)k1∗1+k2∗2⋯+kn−2∗n−2=1+2⋯+n−2+n⇒k1−1∗1+k2−1∗2…+kn−2−1∗n−2=n.
According to Theorem1, it is concluded that 1+2⋯+n−2+n−1=n is equal on both sides:(25)⇒k1−1∗1+k2−1∗2⋯+kn−2−1∗n−2=1+2⋯+n−2+n−1⇒k1−2∗1+k2−2∗2⋯+kn−2−2∗n−2=n−1,n equal to equation (11).(26)⇒1+2⋯+n−2+n−2=0.
According to Theorem1, the conclusion is 1+2⋯+n−2+n−1=n=>n−1=n.
Similarly, it is possible to obtain that all multiple terms are equal, which is contradictory to the problem, so1,2,3,…,n−1 are linearly independent.
According to the properties of the PageRank algorithm,R1+R2+R3+⋯+Rn=1 takes any polynomial n−1 term and combines it with the above:(27)−R1+a12∗R2+a13∗R3+⋯+a1n∗Rn=01a21∗R1−R2+a23∗R3+⋯+a2n∗Rn=02⋮R1+R2+R3+⋯+Rn=1n.
Aftern terms are added, the above N terms are linearly independent. Equation (27) can be transformed into(28)A′∗R=−1a12…a1na21−1…a2n⋮⋮⋮⋮11…1∗R1R2R3,…,Rn′=000…1′.
A′ matrix is reversible, and the value of R is(29)R1R2R3,…,Rn′=A′−1∗000…1′.


## 5. Experimental Analysis

### 5.1. Data Selection

The SVM-REF algorithm was used to select 2105 genes and 265 samples (198 TNBC, 67 no-TNBC). By establishing decision trees, we can see the distribution of decision trees under 2105 genes for each sample, as shown in Figure3.Figure 3
Decision tree for sample data.As can be seen from Figure3, GSM1974605 has outliers under 2105 genes, and the GSM1974605 sample can be deleted. After deleting outlier samples, it can be seen that they are roughly divided into two categories, and the distinction is obvious, indicating that 2105 gene selection is reasonably classified under 197 samples.Selecting soft threshold B plays a very important role in forming TOM gene association matrix. In this paper, the optimal threshold is obtained through continuous iteration of the threshold. Since the scale-free network atlas structure can reach 0.8 or the average connectivity can reach below 100 whenβ<15, if the above requirements cannot be met, the experimental results will be greatly affected. Figure 4 is the distribution diagram of the threshold value and average connectivity.Figure 4
Distribution of threshold and average connectivity.As can be seen from Figure4, at that time, the network map structure could reach more than 0.9, indicating that the threshold value of this interval is ideal and the optimal value is the most 8. However, the average connectivity is less than 100 at 3, so β=8 meets the requirements of the above conditions.The TOM matrix is established. The TOM matrix is an index value representing the correlation between genes and is converted into a connection matrix through the TOM matrix. The relevant thresholds of TOM matrix are screened and the thresholds are introduced to form different complex gene networks after continuous changes. As that threshold value = 0. 2186, a complex network of gene is shown in Figure5; as that threshold value = 0.2664, a complex network of gene is shown in Figure 6.Figure 5
Complex network diagram of TOM gene with thresholdλ=0.2186.Figure 6
Complex network diagram of TOM gene at thresholdλ=0.2664.As can be seen from Figures5 and 6, when the threshold B increases, the complex network diagram gradually decreases, the network structure becomes smaller, and the network community will appear. Smaller outlier gene networks will also appear so as B increases to a certain value, the network structure changes from a large-scale complex network to a small-scale network structure.


### 5.2. Analysis of Complex Network Structure

The analysis of complex network structure analyzes the structural changes of the gene complex network from the indexes of centrality, aggregation coefficient, central potential, and so forth. By introducing thresholdλ to change the structure of the gene complex network, the network structure can be seen to change continuously by increasing the threshold λ, and the network changes from a large-scale structural model to a small-scale structural model. The specific effect is shown in Figures 7–10.Figure 7
Effect diagram of transitivity change after thresholdλ is increased.Figure 8
Effect diagram of density change after thresholdλ is increased.Figure 9
Effect diagram of degree centralization after thresholdλ is increased.Figure 10
Effect diagram of gene connection number change after thresholdλ is increased.From Figures7–10, it can be seen that, with the increase of λ, the structure of the gene network has changed greatly. With the increase of the performance of the network structure, the scale of the whole network is continuously decreasing, resulting in the continuous changes of various complex network parameters, the overall scale is small, and the network community is increasing, resulting in the continuous changes of key gene nodes. Then, PageRank is used to calculate network structures of different sizes, and PageRank values of genes are sorted. Under different threshold settings, the PageRank values of each gene node are shown in Tables 1–4.Table 1
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.2186 (TOP10)λ = 0.2345 (TOP10)λ = 0.2505  (TOP10)λ = 0.2664 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueTBC1D90.0056466TBC1D90.006586TBC1D90.011851BAG60.019218CDC200.0050929HDGF0.005776CDC200.010072TBC1D90.015549HDGF0.0050338CDC200.00561BAG60.010048CDC200.015447INPP4B0.0046938INPP4B0.005545HDGF0.00879VARS0.012313MLPH0.0043071MLPH0.00498MLPH0.008688GNB20.012045KLHDC10.0040236FOXM10.00452INPP4B0.00861FOXM10.011555FOXM10.0039189BAG60.004413VARS0.007983MLPH0.011512PIMREG0.0038781KLHDC10.004392FOXM10.007928TPX20.009818BAG60.0037029VARS0.004176TPX20.006754AGR30.008992AGR30.0036564AGR30.004174PIMREG0.006411HGS0.00875Table 2
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.2823 (TOP10)λ = 0.2983 (TOP10)λ = 0.3142 (TOP10)λ = 0.3301 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueBAG60.025208BAG60.0234342FOXM10.022818FOXM10.030767GNB20.022289GNB20.0219569CDC200.018771MLPH0.02873TBC1D90.017161TBC1D90.0190973AGR30.017939TPX20.028CDC200.017141MLPH0.0185887TPX20.017931CDC200.025255MLPH0.014081FOXM10.0182001GNB20.015257AGR30.016934FOXM10.014026CDC200.015556BAG60.014758UBE2C0.016034VARS0.01302TPX20.0153193MLPH0.013349RPL360.015991AGR30.012785HGS0.0137005TBC1D90.012691BAG60.015663HGS0.012107AGR30.0134952KIF230.011256KIF230.015176TPX20.010469ESR10.0094534HGS0.010413CCNA20.014671Table 3
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.3461 (TOP10)λ = 0.3620 (TOP10)λ = 0.3779 (TOP10)λ = 0.3939 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueMLPH0.030533TPX20.036319TPX20.051559TPX20.081729FOXM10.030396MLPH0.030315ZNF7210.031488KIF20A0.04712TPX20.028037FOXM10.027117CDC200.029894FOXM10.039724CDC200.024861ZNF7210.026409FOXM10.029894CDCA50.034104ZNF7210.019968CDC200.024967KIF20A0.029472NUSAP10.03389KIF230.018408KLK70.02366CDCA50.027509CDK130.030679KLK70.01789RPL360.02354CCNA20.024692ZNF7210.030679RPL360.017798KIF20A0.021769CDK130.024609HLA.G0.025PHB20.017798KIF230.021411UBE2C0.023545HLA.B0.025PUF600.017798CCNA20.021411NCAPH0.021691HLA.J0.025Table 4
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.4098 (TOP10)λ = 0.4257 (TOP10)λ = 0.4417 (TOP10)λ = 0.4576 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueTPX20.131757ZNF7210.060074CDK130.088563CDK130.097796ZNF7210.039423CDK130.057162ZNF7210.066437HLA.G0.070896CDK130.037512C9orf640.057162HLA.G0.0625HLA.B0.070896C9orf640.037512SCARF20.056231HLA.J0.0625HLA.C0.070896HLA.G0.03125LINC003040.056231HLA.E0.0625HLA.A0.070896HLA.J0.03125HLA.G0.047619HLA.B0.0625DSPP0.066667HLA.E0.03125HLA.J0.047619DSPP0.0625LINC003040.066667HLA.B0.03125HLA.E0.047619LINC003040.0625SCARF20.066667KLK70.03125HLA.A0.047619SCARF20.0625MT1G0.066667KLK80.03125HLA.C0.047619MT1G0.0625MT1HL10.066667Tables1–4 show the PR values of genes in the gene complex network under different λ values. With the continuous increase of λ, the number of genes in the gene complex network is continuously decreasing, and the expressed gene network structure is also in different states. The values of gene PR values in different networks are also constantly changing, and the ranking of gene PR values is also constantly changing. In each threshold, it is the calculation of different screening networks, which can be determined according to the size of the network or the number of genes. When the number of selected genes is large, you can choose λ = 0.2345 or λ = 0.2505. If λ is relatively small, the number of selected genes will be relatively large, and there will be more key genes. When λ is larger, the relative number is small, but the key genes are few. Therefore, when choosing, you can choose several suitable values of λ for comparison. For example, a certain gene appears in several tables consecutively.In Table1 to Table 4, several TOP gene tables are ranked by PR value, and the top gene is the key gene. The PR values are given in the table, and the sum of the PR values of all genes is 1.Figure11 shows the changes of several gene values (CDK13, DSPP, HLA.G, LINC00304, TPX2, FOXM1) and screens several genes with a higher ranking.Figure 11
Comparison of PR values of genes with different values.As can be seen from Figure11, as the λ value and PR value change continuously, the whole PR value increases continuously. As the network scale becomes smaller, the PR value of gene nodes increases continuously. Some genes become outliers because the network scale is constantly changing, and gene nodes will not have new PR values in the later screening process, resulting in PR values of 0. Therefore, different gene complex network structure models will produce different gene structures, and selecting an appropriate gene structure network will obtain different key genes.The key genes can be analyzed from the above, and the expression significance of the key genes screened will be explained by biological significance. The expression significance of some key genes is shown in Table5.Table 5
The biological significance of some key genes.
GeneThe significance of key genesCDK13Cyclin-dependent kinase (CDK) 12 and 13 are highly selective dual inhibitors that can inhibit triple-negative breast cancer (TNBC) cells. In terms of mechanism, the inhibition or loss of CDK12/CDK13 will cause the polyadenylation sites of introns to break, thereby inhibiting the expression of critical DNA damage response proteins. This causes the “BRCAness” phenotype, which leads to defects in DNA damage repair and promotes synergy with DNA-damaging chemotherapy and PARP inhibitors.TPX2TPX2 protein is highly expressed in breast cancer and has a certain correlation with the histological grade of breast cancer and lymph node metastasis. It may be a risk factor for the occurrence, development, and lymph node metastasis of breast cancer.FOXM1FOXM1 is considered as an emerging molecular target with its carcinogenic effect and 85% high overexpression characteristics in TNBC. FOXM1 occupies an important position in the gene network and is a key regulatory gene for breast cancer.There are many key genes that can be regulated, and only some are listed in Table5. Other regulated genes can be determined according to the ranking of PR values in Table 1 to Table 4.


## 5.1. Data Selection

The SVM-REF algorithm was used to select 2105 genes and 265 samples (198 TNBC, 67 no-TNBC). By establishing decision trees, we can see the distribution of decision trees under 2105 genes for each sample, as shown in Figure3.Figure 3
Decision tree for sample data.As can be seen from Figure3, GSM1974605 has outliers under 2105 genes, and the GSM1974605 sample can be deleted. After deleting outlier samples, it can be seen that they are roughly divided into two categories, and the distinction is obvious, indicating that 2105 gene selection is reasonably classified under 197 samples.Selecting soft threshold B plays a very important role in forming TOM gene association matrix. In this paper, the optimal threshold is obtained through continuous iteration of the threshold. Since the scale-free network atlas structure can reach 0.8 or the average connectivity can reach below 100 whenβ<15, if the above requirements cannot be met, the experimental results will be greatly affected. Figure 4 is the distribution diagram of the threshold value and average connectivity.Figure 4
Distribution of threshold and average connectivity.As can be seen from Figure4, at that time, the network map structure could reach more than 0.9, indicating that the threshold value of this interval is ideal and the optimal value is the most 8. However, the average connectivity is less than 100 at 3, so β=8 meets the requirements of the above conditions.The TOM matrix is established. The TOM matrix is an index value representing the correlation between genes and is converted into a connection matrix through the TOM matrix. The relevant thresholds of TOM matrix are screened and the thresholds are introduced to form different complex gene networks after continuous changes. As that threshold value = 0. 2186, a complex network of gene is shown in Figure5; as that threshold value = 0.2664, a complex network of gene is shown in Figure 6.Figure 5
Complex network diagram of TOM gene with thresholdλ=0.2186.Figure 6
Complex network diagram of TOM gene at thresholdλ=0.2664.As can be seen from Figures5 and 6, when the threshold B increases, the complex network diagram gradually decreases, the network structure becomes smaller, and the network community will appear. Smaller outlier gene networks will also appear so as B increases to a certain value, the network structure changes from a large-scale complex network to a small-scale network structure.


## 5.2. Analysis of Complex Network Structure

The analysis of complex network structure analyzes the structural changes of the gene complex network from the indexes of centrality, aggregation coefficient, central potential, and so forth. By introducing thresholdλ to change the structure of the gene complex network, the network structure can be seen to change continuously by increasing the threshold λ, and the network changes from a large-scale structural model to a small-scale structural model. The specific effect is shown in Figures 7–10.Figure 7
Effect diagram of transitivity change after thresholdλ is increased.Figure 8
Effect diagram of density change after thresholdλ is increased.Figure 9
Effect diagram of degree centralization after thresholdλ is increased.Figure 10
Effect diagram of gene connection number change after thresholdλ is increased.From Figures7–10, it can be seen that, with the increase of λ, the structure of the gene network has changed greatly. With the increase of the performance of the network structure, the scale of the whole network is continuously decreasing, resulting in the continuous changes of various complex network parameters, the overall scale is small, and the network community is increasing, resulting in the continuous changes of key gene nodes. Then, PageRank is used to calculate network structures of different sizes, and PageRank values of genes are sorted. Under different threshold settings, the PageRank values of each gene node are shown in Tables 1–4.Table 1
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.2186 (TOP10)λ = 0.2345 (TOP10)λ = 0.2505  (TOP10)λ = 0.2664 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueTBC1D90.0056466TBC1D90.006586TBC1D90.011851BAG60.019218CDC200.0050929HDGF0.005776CDC200.010072TBC1D90.015549HDGF0.0050338CDC200.00561BAG60.010048CDC200.015447INPP4B0.0046938INPP4B0.005545HDGF0.00879VARS0.012313MLPH0.0043071MLPH0.00498MLPH0.008688GNB20.012045KLHDC10.0040236FOXM10.00452INPP4B0.00861FOXM10.011555FOXM10.0039189BAG60.004413VARS0.007983MLPH0.011512PIMREG0.0038781KLHDC10.004392FOXM10.007928TPX20.009818BAG60.0037029VARS0.004176TPX20.006754AGR30.008992AGR30.0036564AGR30.004174PIMREG0.006411HGS0.00875Table 2
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.2823 (TOP10)λ = 0.2983 (TOP10)λ = 0.3142 (TOP10)λ = 0.3301 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueBAG60.025208BAG60.0234342FOXM10.022818FOXM10.030767GNB20.022289GNB20.0219569CDC200.018771MLPH0.02873TBC1D90.017161TBC1D90.0190973AGR30.017939TPX20.028CDC200.017141MLPH0.0185887TPX20.017931CDC200.025255MLPH0.014081FOXM10.0182001GNB20.015257AGR30.016934FOXM10.014026CDC200.015556BAG60.014758UBE2C0.016034VARS0.01302TPX20.0153193MLPH0.013349RPL360.015991AGR30.012785HGS0.0137005TBC1D90.012691BAG60.015663HGS0.012107AGR30.0134952KIF230.011256KIF230.015176TPX20.010469ESR10.0094534HGS0.010413CCNA20.014671Table 3
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.3461 (TOP10)λ = 0.3620 (TOP10)λ = 0.3779 (TOP10)λ = 0.3939 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueMLPH0.030533TPX20.036319TPX20.051559TPX20.081729FOXM10.030396MLPH0.030315ZNF7210.031488KIF20A0.04712TPX20.028037FOXM10.027117CDC200.029894FOXM10.039724CDC200.024861ZNF7210.026409FOXM10.029894CDCA50.034104ZNF7210.019968CDC200.024967KIF20A0.029472NUSAP10.03389KIF230.018408KLK70.02366CDCA50.027509CDK130.030679KLK70.01789RPL360.02354CCNA20.024692ZNF7210.030679RPL360.017798KIF20A0.021769CDK130.024609HLA.G0.025PHB20.017798KIF230.021411UBE2C0.023545HLA.B0.025PUF600.017798CCNA20.021411NCAPH0.021691HLA.J0.025Table 4
TOP gene and PR values with different thresholds under the PageRank algorithm.
λ = 0.4098 (TOP10)λ = 0.4257 (TOP10)λ = 0.4417 (TOP10)λ = 0.4576 (TOP10)KeyGenePR valueKeyGenePR valueKeyGenePR valueKeyGenePR valueTPX20.131757ZNF7210.060074CDK130.088563CDK130.097796ZNF7210.039423CDK130.057162ZNF7210.066437HLA.G0.070896CDK130.037512C9orf640.057162HLA.G0.0625HLA.B0.070896C9orf640.037512SCARF20.056231HLA.J0.0625HLA.C0.070896HLA.G0.03125LINC003040.056231HLA.E0.0625HLA.A0.070896HLA.J0.03125HLA.G0.047619HLA.B0.0625DSPP0.066667HLA.E0.03125HLA.J0.047619DSPP0.0625LINC003040.066667HLA.B0.03125HLA.E0.047619LINC003040.0625SCARF20.066667KLK70.03125HLA.A0.047619SCARF20.0625MT1G0.066667KLK80.03125HLA.C0.047619MT1G0.0625MT1HL10.066667Tables1–4 show the PR values of genes in the gene complex network under different λ values. With the continuous increase of λ, the number of genes in the gene complex network is continuously decreasing, and the expressed gene network structure is also in different states. The values of gene PR values in different networks are also constantly changing, and the ranking of gene PR values is also constantly changing. In each threshold, it is the calculation of different screening networks, which can be determined according to the size of the network or the number of genes. When the number of selected genes is large, you can choose λ = 0.2345 or λ = 0.2505. If λ is relatively small, the number of selected genes will be relatively large, and there will be more key genes. When λ is larger, the relative number is small, but the key genes are few. Therefore, when choosing, you can choose several suitable values of λ for comparison. For example, a certain gene appears in several tables consecutively.In Table1 to Table 4, several TOP gene tables are ranked by PR value, and the top gene is the key gene. The PR values are given in the table, and the sum of the PR values of all genes is 1.Figure11 shows the changes of several gene values (CDK13, DSPP, HLA.G, LINC00304, TPX2, FOXM1) and screens several genes with a higher ranking.Figure 11
Comparison of PR values of genes with different values.As can be seen from Figure11, as the λ value and PR value change continuously, the whole PR value increases continuously. As the network scale becomes smaller, the PR value of gene nodes increases continuously. Some genes become outliers because the network scale is constantly changing, and gene nodes will not have new PR values in the later screening process, resulting in PR values of 0. Therefore, different gene complex network structure models will produce different gene structures, and selecting an appropriate gene structure network will obtain different key genes.The key genes can be analyzed from the above, and the expression significance of the key genes screened will be explained by biological significance. The expression significance of some key genes is shown in Table5.Table 5
The biological significance of some key genes.
GeneThe significance of key genesCDK13Cyclin-dependent kinase (CDK) 12 and 13 are highly selective dual inhibitors that can inhibit triple-negative breast cancer (TNBC) cells. In terms of mechanism, the inhibition or loss of CDK12/CDK13 will cause the polyadenylation sites of introns to break, thereby inhibiting the expression of critical DNA damage response proteins. This causes the “BRCAness” phenotype, which leads to defects in DNA damage repair and promotes synergy with DNA-damaging chemotherapy and PARP inhibitors.TPX2TPX2 protein is highly expressed in breast cancer and has a certain correlation with the histological grade of breast cancer and lymph node metastasis. It may be a risk factor for the occurrence, development, and lymph node metastasis of breast cancer.FOXM1FOXM1 is considered as an emerging molecular target with its carcinogenic effect and 85% high overexpression characteristics in TNBC. FOXM1 occupies an important position in the gene network and is a key regulatory gene for breast cancer.There are many key genes that can be regulated, and only some are listed in Table5. Other regulated genes can be determined according to the ranking of PR values in Table 1 to Table 4.


## 6. Conclusion

In this paper, by establishing a complex gene network, statistical analysis is carried out through gene nodes, and then PR values are calculated for each gene node and ranked statistically to obtain gene key nodes. Under different thresholds, the PR value changes of different gene nodes are taken, and the appropriate gene network is selected for screening. The method proposed in this paper can transform the expression amount of gene expression network into a complex gene network and then into PR value, thus obtaining key genes. The next step of research work is to identify key genes from RNA-Seq analysis of expression in the second-generation sequencing and to identify key genes in combination with SNP, InDel, and other variants. It can also consider using other methods [24, 25] to solve the key genes.



---

*Source: 8816633-2020-12-10.xml*