Min Li

Min Li

Auto-generated profile, based on publicly available information

Min Li

Fujian Normal University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
9 April 2022 in Journal of Computational Science
Verified
Journal Article
Closed access
WLWei Lin
Wei Lin
SZShuming Zhou
Shuming Zhou
MLMin Li
Min Li
GCGaolin Chen
Gaolin Chen

9 January 2015 in Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
Verified
Journal Article
Closed access
JZJiang Zhao
Jiang Zhao
DGDaqing Gao
Daqing Gao
YCYouxin Chen
Youxin Chen
RMRuishi Mao
Ruishi Mao
PLPeng Li
Peng Li
YYYoujin Yuan
Youjin Yuan

29 June 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
WLWei Lin
Wei Lin
SZShuming Zhou
Shuming Zhou
MLMin Li
Min Li
GCGaolin Chen
Gaolin Chen
QZQianru Zhou
Qianru Zhou
Large-scale social graph data poses significant challenges for social analytic tools to monitor and analyze social networks. The information-theoretic distance measure, namely, resistance distance, is a vital parameter for ranking influential nodes or community detection. The superiority of resistance distance and Kirchhoff index is that it can reflect the global properties of the graph fairly, and they are widely used in assessment of graph connectivity and robustness. There are various measures of network criticality which have been investigated for underlying networks, while little is known about the corresponding metrics for mixed networks. In this paper, we propose the positive walk algorithm to construct the Hermitian matrix for the mixed graph and then introduce the Hermitian resistance matrix and the Hermitian Kirchhoff index which are based on the eigenvalues and eigenvectors of the Hermitian Laplacian matrix. Meanwhile, we also propose a modified algorithm, the directed traversal algorithm, to select the edges whose removal will maximize the Hermitian Kirchhoff index in the general mixed graph. Finally, we compare the results with the algebraic connectivity to verify the superiority of the proposed strategy.