Sheng-Jun Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sheng-Jun Wang has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Zi-Gang Huang
4 shared publications- Lei Tao
School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710119, People’s Republic of China
3 shared publications Lufa Shi
Department of Systems Science, Faculty of Arts and Sciences, Beijing Normal University 2 , Zhuhai 519087, and , Beijing 100875
3 shared publications- Shi-Xian Qu
School of Physics and Information Technology, Shaanxi Normal University, Xi’an, China
3 shared publications - Zi-Gang Huang
School of Life Science and Technology, Xi’an Jiaotong University, Xi’an 710049, China
3 shared publications Bin-Quan Li
Institute of Computational Physics and Complex Systems, Lanzhou University, Lanzhou, 730000, CHINA
2 shared publications
Latest Publications
- 9 February 2026
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 688
Acetylcholine optimizes sensory coding by tuning criticality in a clustered neural network
- 9 February 2026
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 688
Acetylcholine optimizes sensory coding by tuning criticality in a clustered neural network
- 3 February 2026
- Published by Springer Nature in Cognitive Neurodynamics
- Vol. 20 (1) , 39
Origin of non-zero overlap in Hopfield neural networks beyond storage capacity
Hopfield networks are widely used models of associative memory. When the number of stored patterns exceeds the network's storage capacity, theoretical predictions show that the overlap between final states and memorized patterns should vanish. However, numerical simulations show that a small, non-zero overlap persists, indicating that the network retains residual memory. To investigate the origin of this phenomenon, we analyze the network's dynamics during the initial update steps. Using a signal-to-noise-ratio analysis, we demonstrate that when a node undergoes a state flip, the signal term of its neighbors is enhanced by the connecting link. This effect improves the stability of these neighboring neurons, facilitating a fraction of the network to remain aligned with the memory pattern and preventing a total loss of memory. Our findings elucidate the mechanism by which residual memory traces emerge in Hopfield networks beyond the storage limit.
- 3 February 2026
- Published by Springer Nature in Cognitive Neurodynamics
- Vol. 20 (1) , 39
Origin of non-zero overlap in Hopfield neural networks beyond storage capacity
Hopfield networks are widely used models of associative memory. When the number of stored patterns exceeds the network's storage capacity, theoretical predictions show that the overlap between final states and memorized patterns should vanish. However, numerical simulations show that a small, non-zero overlap persists, indicating that the network retains residual memory. To investigate the origin of this phenomenon, we analyze the network's dynamics during the initial update steps. Using a signal-to-noise-ratio analysis, we demonstrate that when a node undergoes a state flip, the signal term of its neighbors is enhanced by the connecting link. This effect improves the stability of these neighboring neurons, facilitating a fraction of the network to remain aligned with the memory pattern and preventing a total loss of memory. Our findings elucidate the mechanism by which residual memory traces emerge in Hopfield networks beyond the storage limit.
- 1 November 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (11) , 115206
Degradation of modular networks increases integration and decreases segregation
Segregation and integration coexist in the dynamics of complex networked systems, such as neural networks in the brain, where their balance corresponds to the highest dynamical complexity. Coupled oscillators can achieve the balance between segregation and integration on modular networks. In this study, we investigate how the degradation of balance network affects the segregation and integration of coupled oscillators. Degradation is modeled by removing nodes or links, and by weakening links. We show that, in balance networks, degradation decreases segregation while increasing integration. This behavior arises from a structural feature of the network: inter-modular connections between a pair of modules are sparse. When degradation occurs, all nodes lose a part of intra-modular links, whereas some nodes retain all of their inter-modular links.
- 1 November 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (11) , 115206
Degradation of modular networks increases integration and decreases segregation
Segregation and integration coexist in the dynamics of complex networked systems, such as neural networks in the brain, where their balance corresponds to the highest dynamical complexity. Coupled oscillators can achieve the balance between segregation and integration on modular networks. In this study, we investigate how the degradation of balance network affects the segregation and integration of coupled oscillators. Degradation is modeled by removing nodes or links, and by weakening links. We show that, in balance networks, degradation decreases segregation while increasing integration. This behavior arises from a structural feature of the network: inter-modular connections between a pair of modules are sparse. When degradation occurs, all nodes lose a part of intra-modular links, whereas some nodes retain all of their inter-modular links.
- 2 July 2025
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 675
The impact of reciprocal links on learning performance of critical neural networks
- 2 July 2025
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 675
The impact of reciprocal links on learning performance of critical neural networks
- 21 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 044129
Time-series thresholding and avalanche dynamics in networks of the critical branching process
Avalanche sizes and durations following power-law distributions are observed in many systems and are considered hallmarks of criticality. Time-series thresholding is a commonly used method to define avalanches, but this method is controversial. In this study, we use the time-series thresholding method to define avalanches and investigate the statistical properties of avalanches in the Kinouchi-Copelli (KC) model. We consider two definitions of avalanche size, (1) total area above threshold value reference and (2) total area above zero, and then analyze the size and duration distributions. Our results show that while avalanche size and duration obey a power-law distribution, the exponents of size and duration differ from those of the critical branching process. The scaling relation holds for avalanches defined by the first method but fails for those avalanches tdefined by the second. This study provides new insights into avalanche definition methods and avalanche distribution exponents in continuous time-series.
- 21 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 044129
Time-series thresholding and avalanche dynamics in networks of the critical branching process
Avalanche sizes and durations following power-law distributions are observed in many systems and are considered hallmarks of criticality. Time-series thresholding is a commonly used method to define avalanches, but this method is controversial. In this study, we use the time-series thresholding method to define avalanches and investigate the statistical properties of avalanches in the Kinouchi-Copelli (KC) model. We consider two definitions of avalanche size, (1) total area above threshold value reference and (2) total area above zero, and then analyze the size and duration distributions. Our results show that while avalanche size and duration obey a power-law distribution, the exponents of size and duration differ from those of the critical branching process. The scaling relation holds for avalanches defined by the first method but fails for those avalanches tdefined by the second. This study provides new insights into avalanche definition methods and avalanche distribution exponents in continuous time-series.
- 10 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 045303
Principal component analysis for percolation with and without data preprocessing
In the percolation model, specific preprocessing of configuration data enables identifying phase transitions with unsupervised learning methods such as principal component analysis (PCA). However, the limitations of using original percolation configuration data and the role of preprocessing remain incompletely understood. Here, we study how PCA works in percolation. Firstly, we theoretically derive the PCA results. For the original configurations, PCA shows no insights into the percolation phase transition. The theoretical results of PCA reveal the relation between principal components and the indicators of phase transitions, i.e., order parameters and structure factors based on the preprocessing of removing unpercolating clusters. In addition, we investigate the PCA based on auxiliary Ising mapping, and the relation is also derived and validated. Secondly, we examine the intrinsic properties of the original percolation configurations and the operational principles of PCA and then reveal the challenge of PCA in percolation. The statistical independence among sites results in the absence of necessary lattice structure information, and further, the negligible threshold number of occupied (unoccupied) sites required for forming (destructing) percolating cluster results in the invisibility of the phase transition to the cluster analysis or statistical approaches. Both removing unpercolating clusters and auxiliary Ising mapping can remove this invisibility. Our work suggests that yielding discernible differences between percolating state and unpercolating state, or further introducing percolation statistical correlation among sites, gives effective data preprocessing methods.
- 10 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 045303
Principal component analysis for percolation with and without data preprocessing
In the percolation model, specific preprocessing of configuration data enables identifying phase transitions with unsupervised learning methods such as principal component analysis (PCA). However, the limitations of using original percolation configuration data and the role of preprocessing remain incompletely understood. Here, we study how PCA works in percolation. Firstly, we theoretically derive the PCA results. For the original configurations, PCA shows no insights into the percolation phase transition. The theoretical results of PCA reveal the relation between principal components and the indicators of phase transitions, i.e., order parameters and structure factors based on the preprocessing of removing unpercolating clusters. In addition, we investigate the PCA based on auxiliary Ising mapping, and the relation is also derived and validated. Secondly, we examine the intrinsic properties of the original percolation configurations and the operational principles of PCA and then reveal the challenge of PCA in percolation. The statistical independence among sites results in the absence of necessary lattice structure information, and further, the negligible threshold number of occupied (unoccupied) sites required for forming (destructing) percolating cluster results in the invisibility of the phase transition to the cluster analysis or statistical approaches. Both removing unpercolating clusters and auxiliary Ising mapping can remove this invisibility. Our work suggests that yielding discernible differences between percolating state and unpercolating state, or further introducing percolation statistical correlation among sites, gives effective data preprocessing methods.
- Open Access
- 4 April 2025
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 11 (14) , eadr3903
Neural heterogeneity enhances reliable neural information processing: Local sensitivity and globally input-slaved transient dynamics
Cortical neuronal activity varies over time and across repeated trials, yet consistently represents stimulus features. The dynamical mechanism underlying this reliable representation and computation remains elusive. This study uncovers a mechanism for reliable neural information processing, leveraging a biologically plausible network model incorporating neural heterogeneity. First, we investigate neuronal timescale diversity, revealing that it disrupts intrinsic coherent spatiotemporal patterns, induces firing rate heterogeneity, enhances local responsive sensitivity, and aligns network activity closely with input. The system exhibits globally input-slaved transient dynamics, essential for reliable neural information processing. Other neural heterogeneities, such as nonuniform input connections, spike threshold heterogeneity, and network in-degree heterogeneity, play similar roles, highlighting the importance of neural heterogeneity in shaping consistent stimulus representation. This mechanism offers a potentially general framework for understanding neural heterogeneity in reliable computation and informs the design of reservoir computing models endowed with liquid wave reservoirs for neuromorphic computing.
- 4 April 2025
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 11 (14) , eadr3903
Open AccessNeural heterogeneity enhances reliable neural information processing: Local sensitivity and globally input-slaved transient dynamics
Cortical neuronal activity varies over time and across repeated trials, yet consistently represents stimulus features. The dynamical mechanism underlying this reliable representation and computation remains elusive. This study uncovers a mechanism for reliable neural information processing, leveraging a biologically plausible network model incorporating neural heterogeneity. First, we investigate neuronal timescale diversity, revealing that it disrupts intrinsic coherent spatiotemporal patterns, induces firing rate heterogeneity, enhances local responsive sensitivity, and aligns network activity closely with input. The system exhibits globally input-slaved transient dynamics, essential for reliable neural information processing. Other neural heterogeneities, such as nonuniform input connections, spike threshold heterogeneity, and network in-degree heterogeneity, play similar roles, highlighting the importance of neural heterogeneity in shaping consistent stimulus representation. This mechanism offers a potentially general framework for understanding neural heterogeneity in reliable computation and informs the design of reservoir computing models endowed with liquid wave reservoirs for neuromorphic computing.
- Open Access
- 1 December 2024
- Published by AIP Publishing in AIP Advances
- Vol. 14 (12)
Improving model-free prediction of chaotic dynamics by purifying the incomplete input
Despite the success of data-driven machine learning in forecasting complex nonlinear dynamics, predicting future evolution based on incomplete historical data remains challenging. Reservoir Computing (RC), a widely adopted approach, suffers from incomplete past observations since it typically requires complete data for accurate predictions. In this paper, a novel data processing scheme is introduced to improve the predictive performance of the RC when the input time series or dynamic trajectories are incomplete, for example, a portion of elements or states are randomly omitted or removed. It is a purification strategy, in which the input data are purified by selecting data or data sequences that are one step ahead of the segments of missing data. The selected data are positioned in turn in a new input, which is no longer indexed by the temporal order in the original time series. This approach matches the one-step-head nature of the convention RC and is thus very simple and efficient, without changing anything in the architecture of RC and avoiding sophisticated pretreatment on the incomplete input. It has been successfully employed to predict the chaotic dynamics in the Logistic map, Lorenz and Rössler systems, when the machine is trained by the purified input. The effect of the missing data on the predictive performance of the RC is also discussed. The results suggest that the purification of input can significantly improve its efficiency of predictive performance.
- 1 December 2024
- Published by AIP Publishing in AIP Advances
- Vol. 14 (12)
Open AccessImproving model-free prediction of chaotic dynamics by purifying the incomplete input
Despite the success of data-driven machine learning in forecasting complex nonlinear dynamics, predicting future evolution based on incomplete historical data remains challenging. Reservoir Computing (RC), a widely adopted approach, suffers from incomplete past observations since it typically requires complete data for accurate predictions. In this paper, a novel data processing scheme is introduced to improve the predictive performance of the RC when the input time series or dynamic trajectories are incomplete, for example, a portion of elements or states are randomly omitted or removed. It is a purification strategy, in which the input data are purified by selecting data or data sequences that are one step ahead of the segments of missing data. The selected data are positioned in turn in a new input, which is no longer indexed by the temporal order in the original time series. This approach matches the one-step-head nature of the convention RC and is thus very simple and efficient, without changing anything in the architecture of RC and avoiding sophisticated pretreatment on the incomplete input. It has been successfully employed to predict the chaotic dynamics in the Logistic map, Lorenz and Rössler systems, when the machine is trained by the purified input. The effect of the missing data on the predictive performance of the RC is also discussed. The results suggest that the purification of input can significantly improve its efficiency of predictive performance.
- 18 January 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 35 (07)
Critical branching dynamics in excitable network without refractory periods
Critical state plays an important role in emerged behavior of neural networks. Excitable networks are widely used in simulation studies. However, the simulation of critical state is sophisticated because the state sensitively depends on dynamical and topological features. We study the effect of refractory period of dynamical units and connection symmetry on the excitable network with critical branching ratio. In bidirectional random networks with refractory period, the critical branching ratio is well known. Here, we show that the collective behavior changes from critical state into ceaseless activity, when refractory period vanishes. Instead of mean degree of all nodes, we show that the control parameter is determined by the mean degree of active nodes which is larger than the average degree and induces the transition. When refractory period is present, the number of effective links connected to resting nodes is equal to average degree. The mechanism ensures the critical branching ratio is unity. In directed networks, collective behavior keeps the critical state when refractory period vanished. However, a few reciprocal links make the network without refractory period becoming ceaseless.
- 18 January 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 35 (07)
Critical branching dynamics in excitable network without refractory periods
Critical state plays an important role in emerged behavior of neural networks. Excitable networks are widely used in simulation studies. However, the simulation of critical state is sophisticated because the state sensitively depends on dynamical and topological features. We study the effect of refractory period of dynamical units and connection symmetry on the excitable network with critical branching ratio. In bidirectional random networks with refractory period, the critical branching ratio is well known. Here, we show that the collective behavior changes from critical state into ceaseless activity, when refractory period vanishes. Instead of mean degree of all nodes, we show that the control parameter is determined by the mean degree of active nodes which is larger than the average degree and induces the transition. When refractory period is present, the number of effective links connected to resting nodes is equal to average degree. The mechanism ensures the critical branching ratio is unity. In directed networks, collective behavior keeps the critical state when refractory period vanished. However, a few reciprocal links make the network without refractory period becoming ceaseless.