Min Li
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
Min Li has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Shuming Zhou
College of Mathematics and Statistics, Fujian Normal University, Fuzhou, China
3 shared publications - Gaolin Chen
College of Computer and Cyber Security, Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou, Fujian, China
2 shared publications - Wei Lin
Hunan University
2 shared publications - Daqing Gao
Institute of Modern Physics, Chinese Academy of Sciences
1 shared publication - Fengjun Wu
Institute of Modern Physics, Chinese Academy of Sciences, Lanzhou, China
1 shared publication Gaolin Chen
1 shared publication
Latest Publications
- 11 February 2023
- Published by Springer Nature
- p. 51-63
Link Prediction of Complex Networks Based on Local Path and Closeness Centrality
- 11 February 2023
- Published by Springer Nature
- p. 51-63
Link Prediction of Complex Networks Based on Local Path and Closeness Centrality
- 9 April 2022
- Published by Elsevier in Journal of Computational Science
- Vol. 61
Identifying key nodes in interdependent networks based on Supra-Laplacian energy
- 9 April 2022
- Published by Elsevier in Journal of Computational Science
- Vol. 61
Identifying key nodes in interdependent networks based on Supra-Laplacian energy
- Open Access
- 29 June 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-10
The Hermitian Kirchhoff Index and Robustness of Mixed Graph
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.
- 29 June 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-10
Open AccessThe Hermitian Kirchhoff Index and Robustness of Mixed Graph
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.