Analyzing Levels of Concern About Joint Punishment for Dishonesty Using the Visibility Graph Network

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

Joint punishment for dishonesty is an important means of administrative regulation. This research analyzed the dynamic characteristics of time series data from the Baidu search index using the keywords “joint punishment for dishonesty” based on a visibility graph network. Applying a visibility graph algorithm, time series data from the Baidu Index was transformed into complex networks, with parameters calculated to analyze the topological structure. Results showed differences in the use of joint punishment for dishonesty in certain provinces by calculating the parameters of the time series network from January 1, 2020 to May 27, 2021; it was also shown that most of the networks were scale-free. Finally, the results of K-means clustering showed that the 31 provinces (excluding Hong Kong, Macao and Taiwan) can be divided into four types. Meanwhile, by analyzing the national Baidu Index data from 2020 to May 2021, the period of the time series data and the influence range of the central node were found.

Cite

CITATION STYLE

APA

Qu, Z., Zhang, Y., & Li, F. (2021). Analyzing Levels of Concern About Joint Punishment for Dishonesty Using the Visibility Graph Network. Frontiers in Physics, 9. https://doi.org/10.3389/fphy.2021.746660

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free