Jian-Guo Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jian-Guo Liu has a total of 127 co-authors. Here are the top co-authors by number of shared publications:
Qiang Guo
Business School, University of Shanghai for Science and Technology 2 , Shanghai 200093
37 shared publications- Tao Zhou
Center for Pure Mathematics, School of Mathematical Sciences, Anhui University, Hefei 230601, Anhui, China
9 shared publications Yi-Cheng Zhang
Fribourg Univ, Dept Phys, CH-1700 Fribourg, Switzerland
7 shared publicationsJing-Ti Han
Institute of Fintech Shanghai University of Finance and Economics 200433 Shanghai PR China
6 shared publicationsRen-De Li
Library and Business School, University of Shanghai for Science and Technology, Shanghai, China
6 shared publications- Qiang Guo
Business School, University of Shanghai for Science and Technology, Shanghai 200093, P. R. China
5 shared publications
Latest Publications
- 1 April 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (4)
Continuous growth of social polarization for scale-free networks
Understanding how local interactions generate social polarization is a central challenge in the study of collective dynamics. Prior work has established that homophily and social balance can trigger a first-order phase transition to polarization in homogeneous small-world networks. However, real-world social networks are structurally heterogeneous, featuring power-law degree distributions dominated by a few highly connected hubs. In this study, we investigate how this structural heterogeneity affects polarization dynamics by introducing the co-evolutionary opinion model on scale-free networks generated via a modified Holme–Kim model. We find that, in contrast to the discontinuous transition in small-world networks, social polarization for scale-free networks grows continuously with increasing connectivity, emerging earlier but reaching a lower magnitude. Individual-level analysis reveals that polarization is a hierarchical process concentrated among large-degree hubs, while most peripheral nodes remain weakly polarized. Counterfactual experiments demonstrate that neutralizing only the top 5% of large-degree nodes is sufficient to suppress system-wide polarization to the random baseline. Our findings reveal that network topology fundamentally alters the nature of polarization transitions and suggest that targeted interventions on influential nodes may be more effective than broad-based approaches for managing social polarization in heterogeneous societies.
- 1 April 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (4)
Continuous growth of social polarization for scale-free networks
Understanding how local interactions generate social polarization is a central challenge in the study of collective dynamics. Prior work has established that homophily and social balance can trigger a first-order phase transition to polarization in homogeneous small-world networks. However, real-world social networks are structurally heterogeneous, featuring power-law degree distributions dominated by a few highly connected hubs. In this study, we investigate how this structural heterogeneity affects polarization dynamics by introducing the co-evolutionary opinion model on scale-free networks generated via a modified Holme–Kim model. We find that, in contrast to the discontinuous transition in small-world networks, social polarization for scale-free networks grows continuously with increasing connectivity, emerging earlier but reaching a lower magnitude. Individual-level analysis reveals that polarization is a hierarchical process concentrated among large-degree hubs, while most peripheral nodes remain weakly polarized. Counterfactual experiments demonstrate that neutralizing only the top 5% of large-degree nodes is sufficient to suppress system-wide polarization to the random baseline. Our findings reveal that network topology fundamentally alters the nature of polarization transitions and suggest that targeted interventions on influential nodes may be more effective than broad-based approaches for managing social polarization in heterogeneous societies.
- 1 January 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (1)
Leader-driven social network reconstruction
Understanding how opinion leader characteristics influence network reconstruction represents a critical challenge in computational social science. This study presents a novel framework integrating leader-driven opinion dynamics with compressive sensing, systematically investigating how node centrality, initial opinion, acceptance rate, and opinion homogeneity affect reconstruction accuracy. The extensive experimental results for three real-world networks and three synthetic models show that leaders with lower centrality consistently outperform highly central nodes in network reconstruction. This occurs because high centrality leaders create rapid opinion convergence, reducing the informational diversity essential for accurate reconstruction, while lower centrality leaders preserve richer signal content. Our analysis shows that extremely conservative leaders (o=0.0) with high stubbornness (α=1.0) achieve optimal performance in moderately tolerant communities (ε=0.5), challenging conventional centrality-based leader selection strategies. These findings indicate that effective opinion leadership for network reconstruction requires consideration of dynamics-specific factors beyond traditional structural importance, with significant implications for marketing, public health interventions, and crisis communication applications.
- 1 January 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (1)
Leader-driven social network reconstruction
Understanding how opinion leader characteristics influence network reconstruction represents a critical challenge in computational social science. This study presents a novel framework integrating leader-driven opinion dynamics with compressive sensing, systematically investigating how node centrality, initial opinion, acceptance rate, and opinion homogeneity affect reconstruction accuracy. The extensive experimental results for three real-world networks and three synthetic models show that leaders with lower centrality consistently outperform highly central nodes in network reconstruction. This occurs because high centrality leaders create rapid opinion convergence, reducing the informational diversity essential for accurate reconstruction, while lower centrality leaders preserve richer signal content. Our analysis shows that extremely conservative leaders (o=0.0) with high stubbornness (α=1.0) achieve optimal performance in moderately tolerant communities (ε=0.5), challenging conventional centrality-based leader selection strategies. These findings indicate that effective opinion leadership for network reconstruction requires consideration of dynamics-specific factors beyond traditional structural importance, with significant implications for marketing, public health interventions, and crisis communication applications.
- 30 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Identifying important nodes based on local and global information
- 30 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Identifying important nodes based on local and global information
- 4 December 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 267
Identification of perceptive users based on the graph convolutional network
- 4 December 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 267
Identification of perceptive users based on the graph convolutional network
- Open Access
- 19 June 2024
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 12, 1420556
Effect of network structure on the accuracy of resilience dimension reduction
Dimension reduction is an effective method for system’s resilience analysis. In this paper, we investigate the effect of network structure on the accuracy of resilience dimension reduction. First, we introduce the resilience dimension reduction method and define the evaluation indicator of the resilience dimension reduction method. Then, by adjusting node connections, preferential connection mechanisms, and connection probabilities, we generate artificial networks, small-world networks and social networks with tunable assortativity coefficients, average clustering coefficients, and modularities, respectively. Experimental results for the gene regulatory dynamics show that the network structures with positive assortativity, large clustering coefficient, and significant community can enhance the accuracy of resilience dimension reduction. The result of this paper indicates that optimizing network structure can enhance the accuracy of resilience dimension reduction, which is of great significance for system resilience analysis and provides a new perspective and theoretical basis for selecting dimension reduction methods in system resilience analysis.
- 19 June 2024
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 12, 1420556
Open AccessEffect of network structure on the accuracy of resilience dimension reduction
Dimension reduction is an effective method for system’s resilience analysis. In this paper, we investigate the effect of network structure on the accuracy of resilience dimension reduction. First, we introduce the resilience dimension reduction method and define the evaluation indicator of the resilience dimension reduction method. Then, by adjusting node connections, preferential connection mechanisms, and connection probabilities, we generate artificial networks, small-world networks and social networks with tunable assortativity coefficients, average clustering coefficients, and modularities, respectively. Experimental results for the gene regulatory dynamics show that the network structures with positive assortativity, large clustering coefficient, and significant community can enhance the accuracy of resilience dimension reduction. The result of this paper indicates that optimizing network structure can enhance the accuracy of resilience dimension reduction, which is of great significance for system resilience analysis and provides a new perspective and theoretical basis for selecting dimension reduction methods in system resilience analysis.
- 28 May 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 36 (10)
The effect of theme on the number of celebrity active fans under China Weibo data
Online social media platforms have emerged as integral channels for facilitating social interactions, with celebrities utilizing these platforms to engage with their fan base and cultivate a substantial following. The group of engaged fans, commonly referred to as “active fans”, represents individuals who actively communicate with celebrities and actively participate in discussions pertaining to the celebrities’ endeavors. For celebrities, the task of retaining and augmenting the count of active fans holds immense significance, as it significantly amplifies their social impact and commercial value. Here, we construct dynamic weighted active fan networks by leveraging data from 2021 on Sina Weibo, which stands as China’s largest social media platform. Through a comparative analysis encompassing the network’s structure, the growth rate and the duration of active fans, we delve into the influence wielded by six distinct thematic categories, endorsement, variety, public welfare, sports, music and national affairs. This analysis covers a cohort of nine celebrities spanning five diverse domains, including actors, singers, online influencers, anchors and athletes. The growth trajectory and life cycle exhibited by celebrity fans exhibit notable variations, both within and across the aforementioned themes. These dynamics are further influenced by the inherent structural attributes of the personal fan network belonging to each celebrity. Employing the K-Shape time series clustering algorithm, we have undertaken an in-depth exploration of outburst growth patterns observed in active fans and determined the optimal value of the number of clusters to be [ ] through comparative analysis. Our findings underscore that the themes of endorsement and public welfare exhibit all four growth patterns, namely Double-Peak, Oscillatory, Single-Peak and Continuous Growth Patterns. In contrast, when considering all themes collectively, they collectively demonstrate a single-peaked decaying growth pattern the insights gleaned from this study not only serve as a valuable reference and guide for celebrities across diverse domains who aspire to bolster and augment their social influence but also contribute to the burgeoning fan economy. Moreover, this research introduces novel perspectives and insights for scrutinizing patterns of fan growth and their corresponding dynamics.
- 28 May 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 36 (10)
The effect of theme on the number of celebrity active fans under China Weibo data
Online social media platforms have emerged as integral channels for facilitating social interactions, with celebrities utilizing these platforms to engage with their fan base and cultivate a substantial following. The group of engaged fans, commonly referred to as “active fans”, represents individuals who actively communicate with celebrities and actively participate in discussions pertaining to the celebrities’ endeavors. For celebrities, the task of retaining and augmenting the count of active fans holds immense significance, as it significantly amplifies their social impact and commercial value. Here, we construct dynamic weighted active fan networks by leveraging data from 2021 on Sina Weibo, which stands as China’s largest social media platform. Through a comparative analysis encompassing the network’s structure, the growth rate and the duration of active fans, we delve into the influence wielded by six distinct thematic categories, endorsement, variety, public welfare, sports, music and national affairs. This analysis covers a cohort of nine celebrities spanning five diverse domains, including actors, singers, online influencers, anchors and athletes. The growth trajectory and life cycle exhibited by celebrity fans exhibit notable variations, both within and across the aforementioned themes. These dynamics are further influenced by the inherent structural attributes of the personal fan network belonging to each celebrity. Employing the K-Shape time series clustering algorithm, we have undertaken an in-depth exploration of outburst growth patterns observed in active fans and determined the optimal value of the number of clusters to be [ ] through comparative analysis. Our findings underscore that the themes of endorsement and public welfare exhibit all four growth patterns, namely Double-Peak, Oscillatory, Single-Peak and Continuous Growth Patterns. In contrast, when considering all themes collectively, they collectively demonstrate a single-peaked decaying growth pattern the insights gleaned from this study not only serve as a valuable reference and guide for celebrities across diverse domains who aspire to bolster and augment their social influence but also contribute to the burgeoning fan economy. Moreover, this research introduces novel perspectives and insights for scrutinizing patterns of fan growth and their corresponding dynamics.
- 1 April 2024
- Published by Oxford University Press (OUP) in Europhysics Letters
- Vol. 146 (2) , 21001
Advanced progress of network resilience
Network resilience measures complex systems’ ability to adjust its activity to retain the basic functionality for systematic errors or failures, which has attracted increasingly attention from various fields. Resilience analyses play an important role for early warning, prediction, and proposing potential strategies or designing optimal resilience systems. This letter reviews the advanced progress of network resilience from three aspects: Resilience measurement, resilience analysis, as well as resilience recovery strategies. We outline the challenges of network resilience which should be investigated in the future.
- 1 April 2024
- Published by Oxford University Press (OUP) in Europhysics Letters
- Vol. 146 (2) , 21001
Advanced progress of network resilience
Network resilience measures complex systems’ ability to adjust its activity to retain the basic functionality for systematic errors or failures, which has attracted increasingly attention from various fields. Resilience analyses play an important role for early warning, prediction, and proposing potential strategies or designing optimal resilience systems. This letter reviews the advanced progress of network resilience from three aspects: Resilience measurement, resilience analysis, as well as resilience recovery strategies. We outline the challenges of network resilience which should be investigated in the future.
- Open Access
- 4 January 2023
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 10
A representation and classification method for collective investor attention in the financial market
Introduction: It is increasingly becoming integral to analyze the collected information effectively.Methods: We propose a representation and classification method for collective investor attention in the financial market, taking the Chinese stock market as an example. The method includes three key steps: 1) converting the hourly search volume of each stock per week to an image representation for describing the changes of collective investor attention; 2) extracting features of each image by utilizing a self-encoding algorithm in deep learning; and 3) clustering generated images by K-means to arrange stocks into different groups.Results: The empirical results show that the portfolio considering the clustering information outperforms the HS300 index.Discussion: The method may not only use deep learning features for stock similarity measurement, but also shed some light on profoundly understanding the mechanisms of the collective investor attention for the financial market.
- 4 January 2023
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 10
Open AccessA representation and classification method for collective investor attention in the financial market
Introduction: It is increasingly becoming integral to analyze the collected information effectively.Methods: We propose a representation and classification method for collective investor attention in the financial market, taking the Chinese stock market as an example. The method includes three key steps: 1) converting the hourly search volume of each stock per week to an image representation for describing the changes of collective investor attention; 2) extracting features of each image by utilizing a self-encoding algorithm in deep learning; and 3) clustering generated images by K-means to arrange stocks into different groups.Results: The empirical results show that the portfolio considering the clustering information outperforms the HS300 index.Discussion: The method may not only use deep learning features for stock similarity measurement, but also shed some light on profoundly understanding the mechanisms of the collective investor attention for the financial market.
- 31 August 2022
- Published by Springer Nature in Frontiers of Engineering Management
- Vol. 9 (4) , 520-549
Identifying spreading influence nodes for social networks
The identification of spreading influence nodes in social networks, which studies how to detect important individuals in human society, has attracted increasing attention from physical and computer science, social science and economics communities. The identification algorithms of spreading influence nodes can be used to evaluate the spreading influence, describe the node’s position, and identify interaction centralities. This review summarizes the recent progress about the identification algorithms of spreading influence nodes from the viewpoint of social networks, emphasizing the contributions from physical perspectives and approaches, including the microstructure-based algorithms, community structure-based algorithms, macrostructure-based algorithms, and machine learning-based algorithms. We introduce diffusion models and performance evaluation metrics, and outline future challenges of the identification of spreading influence nodes.
- 31 August 2022
- Published by Springer Nature in Frontiers of Engineering Management
- Vol. 9 (4) , 520-549
Identifying spreading influence nodes for social networks
The identification of spreading influence nodes in social networks, which studies how to detect important individuals in human society, has attracted increasing attention from physical and computer science, social science and economics communities. The identification algorithms of spreading influence nodes can be used to evaluate the spreading influence, describe the node’s position, and identify interaction centralities. This review summarizes the recent progress about the identification algorithms of spreading influence nodes from the viewpoint of social networks, emphasizing the contributions from physical perspectives and approaches, including the microstructure-based algorithms, community structure-based algorithms, macrostructure-based algorithms, and machine learning-based algorithms. We introduce diffusion models and performance evaluation metrics, and outline future challenges of the identification of spreading influence nodes.
- Open Access
- 24 June 2022
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 10
Reconstruction of Unfolding Sub-Events From Social Media Posts
Event detection plays a crucial role in social media analysis, which usually concludes sub-event detection and correlation. In this article, we present a method for reconstructing the unfolding sub-event relations in terms of external expert knowledge. First, a Single Pass Clustering method is utilized to summarize massive social media posts. Second, a Label Propagation Algorithm is introduced to detect the sub-event according to the expert labeling. Third, a Word Mover’s Distance method is used to measure the correlation between the relevant sub-events. Finally, the Markov Chain Monte Carlo simulation method is presented to regenerate the popularity of social media posts. The experimental results show that the popularity dynamic of the empirical social media sub-events is consistent with the data generated by the proposed method. The evaluation of the unfolding model is 50.52% ∼ 88% higher than that of the random null model in the case of “Shanghai Tesla self-ignition incident.” This work is helpful for understanding the popularity mechanism of the unfolding events for online social media.
- 24 June 2022
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 10
Open AccessReconstruction of Unfolding Sub-Events From Social Media Posts
Event detection plays a crucial role in social media analysis, which usually concludes sub-event detection and correlation. In this article, we present a method for reconstructing the unfolding sub-event relations in terms of external expert knowledge. First, a Single Pass Clustering method is utilized to summarize massive social media posts. Second, a Label Propagation Algorithm is introduced to detect the sub-event according to the expert labeling. Third, a Word Mover’s Distance method is used to measure the correlation between the relevant sub-events. Finally, the Markov Chain Monte Carlo simulation method is presented to regenerate the popularity of social media posts. The experimental results show that the popularity dynamic of the empirical social media sub-events is consistent with the data generated by the proposed method. The evaluation of the unfolding model is 50.52% ∼ 88% higher than that of the random null model in the case of “Shanghai Tesla self-ignition incident.” This work is helpful for understanding the popularity mechanism of the unfolding events for online social media.