The Hermitian Kirchhoff Index and Robustness of Mixed Graph
Open Access
- 29 June 2021
- journal article
- research article
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-10
Abstract
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.Keywords
Funding Information
- National Natural Science Foundation of China (61977016, 61572010, 2020J01164, 2017J01738, JAT170118, JAT200958, JAT191119, KY20200204)
- Natural Science Foundation of Fujian Province (61977016, 61572010, 2020J01164, 2017J01738, JAT170118, JAT200958, JAT191119, KY20200204)
- Department of Education, Fujian Province (61977016, 61572010, 2020J01164, 2017J01738, JAT170118, JAT200958, JAT191119, KY20200204)
- Fujian Normal University (61977016, 61572010, 2020J01164, 2017J01738, JAT170118, JAT200958, JAT191119, KY20200204)
This publication has 39 references indexed in Scilit:
- Momentum methods for stochastic optimization over time-varying directed networksSignal Processing, 2020
- Neural Learning-Based Fixed-Time Consensus Tracking Control for Nonlinear Multiagent Systems With Directed Communication NetworksIEEE Transactions on Neural Networks and Learning Systems, 2020
- CAOM: A community-based approach to tackle opinion maximization for social networksInformation Sciences, 2020
- Friendship paradox biases perceptions in directed networksNature Communications, 2020
- Directed disease networks to facilitate multiple-disease risk assessment modelingDecision Support Systems, 2020
- New node anomaly detection algorithm based on nonnegative matrix factorization for directed citation networksAnnals of Operations Research, 2020
- Phase transitions in normalized cut of social networksPhysics Letters A, 2019
- Fault-Tolerant Consensus Tracking Control for Linear Multiagent Systems Under Switching Directed NetworkIEEE Transactions on Cybernetics, 2019
- Context-Aware Reliable Crowdsourcing in Social NetworksIEEE Transactions on Systems, Man, and Cybernetics: Systems, 2017
- Social network security: Issues, challenges, threats, and solutionsInformation Sciences, 2017