# Identifying and Analyzing Strong Components of an Industrial Network Based on Cycle Degree

Authors: Zhiying Zhang; Xiaozhen Chen; Wenwen Xiao; Guijie Qi
Journal: Scientific Programming
 (2016)

---

## Abstract

In the era of big data and cloud computing, data research focuses not only on describing the individual characteristics but also on depicting the relationships among individuals. Studying dependence and constraint relationships among industries has aroused significant interest in the academic field. From the network perspective, this paper tries to analyze industrial relational structures based on cycle degree. The cycle degree of a vertex, that is, the number of cycles through a vertex in an industrial network, can describe the roles of the vertices of strong components in industrial circulation. In most cases, different vertices in a strong component have different cycle degrees, and the one with a larger cycle degree plays more important roles. However, the concept of cycle degree does not involve the lengths of the cycles, which are also important for circulations. The more indirect the relationship between two industries is, the weaker it is. In order to analyze strong components thoroughly, this paper proposes the concept of circular centrality taking into consideration the influence by two factors: the lengths and the numbers of cycles through a vertex. Exemplification indicates that a profound analysis of strong components in an industrial network can reveal the features of an economy.


---

## Body

## 1. Introduction

With the rapid development of the Internet, Internet of Things, and cloud computing technology, data has the potential for an explosive growth. The big-data era, which depends on cloud computing and cloud storage, has arrived. Large scale, diversity, and fast processing speed are the major characteristics of big data. Currently, data research focuses not only on describing individual characteristics but also on depicting the relationships among individuals [1, 2]. Relational data has been explored in the research of the economic management sector; for example, Acemoglu et al. used a degree sequence of a relational indicator to study the influences of the relationships among different departments on the fluctuation of the total output [3]; Hidalgo et al. studied an industry (product) upgrading issue by studying internet relational stricter among industries (products) [4]; Zhao et al. studied the linkage structure effect of blue economy under the perspective of an industrial network [5]; McNerney et al. studied the structure of interindustry relationships using networks of money flows between industries in 45 national economies [6]. On the basis of an analysis of industrial relational structures using relational data, this paper proposes the concept of circular centrality to detect unknown and potentially useful circular relational data hidden behind Input-Output Tables and study the topological properties of industrial circulation relationships.In a connected component of an undirected graph, all the vertices are reachable from each other, but this is not necessarily true for a digraph. When there is no path from one vertex to another in a digraph, it is not reachable from the vertex. If there are mutually reachable paths between two vertices, they must be in the same subdigraph, a strong component. A strong component of a digraph, also known as a strongly connected subdigraph, is a maximally induced subdigraph of the digraph. Because any two vertices in a strong component can reach each other, a strong component has features that are different from other components. These make strong components meaningful to a digraph, especially to the one with practical significance such as an industrial network.With vertices being the sectors and arcs representing significant industrial linkages, an economy can be abstracted into a network—an industrial network. The strong components of an industrial network depict industrial circulation linkages in an economy, where the former sector provides the input for the latter while the output of the latter comes back to the former. As shown in Figure1, the sectors of coal mining, basic metals, and machinery and the linkages among them make up a strong component, and there are industrial circulation linkages among them. As fundamental linkages, industrial circulation linkages appear in various economic phenomena such as industrial clusters and circular economy [7].Figure 1
Industry circular linkages.In an industrial network, the general properties of strong components make them an important factor influencing the economy. Since any two sectors in a strong component can reach each other, any change of a sector can be felt by the others, and feedback effects also can influence the initial sector. The effects circulate with diminishing strength, as is shown in Figure2.Figure 2
An industry network.Figure2 describes an industrial network representing product flows. It contains 13 vertices, and 6 of them are in a strong component, forming vertices set V
c. If any sector of V
c undergoes some changes, such as shrink or expansion, the changes would pass on to all sectors of V
c and pass it on to some vertices outside the strong component. For instance, if sector v
4 alters, all sectors of V
c would change accordingly, and the effects circulate again and again over. As for the sectors outside, such as v
11, v
4 would push it along the directed path v
4
→
v
5
→
v
11. When the influence circulates within the strong component and reaches v
4 again, the effects on v
11 would repeat again with lessened strength.Any changes of a strong component can influence the circulation of the network. For instance, ifv
1 becomes isolated in Figure 2, there would be no circulation, and any changes of a sector in the network would pass on along unidirectional paths and stop.Consequently, strong components play significant roles in an economy. Campbell [8, 9] recognized the importance and proposed that a strong component could be regarded as a vertex to build the condensation digraph. Some scholars followed this method, such as Morillas et al. [10]. This approach would do a lot to clarify the relationship structure of the whole network but did not involve the internal structure of a strong component. In order to do further researches on strong components, Zhao et al. [11, 12] developed the concepts of cycle degree and cycle length distribution of sectors and testified their applicability to show the structure of strong components.Suppose thatN is an industrial network, V is the set of all sectors in N, and sector v
∈
V. An industry cycle through v is defined as a directed cycle containing vertex v, where no two vertices are the same. It is obvious that an industry cycle, the fundamental circular unit of an industrial network, is a closed path through v. Any sector in a strong component is in one or more industry cycles. An industry cycle contains two sectors at least (regardless of loops—arcs beginning and ending at the same vertex) and all sectors of an industrial network at most. In Figure 2, there are four industry cycles through v
1, that is, v
1
→
v
5
→
v
1, v
1
→
v
2
→
v
3
→
v
6
→
v
1, v
1
→
v
2
→
v
3
→
v
4
→
v
5
→
v
1, and v
1
→
v
2
→
v
3
→
v
6
→
v
5
→
v
1.The cycle degree of a sector in an industrial network, denoted byd
c, means the number of industry cycles through the sector, describing the number of circular linkages between the sector and the others. As a sector with bigger d
c can influence more industry cycles, it has greater driving circulating power. In Figure 2, the cycle degrees of sectors v
1, v
2, v
3, v
4, v
5, and v
6 are 4, 3, 3, 1, 3, and 2, respectively. If v
1 becomes isolated, there would be no cycles in the network. It can be seen that the sectors with big cycle degrees have more influences on the strong component. Now that the sectors outside the strong component do not exist in any cycles, their cycle degrees are all 0.Differing from the degree, the cycle degree of a sector depicts the structure information from the whole network. A vertex with small degree is not necessarily with small cycle degree. With in-degree and out-degree both being 1, maybe a sector is only adjacent to two sectors, but the three sectors are all in multiple cycles, so that the cycle degree of the sector is large still. In Figure2, with the in-degree and out-degree being 1, d
c
(
v
2
) is 3, while d
c
(
v
4
) is 1.The concept of cycle degree can depict some features of the strong component, but it is not enough. For a vertex, its impact on circulation is related to its cycle degree, but also to the steps in circulations, which is reflected in the lengths of cycles. The effects circulating in a shorter cycle are stronger than in a longer one. If an indicator can capture the two aspects, it is more accurate. For this reason, the concept of circular centrality is proposed in this paper. In addition, in order to better analyze the strong component of an industrial network, the cycle degree of a strong component is presented too.In order to analyze the effectiveness of these concepts, some practical calculations are made. With more than 30 years of sustained rapid growth, China’s economy has become one of the fastest growing economies in the world. This paper analyzes China’s strong components and compares them to those of the US and Japan. The result shows the differences between China and the other two countries.The organization of this paper is as follows. Section2 describes the indicators to research strong components based on cycle degree. Section 3 briefly explains the methodology we employed in this study. The next part presents the main empirical results and analyses. Finally, some conclusions are offered.


## 2. Relevant Indicators to Analyze Strong Component Based on Cycle Degree

Strong components of an industrial network can be analyzed from a vertex or from the whole network. From a vertex perspective, as different vertices play different roles in circulations, it is important to analyze these differences. From the whole network, the strong components with different numbers of cycles create different circular effects. In addition, the distribution of sectors with large cycle degree can also show the characteristic of the economy.


### 2.1. Circular Centrality

The cycle degree of a vertex depicts the number of closed paths through the vertex in circulations. For a vertex, cycle degree can show its effect on circulation, but that is not wholly so. As is seen in Figure1, there are two cycles through vertex ①, ①→②→① and ①→③→②→①, but they have difference. Vertex ① gets to itself through two steps along the first cycle, but three steps along the second one. The length of the path affects the linkage between the two sectors. As the path becomes longer, the linkage would be weaker. To a closed directed path, it is obvious that the cycle’s length is a factor which can affect the roles of a vertex in circulation. If a vertex is contained in a special long cycle, the effect of the sector on itself would be slow and weak.In order to express the effect of a sector on circulation, two factors should be taken into consideration, the cycle degree and lengths of cycles through the sector.Freeman [13] proposed the concept of closeness centrality and suggested that the shorter the distance between a vertex and the others is, the higher closeness centrality it has. A vertex with big cycle degree and short cycles has a high circulation. Considering the two factors, we define the circular centrality of a vertex, which involves the concept of length distribution of cycles [11].Length distribution of cycles depicts the numbers of cycles with different lengths through a sector. Regardless of loop, the length of the shortest cycle is 2. As the vertices in a cycle are different, the length of the longest cycle is no more than the number of vertices in the strong component, here assumed to bem. Supposing d
c
k
(
v
) denote the number of k cycles through sector v, we get length distribution of cycles 2
k
m
⋯
⋯
d
c
2
(
v
)
d
c
k
(
v
)
d
c
m
(
v
). In Figure 2, there are 4 cycles through vertex v
1, with two cycles of the length of 5 and the others of 2 and 4. So, the length distribution of industry cycles through v
1 is 2
4
5
1
1
2.Length distribution of cycles involves the lengths of cycles and the corresponding cycle degrees at each length through a vertex. To a certain length, the ratio of cycle degree to its length shows the circular effect. The sum of all ratios depicts the role of the sector in circulation, which is defined as the circular centrality of a sector here. Denote the circular centrality of sectorv by c
c
v, and then(1)
c
c
v
=
∑
k
=
2
m
d
c
k
v
k
.The percentage is applicable when the vertices within strong component are compared with each other. The coefficient of circular centrality of sectorv, denoted by p
c
c
v, is the percentage of circular centrality of sector v in those of all sectors in the strong component, and then(2)
p
c
c
v
=
c
c
v
∑
v
=
1
m
c
c
v
×
100
%
.The circular centrality of a vertex is a concept based on cycle degree but involves the lengths of cycles. A vertex with big coefficient of circular centrality plays an important role in circulation.


### 2.2. The Cycle Degree of a Strong Component

Cycles are the fundamental units of a strong component. There must be some cycles in a strong component, at least one. Complete strong components contain the most cycles. The more cycles a strong component contains, the stronger the circularity is. The number of cycles in a strong component is related to the number of vertices and the features of arcs.The cycle degree of a strong component, denoted byd
t, is the number of cycles it contains. As the number of vertices in a strong component is constant, it is highly correlated to the arcs there. In general, the cycle degree of a strong component is highly positively correlated to the number of arcs. Sometimes, it is also related to the directions of arcs, and so forth. In Figure 2, if the arc v
1
→
v
2 becomes v
2
→
v
1, there would remain only one cycle.As a cycle including several vertices, the cycle degree of the strong component is not the sum of cycle degrees of all vertices there. If there arek vertices in a cycle, the cycle is counted k times, for it is considered in calculating the cycle degree of each vertex in the cycle. In order to calculate it, we can classify all cycles according to their lengths and sum up the cycle degree at each length. Suppose there are d
c
k
(
v
)
k cycles through sector v and m sectors in a strong component, v
=
1,2
,
…
,
m. As the number of vertices is that of arcs in a cycle, the number of k cycles in the strong component is ∑
v
=
1
m
d
c
k
(
v
)
/
k.Regardless of loops, arcs beginning and ending at the same vertex, as an industry cycle contains two sectors at least, the length of the shortest cycle is 2. And that of the longest cycle ism, for m sectors in the strong component. So, the cycle degree of a strong component, denoted by d
t, is the sum at each length. That is, (3)
d
t
=
∑
k
=
2
m
∑
v
=
1
m
d
c
k
v
k
.The cycle degree of a strong component depicts network connectivity of the strong component. The bigger it is, the stronger the connectivity is.


## 2.1. Circular Centrality

The cycle degree of a vertex depicts the number of closed paths through the vertex in circulations. For a vertex, cycle degree can show its effect on circulation, but that is not wholly so. As is seen in Figure1, there are two cycles through vertex ①, ①→②→① and ①→③→②→①, but they have difference. Vertex ① gets to itself through two steps along the first cycle, but three steps along the second one. The length of the path affects the linkage between the two sectors. As the path becomes longer, the linkage would be weaker. To a closed directed path, it is obvious that the cycle’s length is a factor which can affect the roles of a vertex in circulation. If a vertex is contained in a special long cycle, the effect of the sector on itself would be slow and weak.In order to express the effect of a sector on circulation, two factors should be taken into consideration, the cycle degree and lengths of cycles through the sector.Freeman [13] proposed the concept of closeness centrality and suggested that the shorter the distance between a vertex and the others is, the higher closeness centrality it has. A vertex with big cycle degree and short cycles has a high circulation. Considering the two factors, we define the circular centrality of a vertex, which involves the concept of length distribution of cycles [11].Length distribution of cycles depicts the numbers of cycles with different lengths through a sector. Regardless of loop, the length of the shortest cycle is 2. As the vertices in a cycle are different, the length of the longest cycle is no more than the number of vertices in the strong component, here assumed to bem. Supposing d
c
k
(
v
) denote the number of k cycles through sector v, we get length distribution of cycles 2
k
m
⋯
⋯
d
c
2
(
v
)
d
c
k
(
v
)
d
c
m
(
v
). In Figure 2, there are 4 cycles through vertex v
1, with two cycles of the length of 5 and the others of 2 and 4. So, the length distribution of industry cycles through v
1 is 2
4
5
1
1
2.Length distribution of cycles involves the lengths of cycles and the corresponding cycle degrees at each length through a vertex. To a certain length, the ratio of cycle degree to its length shows the circular effect. The sum of all ratios depicts the role of the sector in circulation, which is defined as the circular centrality of a sector here. Denote the circular centrality of sectorv by c
c
v, and then(1)
c
c
v
=
∑
k
=
2
m
d
c
k
v
k
.The percentage is applicable when the vertices within strong component are compared with each other. The coefficient of circular centrality of sectorv, denoted by p
c
c
v, is the percentage of circular centrality of sector v in those of all sectors in the strong component, and then(2)
p
c
c
v
=
c
c
v
∑
v
=
1
m
c
c
v
×
100
%
.The circular centrality of a vertex is a concept based on cycle degree but involves the lengths of cycles. A vertex with big coefficient of circular centrality plays an important role in circulation.


## 2.2. The Cycle Degree of a Strong Component

Cycles are the fundamental units of a strong component. There must be some cycles in a strong component, at least one. Complete strong components contain the most cycles. The more cycles a strong component contains, the stronger the circularity is. The number of cycles in a strong component is related to the number of vertices and the features of arcs.The cycle degree of a strong component, denoted byd
t, is the number of cycles it contains. As the number of vertices in a strong component is constant, it is highly correlated to the arcs there. In general, the cycle degree of a strong component is highly positively correlated to the number of arcs. Sometimes, it is also related to the directions of arcs, and so forth. In Figure 2, if the arc v
1
→
v
2 becomes v
2
→
v
1, there would remain only one cycle.As a cycle including several vertices, the cycle degree of the strong component is not the sum of cycle degrees of all vertices there. If there arek vertices in a cycle, the cycle is counted k times, for it is considered in calculating the cycle degree of each vertex in the cycle. In order to calculate it, we can classify all cycles according to their lengths and sum up the cycle degree at each length. Suppose there are d
c
k
(
v
)
k cycles through sector v and m sectors in a strong component, v
=
1,2
,
…
,
m. As the number of vertices is that of arcs in a cycle, the number of k cycles in the strong component is ∑
v
=
1
m
d
c
k
(
v
)
/
k.Regardless of loops, arcs beginning and ending at the same vertex, as an industry cycle contains two sectors at least, the length of the shortest cycle is 2. And that of the longest cycle ism, for m sectors in the strong component. So, the cycle degree of a strong component, denoted by d
t, is the sum at each length. That is, (3)
d
t
=
∑
k
=
2
m
∑
v
=
1
m
d
c
k
v
k
.The cycle degree of a strong component depicts network connectivity of the strong component. The bigger it is, the stronger the connectivity is.


## 3. The Methodology to Identify Strong Components and Calculate the Cycle Degree of a Vertex

In order to study strong components, we need to identify them from an industrial network first. In addition, calculating the cycle degree of a vertex is the basis to study the strong component. Here, we employ the methodology proposed by Zhao et al. [11] to do these.


### 3.1. Identifying Strong Components of an Industrial Network

A strong component should be identified from its unique features. All sectors in a strong component can reach one another along directed paths. If arcs are drawn along all directed paths, a strong component would become a complete subdigraph, where there are arcs between any two sectors, as is shown in Figure3. In the adjacent matrix attached to a complete subdigraph, the entries off the principal dialogue are all “1.” According to this, we can distinguish complete subdigraphs from others and identify the strong components accordingly.Figure 3
Strong component and the corresponding complete subdigraph.
(a)
A strong component
(b)
A complete strong componentIn order to identify the strong component of an industrial network, we draw arcs along all directed paths and get a new network, which is called the expansion network here. In the expansion network, the strong components of the primary network become complete strong components. Suppose that the adjacent matrixes of an industrial network and its expansion network areU and U
∗
, respectively. In the industrial network, if there are p directed walks, length of k from i to j, the entries at the intersection of row i and column j of U
k would be p [14]. Suppose that an industrial network contains n vertices; then the length of the longest path (without cycles) of the industrial network will be not more than n
-
1. The sum of the power sequence of the U
k (k
=
1
,
…
,
n
-
1) matrices gives all walks no more than k steps. When arcs are drawn along all paths, the entries of the corresponding adjacent matrix will become 1 at all positive entries of the sum matrix. So we can get the adjacent matrix U
∗ from the Boolean summation (i.e., 1 + (#) 1 = 1) of the power sequence matrices; that is,(4)
U
∗
=
#
U
+
U
2
+
⋯
+
U
n
-
1
,where # denotes Boolean summation.FromU
∗, we search for all the appropriate j and k for satisfying u
∗
(
k
,
j
)
=
1 and u
∗
(
j
,
k
)
=
1. All the vertexes j and k are in one complete subdigraph of the industry linkage expansion network; that is, they all belong to one strong component in the industrial network.


### 3.2. Calculating the Cycle Degree of a Sector

In a strong component, cycle degree of sectori means the number of all cycles through sector i, denoted by d
c
(
i
). In order to calculate, divide the cycles through sector i into groups according to their length and denote the cycle degree of length k by d
c
(
k
)
(
i
). It is obvious that the sum of cycle degrees of all lengths cycles is the cycle degree through sector i. Consider(5)
d
c
i
=
∑
k
d
c
k
i
.Ignoring the loops, the shortest cycle is 2 cycles (length of 2), and the longest is no more than the number of vertices in the strong component.From the adjacency matrix of an industrial network,U, we can get the liaisons of any two sectors. If u
i
j
=
1, there is a direct linkage from sector i to j; if u
i
v
1
=
u
v
1
v
2
=
⋯
=
u
v
k
-
1
j
=
1 (i
,
v
1
,
v
2
,
…
,
j all differ from one another, so that there is a directed path length of k from sector i to j), there is an indirect linkage from sector i to j, as is shown in Figure 4; otherwise, there is no linkage. When sectors i and j are the same one, the directed path becomes a directed cycle. In other words, there is a k cycle through sector i.Figure 4
Directed path from sectori to sector j.In order to calculated
c
(
k
)
(
i
), we search for the directed closed paths i
→
v
1
→
v
2
→
v
3
→
⋯
→
v
k
-
2
→
v
k
-
1
→
i (i
,
v
1
,
v
2, … all differ from one another) first and then count. The number of all these paths is d
c
(
k
)
(
i
), and the sum of all lengths of cycles is d
c
(
i
).As verticesi
,
v
1
,
v
2
,
…
,
v
k
-
1 are different from each other, the searching process is complex, especially to larger k. But an industrial network has its unique characteristics, which make the calculation possible. Firstly, the number of vertices in an industrial network is clear and small, and so is that of a strong component. Secondly, as industrial networks are sparse, if we only calculate unit entries and omit nil entries of the adjacent matrixes, the calculation will be reduced greatly. The algorithm is as follows.Suppose that there arem sectors in a strong component, and W is the adjacent matrix attached to the strong component. Let d
c
(
k
)
(
i
) be equal to 0 for sector i first. As is shown in Figure 5, the steps are as follows.Figure 5
Process to calculate cycle degree through sectori.Step 1.
Search for the suitablev
1 for w
i
v
1
=
1.Step 2.
Search for the suitablev
2 for w
v
1
v
2
=
1. As no loop is in a strong component, it is certain that v
2
≠
v
1. If v
2
=
i, there must be a 2-cycle; then d
c
(
2
)
(
i
)
←
d
c
(
2
)
(
i
)
+
1; else, go to next step.Step 3.
Search for the suitablev
3 for w
v
2
v
3
=
1, and v
3
≠
v
1. If v
3
=
i, d
c
(
3
)
(
i
)
←
d
c
(
3
)
(
i
)
+
1; else, go to next step.⋮Step
m
-
1
. Search for the suitable v
m
-
1 for w
v
m
-
2
v
m
-
1
=
1, and v
m
-
1
≠
v
1
,
v
2
,
…
,
v
m
-
3. If v
m
-
1
=
i, d
c
(
m
-
1
)
(
i
)
←
d
c
(
m
-
1
)
(
i
)
+
1; else, go to next step.Step
m. Search for the suitable v
m for w
v
m
-
1
v
m
=
1, and v
m
≠
v
1
,
v
2
,
…
,
v
m
-
2. If v
m
=
i, d
c
(
m
)
(
i
)
←
d
c
(
m
)
(
i
)
+
1; else, go to next step.Step
m
+
1. Sum up d
c
k
(
i
) (k
=
2
,
…
,
m); then we get d
c
(
i
).Applying the procedure to all vertices of a strong component, we obtain all cycle degrees.


## 3.1. Identifying Strong Components of an Industrial Network

A strong component should be identified from its unique features. All sectors in a strong component can reach one another along directed paths. If arcs are drawn along all directed paths, a strong component would become a complete subdigraph, where there are arcs between any two sectors, as is shown in Figure3. In the adjacent matrix attached to a complete subdigraph, the entries off the principal dialogue are all “1.” According to this, we can distinguish complete subdigraphs from others and identify the strong components accordingly.Figure 3
Strong component and the corresponding complete subdigraph.
(a)
A strong component
(b)
A complete strong componentIn order to identify the strong component of an industrial network, we draw arcs along all directed paths and get a new network, which is called the expansion network here. In the expansion network, the strong components of the primary network become complete strong components. Suppose that the adjacent matrixes of an industrial network and its expansion network areU and U
∗
, respectively. In the industrial network, if there are p directed walks, length of k from i to j, the entries at the intersection of row i and column j of U
k would be p [14]. Suppose that an industrial network contains n vertices; then the length of the longest path (without cycles) of the industrial network will be not more than n
-
1. The sum of the power sequence of the U
k (k
=
1
,
…
,
n
-
1) matrices gives all walks no more than k steps. When arcs are drawn along all paths, the entries of the corresponding adjacent matrix will become 1 at all positive entries of the sum matrix. So we can get the adjacent matrix U
∗ from the Boolean summation (i.e., 1 + (#) 1 = 1) of the power sequence matrices; that is,(4)
U
∗
=
#
U
+
U
2
+
⋯
+
U
n
-
1
,where # denotes Boolean summation.FromU
∗, we search for all the appropriate j and k for satisfying u
∗
(
k
,
j
)
=
1 and u
∗
(
j
,
k
)
=
1. All the vertexes j and k are in one complete subdigraph of the industry linkage expansion network; that is, they all belong to one strong component in the industrial network.


## 3.2. Calculating the Cycle Degree of a Sector

In a strong component, cycle degree of sectori means the number of all cycles through sector i, denoted by d
c
(
i
). In order to calculate, divide the cycles through sector i into groups according to their length and denote the cycle degree of length k by d
c
(
k
)
(
i
). It is obvious that the sum of cycle degrees of all lengths cycles is the cycle degree through sector i. Consider(5)
d
c
i
=
∑
k
d
c
k
i
.Ignoring the loops, the shortest cycle is 2 cycles (length of 2), and the longest is no more than the number of vertices in the strong component.From the adjacency matrix of an industrial network,U, we can get the liaisons of any two sectors. If u
i
j
=
1, there is a direct linkage from sector i to j; if u
i
v
1
=
u
v
1
v
2
=
⋯
=
u
v
k
-
1
j
=
1 (i
,
v
1
,
v
2
,
…
,
j all differ from one another, so that there is a directed path length of k from sector i to j), there is an indirect linkage from sector i to j, as is shown in Figure 4; otherwise, there is no linkage. When sectors i and j are the same one, the directed path becomes a directed cycle. In other words, there is a k cycle through sector i.Figure 4
Directed path from sectori to sector j.In order to calculated
c
(
k
)
(
i
), we search for the directed closed paths i
→
v
1
→
v
2
→
v
3
→
⋯
→
v
k
-
2
→
v
k
-
1
→
i (i
,
v
1
,
v
2, … all differ from one another) first and then count. The number of all these paths is d
c
(
k
)
(
i
), and the sum of all lengths of cycles is d
c
(
i
).As verticesi
,
v
1
,
v
2
,
…
,
v
k
-
1 are different from each other, the searching process is complex, especially to larger k. But an industrial network has its unique characteristics, which make the calculation possible. Firstly, the number of vertices in an industrial network is clear and small, and so is that of a strong component. Secondly, as industrial networks are sparse, if we only calculate unit entries and omit nil entries of the adjacent matrixes, the calculation will be reduced greatly. The algorithm is as follows.Suppose that there arem sectors in a strong component, and W is the adjacent matrix attached to the strong component. Let d
c
(
k
)
(
i
) be equal to 0 for sector i first. As is shown in Figure 5, the steps are as follows.Figure 5
Process to calculate cycle degree through sectori.Step 1.
Search for the suitablev
1 for w
i
v
1
=
1.Step 2.
Search for the suitablev
2 for w
v
1
v
2
=
1. As no loop is in a strong component, it is certain that v
2
≠
v
1. If v
2
=
i, there must be a 2-cycle; then d
c
(
2
)
(
i
)
←
d
c
(
2
)
(
i
)
+
1; else, go to next step.Step 3.
Search for the suitablev
3 for w
v
2
v
3
=
1, and v
3
≠
v
1. If v
3
=
i, d
c
(
3
)
(
i
)
←
d
c
(
3
)
(
i
)
+
1; else, go to next step.⋮Step
m
-
1
. Search for the suitable v
m
-
1 for w
v
m
-
2
v
m
-
1
=
1, and v
m
-
1
≠
v
1
,
v
2
,
…
,
v
m
-
3. If v
m
-
1
=
i, d
c
(
m
-
1
)
(
i
)
←
d
c
(
m
-
1
)
(
i
)
+
1; else, go to next step.Step
m. Search for the suitable v
m for w
v
m
-
1
v
m
=
1, and v
m
≠
v
1
,
v
2
,
…
,
v
m
-
2. If v
m
=
i, d
c
(
m
)
(
i
)
←
d
c
(
m
)
(
i
)
+
1; else, go to next step.Step
m
+
1. Sum up d
c
k
(
i
) (k
=
2
,
…
,
m); then we get d
c
(
i
).Applying the procedure to all vertices of a strong component, we obtain all cycle degrees.


## 4. Empirical Calculations and Analyses

In order to study the effectiveness of the concepts mentioned, some practical calculations are made. China’s rapid development has intrigued a great deal of economists to try to understand the process [15–18]. So we try to analyze China’s strong components and compare them to those of the US and Japan.For comparison purposes, the data employed are derived from the OECD Input-Output Database, which is a part of the structural analysis (STAN) database. Data are used from Domestic Input-Output Tables 2005 of China, the US, and Japan (the 2005 Input-Output Tables were the last ones available). The tables all have 37 homogeneous sectors, as presented in AppendixC, making it possible to provide internationally comparable data for research. In order to find the fundamental relationships from the impacts on total production, we calculate the corrected influence coefficients of industrial linkage (Chen and Zhao [19], see Appendix A), on the basis of which industrial networks are constructed (Zhao et al., 2011 [20], see Appendix B).


### 4.1. Identifying the Strong Component of China’s Industrial Network

Based on the methodology of Section3, we obtain China’s strong component. There is only one strong component, containing 23 sectors and 144 arcs, as is shown in Figure 6. The cycle degree of the strong component of China is 1263356.Figure 6
Strong component of China’s industrial network.


### 4.2. Cycle Degrees of Sectors in China’s Strong Component

The lengths distribution of cycles and cycle degrees of sectors in China are calculated, as is shown in Table1. It can be seen that, to one sector, when the lengths of cycles are short, as the length is growing, the corresponding cycle degrees rise gradually. When the cycle degree reaches the maximum value, it starts to fall until reaching zero with the increase of the length.Table 1
The cycle degree and length contribution of the industry cycle in China.
SC
CL
CD
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
1
2
4
25
107
380
1313
4026
10899
25554
51547
88434
127442
151844
146632
112795
67276
29412
8739
1572
108
828111
2
4
11
40
178
650
2052
5808
14740
32929
63913
106706
150591
176137
167981
127753
74793
31866
9209
1606
108
967075
3
2
6
24
99
351
1243
3906
10886
26291
54313
94775
138083
165730
160852
123523
72857
31344
9141
1596
108
895130
6
1
3
8
24
95
332
980
2530
5762
11366
19176
27400
32520
31793
25109
15151
6547
1931
306
12
181046
7
2
4
18
82
300
989
2884
7511
17328
34788
60037
87754
106841
107042
86807
54980
25545
8039
1522
108
602581
8
5
19
91
360
1239
3794
10271
24579
51524
93889
147017
194780
214946
194481
141537
80104
33293
9447
1622
108
1203106
9
0
1
11
51
197
689
2156
6122
15218
32672
60053
92626
117231
119530
96764
60793
28003
8639
1586
108
642450
11
2
14
64
251
883
2780
7880
19866
43791
83147
134135
181398
203212
186175
136908
78136
32705
9373
1622
108
1122450
12
0
3
12
47
170
560
1692
4590
10896
22583
41000
63044
79701
81707
67046
42191
18606
5413
1138
108
440507
13
7
26
112
412
1351
3976
10489
24674
51229
92888
145253
192679
213173
193435
140944
79708
33142
9435
1622
108
1194663
14
2
3
12
50
197
715
2353
6901
17620
38534
71472
110377
138890
139031
108388
64369
28007
8417
1570
108
737016
15
2
7
30
125
456
1501
4466
11827
27481
55934
98438
145565
176637
172832
133298
78096
33000
9431
1622
108
950856
16
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
18
1
3
26
113
398
1278
3625
9072
19997
38282
62701
86852
100837
97134
76051
47225
22776
7897
1568
108
575944
19
1
3
26
113
398
1278
3625
9072
19997
38282
62701
86852
100837
97134
76051
47225
22776
7897
1568
108
575944
20
0
0
2
12
58
191
529
1324
2894
5510
9071
12772
15411
15806
13578
9556
5267
2138
606
96
94821
21
2
16
66
252
892
2817
7928
19746
43046
81291
131103
177581
199263
182709
134497
76911
32279
9267
1610
108
1101384
23
1
9
45
179
639
2116
6286
16450
37559
73706
122878
171619
198136
186101
139081
79856
33349
9459
1622
108
1079199
24
0
8
37
136
495
1708
5228
14041
32515
64157
107018
149683
173631
164338
124043
72031
30474
8859
1594
108
950104
25
2
15
87
343
1181
3635
9938
24070
51183
94355
148777
197784
218558
197656
143437
80798
33425
9459
1622
108
1216433
26
0
0
2
14
75
277
913
2658
6953
16234
33021
56729
80801
94058
87068
60555
29345
9157
1622
108
479590
27
0
0
2
14
75
277
913
2658
6953
16234
33021
56729
80801
94058
87068
60555
29345
9157
1622
108
479590
32
1
7
32
133
482
1626
5000
13526
31830
64073
108425
152058
175267
164745
124286
72746
31288
9217
1622
108
956472
Note. SC: sector code; LC: cycles’ length; CD: cycle degree.To represent length distribution of industry cycles graphically, with abscissa being the lengths of cycles and ordinate being cycle degrees, we get the line charts of the top ten sectors, as is shown in Figure7.Figure 7
Length distribution of cycles of the top ten sectors.From Figure7, it appears that the curves look like bells, increasing first and then decreasing. In the declining process, several curves overlap gradually. Given closer analysis it can be seen that as cycle becomes longer, there are more sectors in one cycle, so the cycle degrees of the top sectors increase simultaneously.Dividing curves into halves in the middle parts, it can be seen that the differences of cycle degrees mainly come from the shorter cycles. Since shorter cycles circulate faster than the longer ones, the sectors with larger cycle degrees play more important roles and show greater competitiveness in an economy.The cycle degree through a sector is an absolute value describing all closed paths through the sector. When we analyze how much a sector impacts the whole structure, relative cycle degree is needed. The relative cycle degree through sectori is the percentage of the cycle degree through sector i in that of the strong component, denoted by p
d
c
(
i
); then(6)
p
d
c
i
=
d
c
i
d
t
×
100
%
.The relative cycle degrees of sectors in China are calculated, and the top ten ones are taken out, as is shown in Table2.Table 2
The top ten sectors of relative cycle degree and coefficients of circular centrality.
China
Japan
The US
SC
RCD
CCC
SC
RCD
CCC
SC
RCD
CCC
(%)
RA
(%)
RA
(%)
RA
(%)
RA
(%)
RA
(%)
RA
25
96.3
1
7.20
1
23
98.3
1
8.0
1
23
23
1
6.24
1
8
95.2
2
7.13
2
21
89.7
2
7.17
2
36
36
2
6.23
2
13
94.6
3
7.08
3
32
89.2
3
7.12
3
31
31
3
6.17
3
11
88.8
4
6.60
4
13
88.5
4
7.04
4
28
28
4
6.01
4
21
87.2
5
6.47
5
6
80.1
5
6.41
5
27
27
5
5.85
5
23
85.4
6
6.28
6
27
78.4
6
6.20
6
33
33
6
5.79
6
2
76.5
7
5.61
7
25
76.8
7
6.09
7
25
25
7
5.1
7
32
75.7
8
5.55
8
22
76
8
5.99
8
32
32
8
4.97
8
15
75.3
9
5.45
10
26
70.8
9
5.52
9
53
53
9
4.53
9
24
75.2
10
5.51
9
8
67.8
10
5.3
10
24
24
10
4.32
10
Note. SC: sector code; RCD: relative cycle degree; RA: ranking; CCC: coefficients of circular centrality.


### 4.3. Strong Component Comparisons among China, the US, and Japan

The cycle degree of the strong component of China is 1263356, while those of the US and Japan are 72712187 and 94706, respectively. It shows that, within an economy, the economic circulation of China is in the middle of the US and Japan. Relatively, Japan is the most dependent on foreign economy, and the US is the weakest.For comparison, the coefficients of circular centrality and the relative cycle degrees of sectors are calculated and ordered in the three economies. Listing the top ten sectors, we get Table2.From Table2, the top ten cycle degree sectors in the three economies basically share the same rankings with their coefficients of circular centrality. It is thus evident that the sectors with bigger cycle degrees have higher circular centrality generally.Comparing the ten largest cycle degree sectors in the three economies, we can find that there exist some similarities but more differences in the three economies, as is shown in Figure8. Overall, there are three common sectors, sectors 23, 25, and 32. They all belong to the service sector.Figure 8
The top ten largest cycle degree sectors of the three economies.The distributions of the top ten sectors in the three economies are largely in accordance with their characteristics.In China, the top ten sectors are distributed in three industries, one belonging to the resource industry, five to the manufacturing industry, and four to the service industry. Sector 2 (mining and quarrying) ranks in the top ten only in China. Of the five sectors belonging to the manufacturing industry, four are in the top five. It is evident that the manufacturing industry is the predominant part in China. The US shows its unique characteristics. Of the top ten sectors, nine belong to the service sector. Obviously, the service industry plays a dominant part in the US. Among them, sectors 28 (real estate activities), 31 (research and development), 36 (other community, social, and personal services), and 3 (food products, beverages, and tobacco) are in the top ten sectors only in the US, and sectors 28, 31, and 36 are even in the top five. Japan is somewhere between the US and China. The top ten sectors are both evenly distributed in the manufacturing and the service industry.


## 4.1. Identifying the Strong Component of China’s Industrial Network

Based on the methodology of Section3, we obtain China’s strong component. There is only one strong component, containing 23 sectors and 144 arcs, as is shown in Figure 6. The cycle degree of the strong component of China is 1263356.Figure 6
Strong component of China’s industrial network.


## 4.2. Cycle Degrees of Sectors in China’s Strong Component

The lengths distribution of cycles and cycle degrees of sectors in China are calculated, as is shown in Table1. It can be seen that, to one sector, when the lengths of cycles are short, as the length is growing, the corresponding cycle degrees rise gradually. When the cycle degree reaches the maximum value, it starts to fall until reaching zero with the increase of the length.Table 1
The cycle degree and length contribution of the industry cycle in China.
SC
CL
CD
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
1
2
4
25
107
380
1313
4026
10899
25554
51547
88434
127442
151844
146632
112795
67276
29412
8739
1572
108
828111
2
4
11
40
178
650
2052
5808
14740
32929
63913
106706
150591
176137
167981
127753
74793
31866
9209
1606
108
967075
3
2
6
24
99
351
1243
3906
10886
26291
54313
94775
138083
165730
160852
123523
72857
31344
9141
1596
108
895130
6
1
3
8
24
95
332
980
2530
5762
11366
19176
27400
32520
31793
25109
15151
6547
1931
306
12
181046
7
2
4
18
82
300
989
2884
7511
17328
34788
60037
87754
106841
107042
86807
54980
25545
8039
1522
108
602581
8
5
19
91
360
1239
3794
10271
24579
51524
93889
147017
194780
214946
194481
141537
80104
33293
9447
1622
108
1203106
9
0
1
11
51
197
689
2156
6122
15218
32672
60053
92626
117231
119530
96764
60793
28003
8639
1586
108
642450
11
2
14
64
251
883
2780
7880
19866
43791
83147
134135
181398
203212
186175
136908
78136
32705
9373
1622
108
1122450
12
0
3
12
47
170
560
1692
4590
10896
22583
41000
63044
79701
81707
67046
42191
18606
5413
1138
108
440507
13
7
26
112
412
1351
3976
10489
24674
51229
92888
145253
192679
213173
193435
140944
79708
33142
9435
1622
108
1194663
14
2
3
12
50
197
715
2353
6901
17620
38534
71472
110377
138890
139031
108388
64369
28007
8417
1570
108
737016
15
2
7
30
125
456
1501
4466
11827
27481
55934
98438
145565
176637
172832
133298
78096
33000
9431
1622
108
950856
16
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
18
1
3
26
113
398
1278
3625
9072
19997
38282
62701
86852
100837
97134
76051
47225
22776
7897
1568
108
575944
19
1
3
26
113
398
1278
3625
9072
19997
38282
62701
86852
100837
97134
76051
47225
22776
7897
1568
108
575944
20
0
0
2
12
58
191
529
1324
2894
5510
9071
12772
15411
15806
13578
9556
5267
2138
606
96
94821
21
2
16
66
252
892
2817
7928
19746
43046
81291
131103
177581
199263
182709
134497
76911
32279
9267
1610
108
1101384
23
1
9
45
179
639
2116
6286
16450
37559
73706
122878
171619
198136
186101
139081
79856
33349
9459
1622
108
1079199
24
0
8
37
136
495
1708
5228
14041
32515
64157
107018
149683
173631
164338
124043
72031
30474
8859
1594
108
950104
25
2
15
87
343
1181
3635
9938
24070
51183
94355
148777
197784
218558
197656
143437
80798
33425
9459
1622
108
1216433
26
0
0
2
14
75
277
913
2658
6953
16234
33021
56729
80801
94058
87068
60555
29345
9157
1622
108
479590
27
0
0
2
14
75
277
913
2658
6953
16234
33021
56729
80801
94058
87068
60555
29345
9157
1622
108
479590
32
1
7
32
133
482
1626
5000
13526
31830
64073
108425
152058
175267
164745
124286
72746
31288
9217
1622
108
956472
Note. SC: sector code; LC: cycles’ length; CD: cycle degree.To represent length distribution of industry cycles graphically, with abscissa being the lengths of cycles and ordinate being cycle degrees, we get the line charts of the top ten sectors, as is shown in Figure7.Figure 7
Length distribution of cycles of the top ten sectors.From Figure7, it appears that the curves look like bells, increasing first and then decreasing. In the declining process, several curves overlap gradually. Given closer analysis it can be seen that as cycle becomes longer, there are more sectors in one cycle, so the cycle degrees of the top sectors increase simultaneously.Dividing curves into halves in the middle parts, it can be seen that the differences of cycle degrees mainly come from the shorter cycles. Since shorter cycles circulate faster than the longer ones, the sectors with larger cycle degrees play more important roles and show greater competitiveness in an economy.The cycle degree through a sector is an absolute value describing all closed paths through the sector. When we analyze how much a sector impacts the whole structure, relative cycle degree is needed. The relative cycle degree through sectori is the percentage of the cycle degree through sector i in that of the strong component, denoted by p
d
c
(
i
); then(6)
p
d
c
i
=
d
c
i
d
t
×
100
%
.The relative cycle degrees of sectors in China are calculated, and the top ten ones are taken out, as is shown in Table2.Table 2
The top ten sectors of relative cycle degree and coefficients of circular centrality.
China
Japan
The US
SC
RCD
CCC
SC
RCD
CCC
SC
RCD
CCC
(%)
RA
(%)
RA
(%)
RA
(%)
RA
(%)
RA
(%)
RA
25
96.3
1
7.20
1
23
98.3
1
8.0
1
23
23
1
6.24
1
8
95.2
2
7.13
2
21
89.7
2
7.17
2
36
36
2
6.23
2
13
94.6
3
7.08
3
32
89.2
3
7.12
3
31
31
3
6.17
3
11
88.8
4
6.60
4
13
88.5
4
7.04
4
28
28
4
6.01
4
21
87.2
5
6.47
5
6
80.1
5
6.41
5
27
27
5
5.85
5
23
85.4
6
6.28
6
27
78.4
6
6.20
6
33
33
6
5.79
6
2
76.5
7
5.61
7
25
76.8
7
6.09
7
25
25
7
5.1
7
32
75.7
8
5.55
8
22
76
8
5.99
8
32
32
8
4.97
8
15
75.3
9
5.45
10
26
70.8
9
5.52
9
53
53
9
4.53
9
24
75.2
10
5.51
9
8
67.8
10
5.3
10
24
24
10
4.32
10
Note. SC: sector code; RCD: relative cycle degree; RA: ranking; CCC: coefficients of circular centrality.


## 4.3. Strong Component Comparisons among China, the US, and Japan

The cycle degree of the strong component of China is 1263356, while those of the US and Japan are 72712187 and 94706, respectively. It shows that, within an economy, the economic circulation of China is in the middle of the US and Japan. Relatively, Japan is the most dependent on foreign economy, and the US is the weakest.For comparison, the coefficients of circular centrality and the relative cycle degrees of sectors are calculated and ordered in the three economies. Listing the top ten sectors, we get Table2.From Table2, the top ten cycle degree sectors in the three economies basically share the same rankings with their coefficients of circular centrality. It is thus evident that the sectors with bigger cycle degrees have higher circular centrality generally.Comparing the ten largest cycle degree sectors in the three economies, we can find that there exist some similarities but more differences in the three economies, as is shown in Figure8. Overall, there are three common sectors, sectors 23, 25, and 32. They all belong to the service sector.Figure 8
The top ten largest cycle degree sectors of the three economies.The distributions of the top ten sectors in the three economies are largely in accordance with their characteristics.In China, the top ten sectors are distributed in three industries, one belonging to the resource industry, five to the manufacturing industry, and four to the service industry. Sector 2 (mining and quarrying) ranks in the top ten only in China. Of the five sectors belonging to the manufacturing industry, four are in the top five. It is evident that the manufacturing industry is the predominant part in China. The US shows its unique characteristics. Of the top ten sectors, nine belong to the service sector. Obviously, the service industry plays a dominant part in the US. Among them, sectors 28 (real estate activities), 31 (research and development), 36 (other community, social, and personal services), and 3 (food products, beverages, and tobacco) are in the top ten sectors only in the US, and sectors 28, 31, and 36 are even in the top five. Japan is somewhere between the US and China. The top ten sectors are both evenly distributed in the manufacturing and the service industry.


## 5. Conclusions and Further Research

Strong components are important components of a digraph for the circulations among vertices. Studying the strong components of an industrial network makes it easier to further identify the structural characteristics of the vertices and the whole network. To describe the strong components of an industrial network more accurately, this paper proposes the concept of circular centrality of a vertex and cycle degree of a strong component on the basis of cycle degree. As circular centrality of a vertex takes into consideration the influence by the lengths and the numbers of cycles through the vertex, it can better describe the real world. Using these indicators, the features of the strong components of China are analyzed and compared with those of the US and Japan.We can analyze the strong components of an industrial network from two aspects: a vertex and strong component. From the viewpoint of a vertex, circular centrality is a concept involving the cycle degree and lengths of the cycles. Generally, a sector with a higher circular centrality has a stronger circulation and a larger influence on the economy. The study on the strong components of China and the other two economies shows that a vertex with a large cycle degree, with a few exceptions, has a high coefficient of circular centrality. From the viewpoint of a strong component, its cycle degree describes the number of circular paths within it. With a constant vertex number, a strong component with a larger cycle degree circulates stronger.Although the concept of circular centrality of a vertex can describe strong components thoroughly, the calculation methods also have some limitations. Since the calculation process involves circulation, it may take a long time when there are many vertices and arcs in a strong component. As the intermediate inputs of industries are uneven (see AppendixB), the industrial networks are relatively sparse. This makes the method effective in most cases.Generally, a sector with higher circular centrality has more competitiveness. In order to improve the competitiveness of an economy, we can try to change some linkages through policy guidance to enhance the circular level of the sector and the whole network. It is meaningful to find these linkages and take appropriate action to change them in future research. In addition, there are probably some vertices with more intimate relationships than others within a strong component. Finding these groups will be useful to further analyze the network.



---

*Source: 7340859-2016-06-30.xml*