Weibing Deng

Weibing Deng


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
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.

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.

21 September 2016 in The European Physical Journal B
Verified
Journal Article
Closed access
PDF file
ZSZhu Su
Zhu Su
WDWeibing Deng
Weibing Deng
LZLongfeng Zhao
Longfeng Zhao
JHJihui Han
Jihui Han
WLWei Li
Wei Li
XCXu Cai
Xu Cai

1 November 2018 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
Jihui HanJihui Han
Jihui Han
WLWei Li
Wei Li
WDWeibing Deng
Weibing Deng
We propose an alternative to the Bak-Sneppen model for species co-evolution. In our model the closest neighbors of the least adapted species are replaced by new species with a certain probability α. The probability α can be regarded as the interaction strength between nearest species. We show that the system can always self-organizes to a critical state when the interaction strength α is larger than zero. The critical exponents of our model are estimated through the finite size scaling analysis, and found to be the same as those of the original Bak-Sneppen model. We also find that the critical dimension of our model is 4, below which avalanches are compact and above which the critical behavior is mean-field like. Moreover, a strong interaction strength leads to a lower critical fitness.

8 November 2018 in Physical Review E
Verified
Journal Article
Closed access
PDF file
RXRongrong Xie
Rongrong Xie
Shengfeng DengShengfeng Deng
Shengfeng Deng
WDWeibing Deng
Weibing Deng
AAArmen Allahverdyan
Armen Allahverdyan
We study active restoration of noise-corrupted images generated via the Gibbs probability of an Ising ferromagnet in external magnetic field. Ferromagnetism accounts for the prior expectation of data smoothness, i.e., a positive correlation between neighboring pixels (Ising spins), while the magnetic field refers to the bias. The restoration is actively supervised by requesting the true values of certain pixels after a noisy observation. This additional information improves restoration of other pixels. The optimal strategy of active inference is not known for realistic (two-dimensional) images. We determine this strategy for the mean-field version of the model and show that it amounts to supervising the values of spins (pixels) that do not agree with the sign of the average magnetization. The strategy leads to a transparent analytical expression for the minimal Bayesian risk, and shows that there is a maximal number of pixels beyond of which the supervision is useless. We show numerically that this strategy applies for two-dimensional images away from the critical regime. Within this regime the strategy is outperformed by its local (adaptive) version, which supervises pixels that do not agree with their Bayesian estimate. We show on transparent examples how active supervising can be essential in recovering noise-corrupted images and advocate for a wider usage of active methods in image restoration.

24 October 2024 in Physica Scripta
Verified
Journal Article
Closed access
JSJianmin Shen
Jianmin Shen
SWShanshan Wang
Shanshan Wang
WLWei Li
Wei Li
WDWeibing Deng
Weibing Deng
DXDian Xu
Dian Xu
FGFeng Gao
Feng Gao
Machine learning has been widely applied in physics research. Although unsupervised learning can extract the critical points of phase transitions, the percolation model remains a challenge. Unsupervised learning using the raw configurations of the percolation model fails to capture the critical points. To capture the configuration characteristics of the percolation model, this paper proposes using the maximum cluster as input to the neural network. It is well understood that the order parameter of the percolation model is not simply the particle density, but rather the probability that a given site or bond belongs to the percolating cluster. Additionally, we introduce the use of a Siamese Neural Network (SNN) to detect percolation phase transitions. Unlike unsupervised dimensionality reduction methods or supervised binary classification outputs, the SNN produces a scalar output referred to as similarity. By combining the maximum cluster and the SNN, we not only successfully extract the critical value of the percolation model, but also calculate the correlation exponent via data collapse. We believe that the SNN has great potential in handling phase transition classification problems and can serve as a reference for studying other phase transition systems.