Wei Li

Prof. Wei Li


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2021 in Physical Review E
Verified
Journal Article
Closed access
PDF file
JSJianmin Shen
Jianmin Shen
WLWei Li
Wei Li
Shengfeng DengShengfeng Deng
Shengfeng Deng
TZTao Zhang
Tao Zhang
Machine learning (ML) has been well applied to studying equilibrium phase transition models by accurately predicating critical thresholds and some critical exponents. Difficulty will be raised, however, for integrating ML into nonequilibrium phase transitions. The extra dimension in a given nonequilibrium system, namely time, can greatly slow down the procedure toward the steady state. In this paper we find that by using some simple techniques of ML, non-steady-state configurations of directed percolation (DP) suffice to capture its essential critical behaviors in both (1+1) and (2+1) dimensions. With the supervised learning method, the framework of our binary classification neural networks can identify the phase transition threshold, as well as the spatial and temporal correlation exponents. The characteristic time tc, specifying the transition from active phases to absorbing ones, is also a major product of the learning. Moreover, we employ the convolutional autoencoder, an unsupervised learning technique, to extract dimensionality reduction representations and cluster configurations of (1+1) bond DP. It is quite appealing that such a method can yield a reasonable estimation of the critical point.

20 January 2017 in PLOS ONE
Verified
Journal Article
Open access
PDF file
Longfeng ZhaoLongfeng Zhao
Longfeng Zhao
WLWei Li
Wei Li
CYChunbin Yang
Chunbin Yang
JHJihui Han
Jihui Han
ZSZhu Su
Zhu Su
YZYijiang Zou
Yijiang Zou
Many models and real complex systems possess critical thresholds at which the systems shift dramatically from one sate to another. The discovery of early-warnings in the vicinity of critical points are of great importance to estimate how far the systems are away from the critical states. Multifractal Detrended Fluctuation analysis (MF-DFA) and visibility graph method have been employed to investigate the multifractal and geometrical properties of the magnetization time series of the two-dimensional Ising model. Multifractality of the time series near the critical point has been uncovered from the generalized Hurst exponents and singularity spectrum. Both long-term correlation and broad probability density function are identified to be the sources of multifractality. Heterogeneous nature of the networks constructed from magnetization time series have validated the fractal properties. Evolution of the topological quantities of the visibility graph, along with the variation of multifractality, serve as new early-warnings of phase transition. Those methods and results may provide new insights about the analysis of phase transition problems and can be used as early-warnings for a variety of complex systems.

9 October 2023 in Physical Review D
Verified
Journal Article
Open access
PDF file
FMFei Ma
Fei Ma
Feiyi LiuFeiyi Liu
Feiyi Liu
WLWei Li
Wei Li
Recently, methods of graph neural networks (GNNs) have been applied to solving the problems in high-energy physics (HEP) and have shown its great potential for quark-gluon tagging with graph representation of jet events. In this paper, we introduce an approach of GNNs combined with a Haar pooling operation to analyze the events, called Haar pooling message passing neural network (HMPNet). In HMPNet, Haar pooling not only extracts the features of graph, but embeds additional information obtained by clustering of k means of different particle features. We construct Haar pooling from five different features: absolute energy logE, transverse momentum logpT, relative coordinates (Δη,Δϕ), the mixed ones (logE,logpT), and (logE,logpT,Δη,Δϕ). The results show that an appropriate selection of information for Haar pooling enhances the accuracy of quark-gluon tagging, as adding extra information of logPT to the HMPNet outperforms all the others, whereas adding relative coordinates information (Δη,Δϕ) is not very effective. This implies that, by adding effective particle features from Haar pooling, one can achieve much better results than that which a solely pure message passing neutral network can do, which demonstrates significant improvement of feature extraction via the pooling process. Finally, we compare the HMPNet study, ordering by pT, with other studies and prove that the HMPNet is also a good choice of GNN algorithms for jet tagging.

29 November 2017 in PLOS ONE
Verified
Journal Article
Open access
PDF file
Jihui HanJihui Han
Jihui Han
WLWei Li
Wei Li
LZLongfeng Zhao
Longfeng Zhao
ZSZhu Su
Zhu Su
YZYijiang Zou
Yijiang Zou
WDWeibing Deng
Weibing Deng
An adaptive label propagation algorithm (ALPA) is proposed to detect and monitor communities in dynamic networks. Unlike the traditional methods by re-computing the whole community decomposition after each modification of the network, ALPA takes into account the information of historical communities and updates its solution according to the network modifications via a local label propagation process, which generally affects only a small portion of the network. This makes it respond to network changes at low computational cost. The effectiveness of ALPA has been tested on both synthetic and real-world networks, which shows that it can successfully identify and track dynamic communities. Moreover, ALPA could detect communities with high quality and accuracy compared to other methods. Therefore, being low-complexity and parameter-free, ALPA is a scalable and promising solution for some real-world applications of community detection in dynamic networks.

17 November 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
JSJianmin Shen
Jianmin Shen
WLWei Li
Wei Li
SDShengfeng Deng
Shengfeng Deng
DXDian Xu
Dian Xu
SCShiyang Chen
Shiyang Chen
Feiyi LiuFeiyi Liu
Feiyi Liu
The pair-contact process with diffusion (PCPD), a generalized model of the ordinary pair-contact process (PCP) without diffusion, exhibits a continuous absorbing phase transition. Unlike the PCP, whose nature of phase transition is clearly classified into the directed percolation (DP) universality class, the model of PCPD has been controversially discussed since its infancy. To our best knowledge, there is so far no consensus on whether the phase transition of the PCPD falls into the unknown university classes or else conveys a new kind of non-equilibrium phase transition. In this paper, both unsupervised and supervised learning are employed to study the PCPD with scrutiny. Firstly, two unsupervised learning methods, principal component analysis (PCA) and autoencoder, are taken. Our results show that both methods can cluster the original configurations of the model and provide reasonable estimates of thresholds. Therefore, no matter whether the non-equilibrium lattice model is a random process of unitary (for instance the DP) or binary (for instance the PCP), or whether it contains the diffusion motion of particles, unsupervised learning can capture the essential, hidden information. Beyond that, supervised learning is also applied to learning the PCPD at different diffusion rates. We proposed a more accurate numerical method to determine the spatial correlation exponent $$\nu _{\perp }$$ ν ⊥ , which, to a large degree, avoids the uncertainty of data collapses through naked eyes.

13 December 2016 in Scientific Reports
Verified
Journal Article
Open access
PDF file
Jihui HanJihui Han
Jihui Han
WLWei Li
Wei Li
WDWeibing Deng
Weibing Deng
Aiming at improving the efficiency and accuracy of community detection in complex networks, we proposed a new algorithm, which is based on the idea that communities could be detected from subnetworks by comparing the internal and external cohesion of each subnetwork. In our method, similar nodes are firstly gathered into meta-communities, which are then decided to be retained or merged through a multilevel label propagation process, until all of them meet our community criterion. Our algorithm requires neither any priori information of communities nor optimization of any objective function. Experimental results on both synthetic and real-world networks show that, our algorithm performs quite well and runs extremely fast, compared with several other popular algorithms. By tuning a resolution parameter, we can also observe communities at different scales, so this could reveal the hierarchical structure of the network. To further explore the effectiveness of our method, we applied it to the E-Coli transcriptional regulatory network, and found that all the identified modules have strong structural and functional coherence.