# Dynamic Discrete GM (1,1) Model and Its Application in the Prediction of Urbanization Conflict Events

Authors: Ersi Liu; Qiangqiang Wang; Xinran Ge; Wei Zhou
Journal: Discrete Dynamics in Nature and Society
 (2016)

---

## Abstract

In the empirical researches, the discrete GM (1,1) model is not always fitted well, and sometimes the forecasting error is large. In order to solve this issue, this study proposes a dynamic discrete GM (1,1) model based on the grey prediction theory and the GM (1,1) model. In this paper, we use the equal division technology to fit the concavity and convexity of the cumulative sequence and then construct two dynamic average values. Based on the dynamic average values, we further develop two dynamic discrete GM (1,1) models and provide the gradual heuristics method to draw the initial equal division number and the dichotomy approach to optimize the equal division number. Finally, based on an empirical analysis of the number of conflict events in the urbanization process in China, we verify that the dynamic discrete GM (1,1) model has higher fitting and prediction accuracy than the GM (1,1) model and the discrete GM (1,1) model, and its prediction result is beneficial to the government for prevention and solution of the urbanization conflict events.


---

## Body

## 1. Introduction

After years of development [1, 2], the grey system theory has formed a relatively complete system theory. The GM (1,1) model, with its unique advantages, is widely used in several fields such as economics, management, industry, agriculture, military, science, and education. The obvious advantage of the GM (1,1) model is that the model can be used to model and predict a small amount of sequence data.Further, the optimization of the grey model and the improvement of the grey system theory have acquired a lot of achievements. In the research area of discrete GM (1,1) models, Xie and Liu [3] proposed an unbiased discrete GM (1,1) model by focusing on the forecast stability problem of the GM (1,1) model and analyzing its causes in detail, from continuous to discrete. Xie and Liu [4] outlined three forms of discrete GM (1,1) model; meanwhile, they also proposed a method for approximately fitting the homogeneous exponent. Yao and Liu [5] studied the nonlinear and nonnegative sequence fitting issue and then proposed an improved discrete GM (1,1) model. Wang et al. [6] proved that a discrete homogeneous exponent calculated by once accumulated operation can be transformed into a discrete nonhomogeneous exponent. Based on that, they further constructed an optimized discrete GM (1,1) model based on an improved background value. Yao et al. [7] studied parameter properties of the new information discrete GM (1,1) model and proposed the piecewise modified new information discrete GM (1,1) model and analyzed its modeling mechanism. To further improve the GM (1,1) model and the discrete GM (1,1) model, Zhou et al. [8] proposed the generalized GM (1,1) model based on an optimal stepwise ratio, which can effectively include the GM (1,1) model and the discrete GM (1,1) model; Kayacan et al. [9] analyzed the advantages and disadvantages of the discrete GM (1,1) model in the least square method and then gave a new sequence discrete GM (1,1) model based on the structural risk minimization; Li et al. [10] used the two-step method to construct a hybrid model by combining the GM (1,1) model and the discrete GM (1,1) model; Zhou and He [11] proposed a new generalized GM (1,1) model which can be used to depict the discrete GM (1,1) model and optimized it by using four kinds of methods to obtain better fitting prediction results; Liu et al. [12] developed a new improved discrete GM (1,1) model by introducing the neural network. Yang and Zhao [13] corrected the fixed error of the GM (1,1) power model and then gave a discrete GM (1,1) power model. Recently, Zhou and Zhang [14] identified the prediction inaccuracies in the GM (1,1) model and the discrete GM (1,1) model based on the presence of singularities in the real small sample data and then proposed the improved metabolism GM (1,1) model. The aforementioned models belong to the discrete GM (1,1) model and provide the basis for the new discrete GM (1,1) model proposed in this paper.Moreover, another key issue of this paper is the research of urbanization conflict. Many studies have been taken which can be reviewed as follows: Portes and Roberts [15] tested the level of urban development of the Latin American cities in recent decades based on comparable data from six countries. Yu et al. [16] used the brainstorming and semistructured interview to identify urbanization conflict risk factors and applied them in the rapid urbanization process in China. Yu et al. [17] further studied the conflict about society, economics, and the environment in the process of urbanization. Zhou et al. [18] used Hangzhou Bay as the object of research to design a set of methods to optimize the quality of urbanization, which is conducive to improving the quality of urbanization and reducing the conflict associated with urbanization. Su et al. [19] studied the acceleration of the urbanization process, due to which China’s urban and rural income gap continues to expand and cause certain conflict problems. Wang et al. [20] studied China’s urbanization process since 1990, which brought rapid economic growth; however, it also created a series of problems. Recently, Wang et al. [20] defined the levels of urban and rural development and the transformation of urban and rural coordination as three indicators to evaluate urbanization, with the objective of trying to improve the quality of urbanization from the aspects and reduce urban-rural conflict. However, as an important issue in the urbanization conflict, the data analysis and prediction have not been studied fully.In the context of the abovementioned issues, this paper proposes a new discrete GM (1,1) model, namely, the dynamic discrete GM (1,1) model, to predict the number of the urbanization conflict events in China. To do this, this paper develops two forms of the dynamic discrete GM (1,1) model which can be used to analyze realistic data that is either increasing or decreasing and propose two series of dynamic average values with an equal division technology. For the development coefficient and grey action parameter in the new grey models, this paper calculates them by combining the trapezoidal background formula with the least square method. Further, this paper develops heuristics and the method of valuing the equal division number. In recent years, group conflict occurred progressively which resulted from the acceleration of the urbanization process in China. Thus, this paper forecasts the number of urbanization conflict events in China based on the proposed dynamic discrete GM (1,1) model. The results show that the proposed model can be effectively used in this filed.In order to do that, this paper is organized as follows: the discrete GM (1,1) model and its background value are analyzed in Section2. Based on these, the convex and concave dynamic discrete GM (1,1) models are proposed and their properties are discussed in Section 3. In Section 4, the solution and optimization methods of the equal division number are analyzed. In Section 5, a practical example is provided to illustrate the proposed grey models. The paper ends with conclusions in Section 6.


## 2. Analysis of the Discrete GM (1,1) Model and the Background Value

The discrete GM (1,1) model is an important part of the grey system theory. This paper first analyzes the discrete GM (1,1) model proposed by Xie and Liu [3] and then studies its model calculation and construction process, based on which we provide the foundation for further dynamic discrete model construction.Let a nonnegative small sample sequenceX
(
0
)
=
(
x
(
0
)
(
1
)
,
x
(
0
)
(
2
)
,
…
,
x
(
0
)
(
n
)
) be the original data sequence, x
(
0
)
(
k
)
≥
0 and k
=
1,2
,
…
,
n. As a small sample sequence, n is generally small at n
≤
10. Then, X
1 is called the once accumulated generating operation (1-AGO) sequence of X
0, where X
(
1
)
=
(
x
(
1
)
(
1
)
,
x
(
1
)
(
2
)
,
…
,
x
(
1
)
(
n
)
) and(1)
x
1
k
=
∑
i
=
1
k
x
0
i
,
k
=
1,2
,
…
,
n
.Definition 1.
The original form of the GM (1,1) model is defined as(2)
x
0
k
+
a
x
1
k
=
b
,where x
(
0
)
(
k
)
≥
0 is the original data, x
(
1
)
(
k
) is the 1-AGO data, -
a is the developing coefficient, and b is the grey action parameter.Definition 2.
The average value form of GM (1,1) model is defined as(3)
x
0
k
+
a
z
1
k
=
b
,where x
(
0
)
(
k
)
≥
0 is the original data, z
(
1
)
(
k
) is the average value satisfied z
(
1
)
(
k
)
=
0.5
·
(
z
(
1
)
(
k
-
1
)
+
z
(
1
)
(
k
)
), -
a is the developing coefficient, and b is the grey action parameter.The original and average value forms of the GM (1,1) model are two difference equations, namely, (2) and (3), which can be estimated by the least square method. Their parameters estimated by the least square method satisfy the following condition: (4)
α
^
=
B
T
B
-
1
B
T
Y
,where α
^
=
(
a
,
b
)
T and (5)
Y
=
x
0
2
x
0
3
⋯
x
0
n
,
B
=
-
z
1
2
1
-
z
1
3
1
⋯
⋯
-
z
1
n
1
.Thus, we can obtain the parametersa and b.To improve the GM (1,1) model, many studies are presented to broaden the scope of the background value and improve its effectiveness. For example, Tan [21] developed a new method to construct the background value, namely, using the piecewise method. The fitting approaches in Luo et al. [22] and Liu et al. [23] are based on the use of the homogeneous exponent function and are applied to fit the cumulative sequence, which can be used to calculate the optimal background value. Based on this, b
/
a was fully considered in Liu et al. [23], and a new background value optimization formula was provided. Tang and Xiang [24] and Wang and Yang [25] used the two interpolation methods and the combination interpolation method to fit the background value, respectively; however, the calculation in both papers is complex. Moreover, Wang et al. [6] developed a generalized background value which can be used to depict other background values and presented as follows.Definition 3 (see [6]).
An optimal background value is defined as(6)
Z
1
k
=
x
0
k
ln
⁡
x
0
k
-
ln
⁡
x
0
k
-
1
+
x
0
k
-
1
k
x
0
k
k
-
2
x
0
k
-
1
-
x
0
k
,where x
(
0
)
(
k
)
≥
0 is the original data, z
(
1
)
(
k
) is the average value calculated from the complete homogeneous original data, and k
=
1,2
,
…
,
n.This background value can be combined with (6) to construct the optimal GM (1,1) model, which is called OGM (1,1) model.Further, we introduce the discrete GM (1,1) model and analyze it as follows.Definition 4 (see [3]).
The discrete GM (1,1) model, namely, DGM (1,1) model, is defined as(7)
x
1
k
+
1
=
β
1
x
1
k
+
β
2
,where x
(
1
)
(
k
) is the 1-AGO data, β
1 is the developing coefficient, and β
2 is the grey action parameter.In (7), if we substitute its original data and 1-AGO data, that is, x
(
0
)
(
k
+
1
)
=
x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
) and z
(
1
)
(
k
+
1
)
=
0.5
x
(
1
)
(
k
+
1
)
+
0.5
x
(
1
)
(
k
), into the average value forms of the GM (1,1) model (see (3)), we can get (8)
x
1
k
+
1
-
x
1
k
+
a
x
1
k
+
1
+
x
1
k
2
=
b
,
(9)
x
1
k
+
1
=
1
-
0.5
a
1
+
0.5
a
x
1
k
+
b
1
+
0.5
a
.Letβ
1
=
(
1
-
0.5
a
)
/
(
1
+
0.5
a
) and β
2
=
b
/
(
1
+
0.5
a
); then (9) can be obtained.According to the least square method, the parameter vector in (4) can be obtained. Here, z
(
1
)
(
k
) in (3) is the background value. By analyzing the structure of the discrete GM (1,1) model, it can be found that the form of the average value determines the form of the model and the precision of the model is determined by the accuracy of the average value. Therefore, in the following section, we use the segmentation method referred to in Tan [21] to develop a dynamic discrete GM (1,1) model to depict the index data, which will be better than the GM (1,1) model and the discrete GM (1,1) model.


## 3. Construction of the Dynamic Discrete GM (1,1) Model

In this section, we construct the convex and concave dynamic discrete GM (1,1) models based on a generalized dynamic average value. Then, we analyze some attractive properties of the dynamic discrete GM (1,1) models.


### 3.1. Construction of the Dynamic Average Value

The constructions of the average value and the background value are similar. They can be explained as follows: to construct a new average value (or a background value) by using the method of constructing the background value proposed in Tan [21]. The key point is that k
,
k
+
1 is divided into several rectangles equally, and the area of the curved surface is replaced by the area of the rectangles. Theoretically, there is a value of n (may not be the integer) that will make the area of n rectangles equal to the area of the curved surface. Then, in the process of constructing the new average value by using the equal division technology, we find two kinds of states: the original data increment and the original data decrement. The once accumulated sequence of the original data increment is a concave function (see Figure 1), and the once accumulated sequence of the original data decrement is a convex function (see Figure 2).Figure 1
The concave once accumulated sequence.Figure 2
The convex once accumulated sequence.For a sequence with different functional characteristics, the processes of average value construction are not the same. The specific steps are as follows.Step 1.
The interval of the once accumulated sequencek
,
k
+
1 is divided into n equal parts, and the length of every part is 1
/
n; then we can constitute n small rectangles.Step 2.
Calculate the height of first small rectangle by the following methods. When the once accumulated sequence has the characteristics of a concave function,x
1
k is regarded as the height of first small rectangle and x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
)
/
n is increased in turn; when the once accumulated sequence has the properties of a convex function, x
1
k
+
1 is considered to be the height of first small rectangle and then reduces x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
)
/
n in order. Thus, we can obtain the height of all small rectangles.Step 3.
Calculate the sum of the areas of the small rectangles which is regarded as the average value as follows. The height obtained from Step2 is multiplied by the equal width, and then we can obtain the area of each small rectangle. Then through the summation we can get the area of the curved surface of the once accumulated sequence, which is the average value.Theorem 5.
When the once accumulated sequence has the characteristic of the convex function, based on the equal division technology, the dynamic average value can be presented as(10)
t
n
1
k
+
1
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
,where x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, n is the equal division number of the interval k
,
k
+
1, and n represents the equal division number of t
n
1
(
k
+
1
).Proof.
As shown in Figure2, if the equal division number is n, then we can get (11)
x
i
=
x
1
k
+
1
-
n
-
i
n
x
1
k
+
1
-
x
1
k
,
i
=
1,2
,
n
-
1
,where x
i is the following i point of x
1
k.
By calculating the sum of the areas of the small rectangles, we have(12)
S
n
=
1
n
x
1
k
+
1
+
∑
i
=
1
n
-
1
x
i
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
.
Therefore, the average value of the convex once accumulated sequence in the discrete GM (1,1) model is(13)
t
n
1
k
+
1
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
.Theorem 6 (see [21]).
If the once accumulated sequence has the characteristic of the concave function, based on the equal division technology, the dynamic average value can be presented as(14)
t
n
1
k
+
1
=
1
2
n
n
-
1
x
1
k
+
1
+
n
+
1
x
1
k
,where x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, n is the equal division number of the interval k
,
k
+
1, and n represents the equal division number of t
n
1
(
k
+
1
).Based on Theorems5 and 6, the following definitions are provided.Definition 7.
The convex average value is defined as(15)
t
n
1
k
+
1
=
S
n
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
,where t
n
1
(
k
+
1
) is the convex average value, x
(
1
)
(
k
) is the 1-AGO data, and k
=
1,2
,
…
,
n.Definition 8.
The concave average value is defined as(16)
p
n
1
k
+
1
=
S
n
=
1
2
n
n
-
1
x
1
k
+
1
+
n
+
1
x
1
k
,where p
n
1
(
k
+
1
) is the concave average value, x
(
1
)
(
k
) is the 1-AGO data, and k
=
1,2
,
…
,
n.Both the convex average value and the concave average value are dynamic average values of the equal division numbern and can be used in the dynamic discrete GM (1,1) model.


### 3.2. The Concave and Convex Dynamic Discrete GM (1,1) Models

According to Theorems5 and 6, it is found that the two kinds of the average values mentioned above are dynamic with equal division interval. As compared to the previous expression of the average, the two values have more extensive adaptability and can fit the GM (1,1) model better. On the basis of the above definitions and theories, two new discrete grey models, namely, the convex and concave dynamic discrete GM (1,1) models, are proposed as follows.Definition 9.
The concave dynamic discrete GM (1,1) model is defined as(17)
x
1
k
+
1
=
2
n
-
a
n
+
1
2
n
+
a
n
-
1
x
1
k
+
2
n
b
2
n
+
a
n
-
1
,where x
(
1
)
(
k
) is the 1-AGO data, -
a is the developing coefficient, b is the grey action parameter, x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, and n is the equal division number.Definition 10.
The convex dynamic discrete GM (1,1) model is defined as(18)
x
1
k
+
1
=
2
n
-
a
n
-
1
2
n
+
a
n
+
1
x
1
k
+
2
n
b
2
n
+
a
n
+
1
,where x
(
1
)
(
k
) is the 1-AGO data, -
a is the developing coefficient, b is the grey action parameter, x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, and n is the equal division number.Theorem 11.
The restored function of the convex dynamic discrete GM (1,1) model can be presented as follows:(19)
x
^
0
k
+
1
=
-
2
n
a
2
n
-
a
n
-
1
x
0
1
-
b
a
2
n
-
a
n
-
1
2
n
+
a
n
+
1
k
,where a is the development coefficient, b is the grey action parameter, x
0
1 is the first original data, x
^
0
k
+
1 is the simulated value of original data of k
+
1, and n is the equal division number of the interval k
,
k
+
1.Proof.
If we substitutex
(
0
)
(
k
+
1
)
=
x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
) and t
n
1
(
k
+
1
)
=
n
-
1
x
(
1
)
(
k
)
+
n
+
1
x
(
1
)
(
k
+
1
)
/
2
n into the average value form of the GM (1,1) model, then we can get the convex dynamic discrete GM (1,1) model including the equal division number n as follows: (20)
x
1
k
+
1
-
x
1
k
+
a
2
n
n
+
1
x
1
k
+
1
+
n
-
1
x
1
k
=
b
.
Based on the computation method of the difference equation, we can calculate the time responded function, and then the restored function can be obtained as(21)
x
^
0
k
+
1
=
-
2
n
a
2
n
-
a
n
-
1
x
0
1
-
b
a
2
n
-
a
n
-
1
2
n
+
a
n
+
1
k
.
Thus, we complete the proof of Theorem11.Theorem 12.
The restored function of the concave dynamic discrete GM (1,1) model can be presented as follows:(22)
x
^
0
k
+
1
=
-
2
n
a
2
n
-
a
n
+
1
x
0
1
-
b
a
2
n
-
a
n
+
1
2
n
+
a
n
-
1
k
,where a is the development coefficient, b is the grey action parameter, x
0
1 is the first original data, x
^
0
k
+
1 is the simulated value of original data of k
+
1, and n is the equal division number of the interval k
,
k
+
1.Proof.
Similar to the proof of Theorem11, Theorem 12 can be obtained easily.These two types of dynamic discrete GM (1,1) model constitute the complete dynamic discrete GM (1,1) model. The concave dynamic discrete GM (1,1) model, the convex dynamic discrete GM (1,1) model, and their restored functions are the dynamic function of the equal division numbern. Furthermore, some desired properties of the two dynamic discrete GM (1,1) models are analyzed in the next subsection.


### 3.3. Some Properties of the Dynamic Discrete GM (1,1) Models

The above dynamic discrete GM (1,1) models are developed by introducing the improved average value. Therefore, they not only have original properties of the discrete GM (1,1) model but also have the following special characteristics.Property 1 (homogeneous exponential property).
The restored functions of the concave dynamic discrete GM (1,1) model and the convex dynamic discrete GM (1,1) model are homogeneous exponential functions.Proof.
(
1
) According to the restored function of the concave dynamic discrete GM (1,1) model, we can get (23)
σ
k
=
x
^
0
k
+
1
x
^
0
k
=
2
n
-
a
n
+
1
2
n
+
a
n
-
1
=
const
,
k
=
1,2
,
…
,
N
.
(
2
) According to the restored function of the convex dynamic discrete GM (1,1) model, we can get (24)
σ
k
=
x
^
0
k
+
1
x
^
0
k
=
2
n
-
a
n
-
1
2
n
+
a
n
+
1
=
const
,
k
=
1,2
,
…
,
N
.
Therefore, based on the expression of the restored functions of two dynamic discrete GM (1,1) models, that is, (23) and (24), it is found that they are two homogeneous exponential functions.Property 2 (isomorphic property).
The restored functions of the concave dynamic discrete GM (1,1) model and the convex dynamic discrete GM (1,1) model are isomorphic to the discrete GM (1,1) model.Proof.
Letσ
1
=
e
-
a, σ
2
=
(
1
-
0.5
a
)
/
(
1
+
0.5
a
), σ
3
=
(
2
n
-
a
n
+
1
)
/
(
2
n
+
a
n
-
1
), and σ
4
=
(
2
n
-
a
n
-
1
)
/
(
2
n
+
a
n
+
1
); we can get four specific restored functions as follows: (25)
x
^
0
k
=
1
-
σ
1
-
1
x
0
1
-
b
a
σ
1
k
-
1
,
x
^
0
k
=
1
-
σ
2
-
1
x
0
1
-
b
a
σ
2
k
-
1
,
x
^
0
k
=
1
-
σ
3
-
1
x
0
1
-
b
a
σ
3
k
-
1
,
x
^
0
k
=
1
-
σ
4
-
1
x
0
1
-
b
a
σ
4
k
-
1
.
Expandingσ
1, σ
2, σ
3, and σ
4 based on the Maclaurin formula, we can get(26)
σ
1
=
e
-
a
=
1
-
a
+
a
2
2
!
-
a
3
3
!
+
⋯
+
-
1
n
a
n
n
!
+
o
a
n
,
σ
2
=
1
-
0.5
a
1
+
0.5
a
=
1
-
a
+
a
2
2
-
a
3
2
2
+
⋯
+
-
1
n
a
n
2
n
-
1
+
o
a
n
.
Therefore, whena
→
0, σ
1 and σ
2 are equal; when a
→
0 and n
→
∞, σ
1, σ
2, σ
3, and σ
4 are equal. In other words, the restored functions of two dynamic discrete GM (1,1) models have the same structure as the restored function of the GM (1,1) model and the discrete GM (1,1) model.Property 3 (convertible property).
The concave and convex dynamic discrete GM (1,1) models can be transformed into the discrete GM (1,1) model.Proof.
Ifn
→
∞, then we have(27)
-
2
n
a
2
n
-
a
n
-
1
⟶
-
2
a
2
-
a
=
1
-
2
+
a
2
-
a
;
2
n
-
a
n
-
1
2
n
+
a
n
+
1
⟶
2
-
a
2
+
a
,
-
2
n
a
2
n
-
a
n
+
1
⟶
-
2
a
2
-
a
=
1
-
2
+
a
2
-
a
;
2
n
-
a
n
+
1
2
n
+
a
n
-
1
⟶
2
-
a
2
+
a
.Thus, whenn
→
∞, (17) and (18) can be transformed to the restored function of the discrete GM (1,1) model (see (7)).


## 3.1. Construction of the Dynamic Average Value

The constructions of the average value and the background value are similar. They can be explained as follows: to construct a new average value (or a background value) by using the method of constructing the background value proposed in Tan [21]. The key point is that k
,
k
+
1 is divided into several rectangles equally, and the area of the curved surface is replaced by the area of the rectangles. Theoretically, there is a value of n (may not be the integer) that will make the area of n rectangles equal to the area of the curved surface. Then, in the process of constructing the new average value by using the equal division technology, we find two kinds of states: the original data increment and the original data decrement. The once accumulated sequence of the original data increment is a concave function (see Figure 1), and the once accumulated sequence of the original data decrement is a convex function (see Figure 2).Figure 1
The concave once accumulated sequence.Figure 2
The convex once accumulated sequence.For a sequence with different functional characteristics, the processes of average value construction are not the same. The specific steps are as follows.Step 1.
The interval of the once accumulated sequencek
,
k
+
1 is divided into n equal parts, and the length of every part is 1
/
n; then we can constitute n small rectangles.Step 2.
Calculate the height of first small rectangle by the following methods. When the once accumulated sequence has the characteristics of a concave function,x
1
k is regarded as the height of first small rectangle and x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
)
/
n is increased in turn; when the once accumulated sequence has the properties of a convex function, x
1
k
+
1 is considered to be the height of first small rectangle and then reduces x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
)
/
n in order. Thus, we can obtain the height of all small rectangles.Step 3.
Calculate the sum of the areas of the small rectangles which is regarded as the average value as follows. The height obtained from Step2 is multiplied by the equal width, and then we can obtain the area of each small rectangle. Then through the summation we can get the area of the curved surface of the once accumulated sequence, which is the average value.Theorem 5.
When the once accumulated sequence has the characteristic of the convex function, based on the equal division technology, the dynamic average value can be presented as(10)
t
n
1
k
+
1
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
,where x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, n is the equal division number of the interval k
,
k
+
1, and n represents the equal division number of t
n
1
(
k
+
1
).Proof.
As shown in Figure2, if the equal division number is n, then we can get (11)
x
i
=
x
1
k
+
1
-
n
-
i
n
x
1
k
+
1
-
x
1
k
,
i
=
1,2
,
n
-
1
,where x
i is the following i point of x
1
k.
By calculating the sum of the areas of the small rectangles, we have(12)
S
n
=
1
n
x
1
k
+
1
+
∑
i
=
1
n
-
1
x
i
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
.
Therefore, the average value of the convex once accumulated sequence in the discrete GM (1,1) model is(13)
t
n
1
k
+
1
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
.Theorem 6 (see [21]).
If the once accumulated sequence has the characteristic of the concave function, based on the equal division technology, the dynamic average value can be presented as(14)
t
n
1
k
+
1
=
1
2
n
n
-
1
x
1
k
+
1
+
n
+
1
x
1
k
,where x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, n is the equal division number of the interval k
,
k
+
1, and n represents the equal division number of t
n
1
(
k
+
1
).Based on Theorems5 and 6, the following definitions are provided.Definition 7.
The convex average value is defined as(15)
t
n
1
k
+
1
=
S
n
=
1
2
n
n
-
1
x
1
k
+
n
+
1
x
1
k
+
1
,where t
n
1
(
k
+
1
) is the convex average value, x
(
1
)
(
k
) is the 1-AGO data, and k
=
1,2
,
…
,
n.Definition 8.
The concave average value is defined as(16)
p
n
1
k
+
1
=
S
n
=
1
2
n
n
-
1
x
1
k
+
1
+
n
+
1
x
1
k
,where p
n
1
(
k
+
1
) is the concave average value, x
(
1
)
(
k
) is the 1-AGO data, and k
=
1,2
,
…
,
n.Both the convex average value and the concave average value are dynamic average values of the equal division numbern and can be used in the dynamic discrete GM (1,1) model.


## 3.2. The Concave and Convex Dynamic Discrete GM (1,1) Models

According to Theorems5 and 6, it is found that the two kinds of the average values mentioned above are dynamic with equal division interval. As compared to the previous expression of the average, the two values have more extensive adaptability and can fit the GM (1,1) model better. On the basis of the above definitions and theories, two new discrete grey models, namely, the convex and concave dynamic discrete GM (1,1) models, are proposed as follows.Definition 9.
The concave dynamic discrete GM (1,1) model is defined as(17)
x
1
k
+
1
=
2
n
-
a
n
+
1
2
n
+
a
n
-
1
x
1
k
+
2
n
b
2
n
+
a
n
-
1
,where x
(
1
)
(
k
) is the 1-AGO data, -
a is the developing coefficient, b is the grey action parameter, x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, and n is the equal division number.Definition 10.
The convex dynamic discrete GM (1,1) model is defined as(18)
x
1
k
+
1
=
2
n
-
a
n
-
1
2
n
+
a
n
+
1
x
1
k
+
2
n
b
2
n
+
a
n
+
1
,where x
(
1
)
(
k
) is the 1-AGO data, -
a is the developing coefficient, b is the grey action parameter, x
1
k is the once accumulated data of k, x
1
k
+
1 is the once accumulated data of k
+
1, and n is the equal division number.Theorem 11.
The restored function of the convex dynamic discrete GM (1,1) model can be presented as follows:(19)
x
^
0
k
+
1
=
-
2
n
a
2
n
-
a
n
-
1
x
0
1
-
b
a
2
n
-
a
n
-
1
2
n
+
a
n
+
1
k
,where a is the development coefficient, b is the grey action parameter, x
0
1 is the first original data, x
^
0
k
+
1 is the simulated value of original data of k
+
1, and n is the equal division number of the interval k
,
k
+
1.Proof.
If we substitutex
(
0
)
(
k
+
1
)
=
x
(
1
)
(
k
+
1
)
-
x
(
1
)
(
k
) and t
n
1
(
k
+
1
)
=
n
-
1
x
(
1
)
(
k
)
+
n
+
1
x
(
1
)
(
k
+
1
)
/
2
n into the average value form of the GM (1,1) model, then we can get the convex dynamic discrete GM (1,1) model including the equal division number n as follows: (20)
x
1
k
+
1
-
x
1
k
+
a
2
n
n
+
1
x
1
k
+
1
+
n
-
1
x
1
k
=
b
.
Based on the computation method of the difference equation, we can calculate the time responded function, and then the restored function can be obtained as(21)
x
^
0
k
+
1
=
-
2
n
a
2
n
-
a
n
-
1
x
0
1
-
b
a
2
n
-
a
n
-
1
2
n
+
a
n
+
1
k
.
Thus, we complete the proof of Theorem11.Theorem 12.
The restored function of the concave dynamic discrete GM (1,1) model can be presented as follows:(22)
x
^
0
k
+
1
=
-
2
n
a
2
n
-
a
n
+
1
x
0
1
-
b
a
2
n
-
a
n
+
1
2
n
+
a
n
-
1
k
,where a is the development coefficient, b is the grey action parameter, x
0
1 is the first original data, x
^
0
k
+
1 is the simulated value of original data of k
+
1, and n is the equal division number of the interval k
,
k
+
1.Proof.
Similar to the proof of Theorem11, Theorem 12 can be obtained easily.These two types of dynamic discrete GM (1,1) model constitute the complete dynamic discrete GM (1,1) model. The concave dynamic discrete GM (1,1) model, the convex dynamic discrete GM (1,1) model, and their restored functions are the dynamic function of the equal division numbern. Furthermore, some desired properties of the two dynamic discrete GM (1,1) models are analyzed in the next subsection.


## 3.3. Some Properties of the Dynamic Discrete GM (1,1) Models

The above dynamic discrete GM (1,1) models are developed by introducing the improved average value. Therefore, they not only have original properties of the discrete GM (1,1) model but also have the following special characteristics.Property 1 (homogeneous exponential property).
The restored functions of the concave dynamic discrete GM (1,1) model and the convex dynamic discrete GM (1,1) model are homogeneous exponential functions.Proof.
(
1
) According to the restored function of the concave dynamic discrete GM (1,1) model, we can get (23)
σ
k
=
x
^
0
k
+
1
x
^
0
k
=
2
n
-
a
n
+
1
2
n
+
a
n
-
1
=
const
,
k
=
1,2
,
…
,
N
.
(
2
) According to the restored function of the convex dynamic discrete GM (1,1) model, we can get (24)
σ
k
=
x
^
0
k
+
1
x
^
0
k
=
2
n
-
a
n
-
1
2
n
+
a
n
+
1
=
const
,
k
=
1,2
,
…
,
N
.
Therefore, based on the expression of the restored functions of two dynamic discrete GM (1,1) models, that is, (23) and (24), it is found that they are two homogeneous exponential functions.Property 2 (isomorphic property).
The restored functions of the concave dynamic discrete GM (1,1) model and the convex dynamic discrete GM (1,1) model are isomorphic to the discrete GM (1,1) model.Proof.
Letσ
1
=
e
-
a, σ
2
=
(
1
-
0.5
a
)
/
(
1
+
0.5
a
), σ
3
=
(
2
n
-
a
n
+
1
)
/
(
2
n
+
a
n
-
1
), and σ
4
=
(
2
n
-
a
n
-
1
)
/
(
2
n
+
a
n
+
1
); we can get four specific restored functions as follows: (25)
x
^
0
k
=
1
-
σ
1
-
1
x
0
1
-
b
a
σ
1
k
-
1
,
x
^
0
k
=
1
-
σ
2
-
1
x
0
1
-
b
a
σ
2
k
-
1
,
x
^
0
k
=
1
-
σ
3
-
1
x
0
1
-
b
a
σ
3
k
-
1
,
x
^
0
k
=
1
-
σ
4
-
1
x
0
1
-
b
a
σ
4
k
-
1
.
Expandingσ
1, σ
2, σ
3, and σ
4 based on the Maclaurin formula, we can get(26)
σ
1
=
e
-
a
=
1
-
a
+
a
2
2
!
-
a
3
3
!
+
⋯
+
-
1
n
a
n
n
!
+
o
a
n
,
σ
2
=
1
-
0.5
a
1
+
0.5
a
=
1
-
a
+
a
2
2
-
a
3
2
2
+
⋯
+
-
1
n
a
n
2
n
-
1
+
o
a
n
.
Therefore, whena
→
0, σ
1 and σ
2 are equal; when a
→
0 and n
→
∞, σ
1, σ
2, σ
3, and σ
4 are equal. In other words, the restored functions of two dynamic discrete GM (1,1) models have the same structure as the restored function of the GM (1,1) model and the discrete GM (1,1) model.Property 3 (convertible property).
The concave and convex dynamic discrete GM (1,1) models can be transformed into the discrete GM (1,1) model.Proof.
Ifn
→
∞, then we have(27)
-
2
n
a
2
n
-
a
n
-
1
⟶
-
2
a
2
-
a
=
1
-
2
+
a
2
-
a
;
2
n
-
a
n
-
1
2
n
+
a
n
+
1
⟶
2
-
a
2
+
a
,
-
2
n
a
2
n
-
a
n
+
1
⟶
-
2
a
2
-
a
=
1
-
2
+
a
2
-
a
;
2
n
-
a
n
+
1
2
n
+
a
n
-
1
⟶
2
-
a
2
+
a
.Thus, whenn
→
∞, (17) and (18) can be transformed to the restored function of the discrete GM (1,1) model (see (7)).


## 4. Solution and Optimization of the Equal Division Number

Definitions9 and 10 give two complete dynamic discrete GM (1,1) models but they raise a puzzle, that is, how to design a suitable equal division number n, which can be used to calculate the simulation values and the prediction values based on (19) and (22) with less error and bigger fitting and prediction accuracies. In order to do this, this paper proposes two new methods, namely, the gradually heuristics method and the dichotomy method, and uses them to calculate the optimal equal division number n.(
1) The Gradually Heuristics MethodStep 1.
Based on (19) and (22), we can find that parameters a and b should be solved before the calculation of equal division number n. However, the background values z
1
k are required to obtain a and b. Thus, the first step is the calculation of background values by z
1
k
=
x
1
k
+
x
1
k
-
1
/
2, where k
=
2,3
,
…
,
n.Step 2.
If the background valuesz
1
k are obtained, then we can calculate the parameter vector based on (5) by using the least square method. Then, the development coefficient a and the grey action parameter b can be got.Step 3.
Analyzeσ
k
=
x
1
k
+
1
/
x
1
k and judge the characteristic of the 1-AGO sequence. If σ
k is increasing, the 1-AGO sequence belongs to a concave function; if σ
k is diminishing, the 1-AGO sequence belongs to a convex function.Step 4.
Construct the dynamic discrete GM (1,1) model as follows. If the 1-AGO sequence is concave, we puta and b into (17) to construct the concave dynamic discrete GM (1,1) model. Here, parameters a and b are calculated by Step 2. If the 1-AGO sequence is convex, we put a and b into (18), to construct the convex dynamic discrete GM (1,1) model.Step 5.
Calculate the simulation values according to the following method. Take different values (starting with an appropriate value) to solve the discrete GM (1,1) model with different equal division numbersn, and then obtain the corresponding simulated sequence X
^
n
0
k.Step 6.
Calculate the average absolute error. This value is calculated as a percentage of the relative error generated from each actual data and its fitting value based on the formular
-
n
=
∑
k
=
1
N
(
x
0
(
k
)
-
x
^
0
(
k
)
)
/
x
(
0
)
(
k
)
/
N.Step 7.
Determine the equal division numbern based on the following principle. If r
-
n is increasing, then n is the equal division number, which is more suitable to the original sequence than the interval equal value. Then put it into (16) or (22); we can get the dynamic discrete GM (1,1) model.(
2) The Dichotomy Method. Parameter n solved by the gradual heuristics is an integer; however, the best equal division number is often not an integer; it can be further optimized. According to the calculation process of the gradual heuristics, we can find that there is only one extreme (the least error) in the vicinity of n. Thus, we can use the dichotomy method to further subdivide the integer n to meet the accuracy requirements. The corresponding steps are described as follows.Step 1.
Calculate the equal interval as follows. Based on parametern obtained by the gradual heuristics method, we can extract the interval n
-
1
,
n
+
1 and then divide it into n
-
1
,
n and n
,
n
+
1.Step 2.
Calculate the midpoint value of the average error. The midpoint values of the two intervalsn
1
=
n
-
1
+
n
/
2 and n
2
=
n
+
n
+
1
/
2 are substituted into the average absolute error formula separately to calculate the average absolute error rates.Step 3.
Examine the average errors. Ifr
-
1
<
r
-
n
<
r
-
2 (or r
-
2
<
r
-
n
<
r
-
1), then the interval decreases to [
n
-
1
,
n
] (or [
n
,
n
+
1
]); if r
-
n
<
r
-
1
,
r
-
n
<
r
-
2, then the interval decreases to [(
(
n
-
1
)
+
n
)
/
2
,
(
n
+
(
n
+
1
)
)
/
2].Step 4.
Optimize the equal division numbern. If the new interval is obtained under the conditions r
-
n
<
r
-
1 and r
-
n
<
r
-
2, the process from Step 2 to Step 4 is repeated. Otherwise, the new interval would be regarded as a dichotomy interval, and the process from Step 1 to Step 4 would need to be repeated until the required accuracy is obtained.Thus, we provide two approaches to solve the equal division number, namely, the gradually heuristics method and the dichotomy method, which is a key parameter in the proposed dynamic discrete GM (1,1) model. Of course, the corresponding optimization processes are given. On the basis of the aforementioned approaches, two new dynamic discrete GM (1,1) models can be used to predict the simple sample. In the following section, we provide a practical case to demonstrate its effectiveness and superiority.


## 5. Application of the Dynamic Discrete GM (1,1) Model in Urbanization Conflict Events

Urbanization is an important indicator of a country’s development. In recent years, Chinese urbanization and economic development have made significant progress. However, Chinese urbanization also brought a series of contradictions and challenges. Among them, the conflict of urbanization has been intensified and the social contradictions have been highlighted. Tens of thousands of the group conflicts have taken place because of various social contradictions in China. Mass incidents caused by urbanization have increasingly become the focus of social attention and have become an important factor affecting the healthy development of China’s economic. Social conflicts caused by the process of urbanization are the negative factors and could destroy the preexisting social stability. If they cannot be effectively resolved, the contradiction could have a greater detrimental effect and have a serious impact on China’s urbanization process of project construction and social stability. Among them, the group conflict events caused by land requisition, demolition, and environmental problems of the urbanization in China constitute the majority of conflict events.In this paper, we mainly focus on the study of land requisition, demolition, and environmental issues and fitting and forecasting the group conflict events in China’s urbanization. As the Chinese statistical system is developed fairly late, there is a serious lack of relevant data. The policies often exhibit cyclical change and the data shows a periodic irregular trend. Thus, the grey prediction model based on the limited samples can effectively deal with the above problem. Therefore, this paper uses the fitting of the dynamic discrete GM (1,1) models to predict the number of the urbanization conflict events in China and analyzes social problems that presently exist in China. Since the use of the proposed dynamic discrete GM (1,1) models is consistent, this paper only uses the concave dynamic discrete GM (1,1) model to predict the number of the urbanization conflict events, based on which the optimization of the dynamic discrete GM (1,1) models is further analyzed.


### 5.1. Prediction of the Number of Urbanization Conflict Events in China

According to statistics from the Chinese Federation of Labour and the Blue Book of the Chinese Academy of Social Sciences, conflict events involving more than 30 people in the process of urbanization in 2008–2014 in China are shown in Table1 and the data trend is depicted in Figure 3. Among them, the selection of the conflicts is based on two aspects: the land acquisition and the environment.Table 1
Statistics of conflict events from 2008 to 2014 in China.
Years
2008
2009
2010
2011
2012
2013
2014
Pieces
129
132
151
172
189
184
192
Data from the Chinese  Federation of Labour and the Blue Book of the Chinese Academy of Social Sciences.Figure 3
The original data of conflict events in 2008–2014 in China.Using conflict events in 2008–2013 as modeling data to simulate these six data points, we can predict the number of group conflict events that may occur in 2014. From the original data in Table1, the number of group conflict events increased during 2008–2013, except 2013. This means that the marginal growth rate of the 1-AGO sequence is increased. Therefore, the concave dynamic discrete GM (1,1) model is more suitable than the convex one. Thus, in this empirical example, the concave dynamic discrete GM (1,1) model is selected and is used to make comparisons with other GM (1,1) models.According toα
^
=
(
B
T
B
)
-
1
B
T
Y, we can get the development coefficient and grey action parameter of the GM (1,1) model (GM model), the discrete GM (1,1) model (DGM model), and the concave dynamic discrete GM (1,1) model (EDDGM model) as follows: -
a
=
0.083 and b
=
122.96. The development coefficient and grey action parameter of the optimal GM (1,1) model (OGM model) are -
a
=
0.057 and b
=
133.94. These results are shown in Table 2.Table 2
Comparison between predicted and actual value of four models.
Years
Actual value
DGM model
GM model
OGM model
EDDGM model
2009
132
139.42
139.34
145.37
139.81
2010
151
151.48
151.38
153.87
153.24
2011
172
164.57
164.46
162.88
166.18
2012
189
178.81
178.67
172.41
171.63
2013
184
194.25
194.11
182.51
181.63
2014
192
211.05
210.87
193.18
192.22We further calculate the average relative error and prediction relative error of the four models, and the calculation results are shown in Tables3 and 4. Moreover, Figure 4 provides the one-to-one comparison between the fitting and actual values using four models. Figures 5 and 6 present the visual difference.Table 3
Average relative fitting errors of four models.
Error category
DGM model
GM model
OGM model
EDDGM model
Average overall error (%)
5.19
5.16
4.59
3.56Table 4
Relative prediction errors of four models.
Error category
DGM model
GM model
OGM model
EDDGM model
Predictive error (%)
9.92
9.83
0.61
0.12Figure 4
Comparison between the fitting and actual values using four models.Figure 5
Average relative fitting errors of four models.Figure 6
Prediction relative errors of four models.Based on Tables2–4 and Figures 4–6, it can be found that the concave dynamic discrete GM (1,1) model obtains best results as compared to the GM (1,1) model, the discrete GM (1,1) model, and the optimized GM (1,1) model.


### 5.2. Comparison and Analysis

Section5.1 analyzes the fitting effect of conflict events in the process of urbanization in China based on several kinds of grey prediction models. Among them, the optimal result obtained by the concave dynamic discrete GM (1,1) model is the best.According to the results of the concave dynamic discrete GM (1,1) model, it can be found that urbanization group conflict intensified day by day in China and social contradictions gradually increased. China’s urbanization policy has presented many problems at the present stage and the government should take measures to solve these problems.Thus, based on the fitting and predicted data, we provide some results and suggestions from the following three aspects.(
1) Constructing the Mechanism of Interest Integration. Through a variety of ways of achieving the expression of different levels of interest and consultation dialogue, we format a relatively stable and reasonable interest structure based on the special interests and values of different social strata in China. For reducing urbanization conflict and the maintenance of social fairness and justice, a balanced allocation of institutional arrangements should be carried out from the three aspects of society, market, and government.(
2) Improving Prevention and Disposal Mechanism. The government should establish the reasonable and effective mechanisms to resolve social contradictions and prevent the accumulation and intensification of social contradictions. Simultaneously, the government should improve the emergency response mechanism and purposefully guide the public.(
3) Participating in Collaborative Governance. The government should make full use of the supervisory function of public media in urbanization conflict management, enhance the function of informal organization to reflect demand, coordinate communication in the conflict, and foster the trust and tolerance of social capital in the governance of group incidents.


## 5.1. Prediction of the Number of Urbanization Conflict Events in China

According to statistics from the Chinese Federation of Labour and the Blue Book of the Chinese Academy of Social Sciences, conflict events involving more than 30 people in the process of urbanization in 2008–2014 in China are shown in Table1 and the data trend is depicted in Figure 3. Among them, the selection of the conflicts is based on two aspects: the land acquisition and the environment.Table 1
Statistics of conflict events from 2008 to 2014 in China.
Years
2008
2009
2010
2011
2012
2013
2014
Pieces
129
132
151
172
189
184
192
Data from the Chinese  Federation of Labour and the Blue Book of the Chinese Academy of Social Sciences.Figure 3
The original data of conflict events in 2008–2014 in China.Using conflict events in 2008–2013 as modeling data to simulate these six data points, we can predict the number of group conflict events that may occur in 2014. From the original data in Table1, the number of group conflict events increased during 2008–2013, except 2013. This means that the marginal growth rate of the 1-AGO sequence is increased. Therefore, the concave dynamic discrete GM (1,1) model is more suitable than the convex one. Thus, in this empirical example, the concave dynamic discrete GM (1,1) model is selected and is used to make comparisons with other GM (1,1) models.According toα
^
=
(
B
T
B
)
-
1
B
T
Y, we can get the development coefficient and grey action parameter of the GM (1,1) model (GM model), the discrete GM (1,1) model (DGM model), and the concave dynamic discrete GM (1,1) model (EDDGM model) as follows: -
a
=
0.083 and b
=
122.96. The development coefficient and grey action parameter of the optimal GM (1,1) model (OGM model) are -
a
=
0.057 and b
=
133.94. These results are shown in Table 2.Table 2
Comparison between predicted and actual value of four models.
Years
Actual value
DGM model
GM model
OGM model
EDDGM model
2009
132
139.42
139.34
145.37
139.81
2010
151
151.48
151.38
153.87
153.24
2011
172
164.57
164.46
162.88
166.18
2012
189
178.81
178.67
172.41
171.63
2013
184
194.25
194.11
182.51
181.63
2014
192
211.05
210.87
193.18
192.22We further calculate the average relative error and prediction relative error of the four models, and the calculation results are shown in Tables3 and 4. Moreover, Figure 4 provides the one-to-one comparison between the fitting and actual values using four models. Figures 5 and 6 present the visual difference.Table 3
Average relative fitting errors of four models.
Error category
DGM model
GM model
OGM model
EDDGM model
Average overall error (%)
5.19
5.16
4.59
3.56Table 4
Relative prediction errors of four models.
Error category
DGM model
GM model
OGM model
EDDGM model
Predictive error (%)
9.92
9.83
0.61
0.12Figure 4
Comparison between the fitting and actual values using four models.Figure 5
Average relative fitting errors of four models.Figure 6
Prediction relative errors of four models.Based on Tables2–4 and Figures 4–6, it can be found that the concave dynamic discrete GM (1,1) model obtains best results as compared to the GM (1,1) model, the discrete GM (1,1) model, and the optimized GM (1,1) model.


## 5.2. Comparison and Analysis

Section5.1 analyzes the fitting effect of conflict events in the process of urbanization in China based on several kinds of grey prediction models. Among them, the optimal result obtained by the concave dynamic discrete GM (1,1) model is the best.According to the results of the concave dynamic discrete GM (1,1) model, it can be found that urbanization group conflict intensified day by day in China and social contradictions gradually increased. China’s urbanization policy has presented many problems at the present stage and the government should take measures to solve these problems.Thus, based on the fitting and predicted data, we provide some results and suggestions from the following three aspects.(
1) Constructing the Mechanism of Interest Integration. Through a variety of ways of achieving the expression of different levels of interest and consultation dialogue, we format a relatively stable and reasonable interest structure based on the special interests and values of different social strata in China. For reducing urbanization conflict and the maintenance of social fairness and justice, a balanced allocation of institutional arrangements should be carried out from the three aspects of society, market, and government.(
2) Improving Prevention and Disposal Mechanism. The government should establish the reasonable and effective mechanisms to resolve social contradictions and prevent the accumulation and intensification of social contradictions. Simultaneously, the government should improve the emergency response mechanism and purposefully guide the public.(
3) Participating in Collaborative Governance. The government should make full use of the supervisory function of public media in urbanization conflict management, enhance the function of informal organization to reflect demand, coordinate communication in the conflict, and foster the trust and tolerance of social capital in the governance of group incidents.


## 6. Conclusions

Urbanization conflict is an important issue in China and needs to be solved as soon as possible. It is a reflection of the contradiction of interests, which exposes the serious shortage of Chinese local governments and organizations in management and decision-making. As the data is lacking and changes periodically, this paper has proposed the dynamic discrete GM (1,1) model based on the discrete GM (1,1) model and an improved equal division number. Two optimal dynamic discrete GM (1,1) models are obtained based on the gradual heuristic method and the dichotomy method. According to the characters of the dynamic discrete GM (1,1) models, we have selected the urbanization conflict events in China as the object for prediction. Empirical results show that the rapid process of urbanization aggravates social conflicts in China. Finally, according to the problems exposed in the urbanization process in China, we have provided three suggestions for the promotion of urbanization construction in China. The dynamic discrete GM (1,1) models proposed in this paper can be used to solve the problem of the periodic irregular change in the sequence better than the GM (1,1) model, the optimal GM (1,1) model, and discrete GM (1,1) model.



---

*Source: 3861825-2016-06-13.xml*