Yiming Huang
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
Yiming Huang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Linyuan Lü
University of Science and Technology of China
3 shared publications - Qiang Wu
Collaborative Innovation Center for Western Ecological Safety, Lanzhou University, Lanzhou, China
2 shared publications - Xiao-Long Ren
Yangtze Delta Region Institute (Huzhou), University of Electronic Science and Technology of China, Huzhou 313001, China
2 shared publications Yujie Zeng
2 shared publications- Fang Zhou
Hangzhou Innovation Institute, Beihang University, Hangzhou, P. R. China
1 shared publication - Hao Wang
State Key Laboratory of Digital Medical Engineering, Key Laboratory of Biomedical Engineering of Hainan Province, School of Biomedical Engineering, Hainan University, Sanya, China
1 shared publication
Latest Publications
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP, 1-13
Cooperative Network Learning for Large-Scale and Decentralized Graphs
Graph representation learning has become a vital tool for capturing intricate relationships within networked systems. However, as graphs scale up, data privacy concerns and regulatory restrictions often isolate data within different institutions, hindering collaborative analysis. While federated learning (FL) and swarm learning (SL) offer decentralized solutions, FL relies on a central coordinator, and SL struggles with non-I.I.D. graph data, limiting their flexibility and applicability to complex graph structures. Therefore, establishing a mutual trust mechanism among graph agencies is crucial to unlocking the full potential of graphs. In this article, we introduce a cooperative network learning (CNL) framework to ensure secure graph computing across diverse graph tasks. CNL unifies local and global graph neural network (GNN) perspectives through secure virtual graph connections, enabling collaborative training on decentralized graphs without centralized coordination, while homomorphic encryption and secure communication further preserve privacy. Moreover, CNL enables each agency to maintain autonomy by designing heterogeneous models tailored to its own tasks, going beyond FL and SL. Extensive experiments on contagion dynamics prediction and various traditional graph tasks demonstrate that our CNL architecture outperforms state-of-the-art GNNs developed at individual sites, revealing that CNL provides a reliable, fair, secure, privacy-preserving, and global perspective for effective and personalized network applications. This framework promises to address privacy concerns in graph-related research and integrate decentralized graph data structures to benefit the network research community in cooperation and innovation.
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP, 1-13
Cooperative Network Learning for Large-Scale and Decentralized Graphs
Graph representation learning has become a vital tool for capturing intricate relationships within networked systems. However, as graphs scale up, data privacy concerns and regulatory restrictions often isolate data within different institutions, hindering collaborative analysis. While federated learning (FL) and swarm learning (SL) offer decentralized solutions, FL relies on a central coordinator, and SL struggles with non-I.I.D. graph data, limiting their flexibility and applicability to complex graph structures. Therefore, establishing a mutual trust mechanism among graph agencies is crucial to unlocking the full potential of graphs. In this article, we introduce a cooperative network learning (CNL) framework to ensure secure graph computing across diverse graph tasks. CNL unifies local and global graph neural network (GNN) perspectives through secure virtual graph connections, enabling collaborative training on decentralized graphs without centralized coordination, while homomorphic encryption and secure communication further preserve privacy. Moreover, CNL enables each agency to maintain autonomy by designing heterogeneous models tailored to its own tasks, going beyond FL and SL. Extensive experiments on contagion dynamics prediction and various traditional graph tasks demonstrate that our CNL architecture outperforms state-of-the-art GNNs developed at individual sites, revealing that CNL provides a reliable, fair, secure, privacy-preserving, and global perspective for effective and personalized network applications. This framework promises to address privacy concerns in graph-related research and integrate decentralized graph data structures to benefit the network research community in cooperation and innovation.
- 29 June 2024
- Published by Elsevier in Information Processing & Management
- Vol. 61 (5)
Influential simplices mining via simplicial convolutional networks
- 29 June 2024
- Published by Elsevier in Information Processing & Management
- Vol. 61 (5)
Influential simplices mining via simplicial convolutional networks
- 21 June 2024
- Published by Elsevier in Information Sciences
- Vol. 679
Identifying vital nodes through augmented random walks on higher-order networks
- 21 June 2024
- Published by Elsevier in Information Sciences
- Vol. 679
Identifying vital nodes through augmented random walks on higher-order networks
- Top Cited PapersOpen Access
- 8 January 2024
- Published by Springer Nature in Communications Physics
- Vol. 7 (1) , 1-11
Identifying key players in complex networks via network entanglement
Empirical networks exhibit significant heterogeneity in node connections, resulting in a few vertices playing critical roles in various scenarios, including decision-making, viral marketing, and population immunization. Thus, identifying key vertices is a fundamental research problem in Network Science. In this paper, we introduce vertex entanglement (VE), an entanglement-based metric capable of quantifying the perturbations caused by individual vertices on spectral entropy, residing at the intersection of quantum information and network science. Our analytical analysis reveals that VE is closely related to network robustness and information transmission ability. As an application, VE offers an approach to the challenging problem of optimal network dismantling, and empirical experiments demonstrate its superiority over state-of-the-art algorithms. Furthermore, VE also contributes to the diagnosis of autism spectrum disorder (ASD), with significant distinctions in hub disruption indices based on VE between ASD and typical controls, promising a diagnostic role for VE in ASD assessment.
- 8 January 2024
- Published by Springer Nature in Communications Physics
- Vol. 7 (1) , 1-11
Top Cited PapersOpen AccessIdentifying key players in complex networks via network entanglement
Empirical networks exhibit significant heterogeneity in node connections, resulting in a few vertices playing critical roles in various scenarios, including decision-making, viral marketing, and population immunization. Thus, identifying key vertices is a fundamental research problem in Network Science. In this paper, we introduce vertex entanglement (VE), an entanglement-based metric capable of quantifying the perturbations caused by individual vertices on spectral entropy, residing at the intersection of quantum information and network science. Our analytical analysis reveals that VE is closely related to network robustness and information transmission ability. As an application, VE offers an approach to the challenging problem of optimal network dismantling, and empirical experiments demonstrate its superiority over state-of-the-art algorithms. Furthermore, VE also contributes to the diagnosis of autism spectrum disorder (ASD), with significant distinctions in hub disruption indices based on VE between ASD and typical controls, promising a diagnostic role for VE in ASD assessment.