Fang Zhou

Fang Zhou

Auto-generated profile, based on publicly available information

Fang Zhou

Hangzhou Innovation Institute, Beihang University, Hangzhou, P. R. China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
28 September 2023 in Entropy
Verified
Journal Article
Open access
PDF file
YZYujie Zeng
Yujie Zeng
BLBo Liu
Bo Liu
FZFang Zhou
Fang Zhou
Linyuan LüLinyuan Lü
Linyuan Lü
Null models are crucial tools for investigating network topological structures. However, research on null models for higher-order networks is still relatively scarce. In this study, we introduce an innovative method to construct null models for hypergraphs, namely the hyperedge swapping-based method. By preserving certain network properties while altering others, we generate six hyper-null models with various orders and analyze their interrelationships. To validate our approach, we first employ hypergraph entropy to assess the randomness of these null models across four datasets. Furthermore, we examine the differences in important statistical properties between the various null models and the original networks. Lastly, we investigate the impact of hypergraph randomness on network dynamics using the proposed hyper-null models, focusing on dismantling and epidemic contagion. The findings show that our proposed hyper-null models are applicable to various scenarios. By introducing a comprehensive framework for generating and analyzing hyper-null models, this research opens up avenues for further exploration of the intricacies of network structures and their real-world implications.

1 April 2024 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Open access
PDF file
RYRongmei Yang
Rongmei Yang
FZFang Zhou
Fang Zhou
BLBo Liu
Bo Liu
Linyuan LüLinyuan Lü
Linyuan Lü
Higher-order structures, consisting of more than two individuals, provide a new perspective to reveal the missed non-trivial characteristics under pairwise networks. Prior works have researched various higher-order networks, but research for evaluating the effects of higher-order structures on network functions is still scarce. In this paper, we propose a framework to quantify the effects of higher-order structures (e.g., 2-simplex) and vital functions of complex networks by comparing the original network with its simplicial model. We provide a simplicial model that can regulate the quantity of 2-simplices and simultaneously fix the degree sequence. Although the algorithm is proposed to control the quantity of 2-simplices, results indicate it can also indirectly control simplexes more than 2-order. Experiments on spreading dynamics, pinning control, network robustness, and community detection have shown that regulating the quantity of 2-simplices changes network performance significantly. In conclusion, the proposed framework is a general and effective tool for linking higher-order structures with network functions. It can be regarded as a reference object in other applications and can deepen our understanding of the correlation between micro-level network structures and global network functions.

10 June 2025 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
CSChang Su
Chang Su
FZFang Zhou
Fang Zhou
Linyuan LüLinyuan Lü
Linyuan Lü
Exploring the internal mechanism of information spreading is critical for understanding and controlling the process. Traditional spreading models often assume individuals play the same role in the spreading process. In reality, however, individuals’ diverse characteristics contribute differently to the spreading performance, leading to a heterogeneous infection rate across the system. To investigate network spreading dynamics under heterogeneous infection rates, we integrate two individual-level features—influence (i.e., the ability to influence neighbors) and susceptibility (i.e., the extent to be influenced by neighbors)—into the independent cascade model. Our findings reveal significant differences in spreading performance under heterogeneous and constant infection rates, with traditional structural centrality metrics proving more effective in the latter scenario. Additionally, we take the constant and heterogeneous infection rates into a state-of-the-art maximization algorithm, the well-known TIM algorithm, and find the seeds selected by heterogeneous infection rates are more dispersed compared to those under constant rates. Lastly, we find that both individuals’ influence and susceptibility are vital to the spreading performance. Strikingly, susceptible individuals are particularly important to spreading when information is disseminated by social celebrities. By integrating influence and susceptibility into the spreading model, we gain a more profound understanding of the underlying mechanisms driving information spreading.

27 June 2025 in IEEE Journal of Emerging and Selected Topics in Industrial Electronics
Verified
Journal Article
Closed access
YGYiwei Gao
Yiwei Gao
FZFang Zhou
Fang Zhou
Qing GaoQing Gao
Qing Gao
KZKexin Zhang
Kexin Zhang
The systems within the Industrial Internet of Things (IIoT) have complex structures and non-Euclidean data, which are challenging to manage. Due to the advantages of Graph Neural Networks (GNNs) in processing non-Euclidean data and complex topologies, they are capable of handling problems in the context of the IIoT. In this work, the IIoT system is structured into multiple layers to facilitate the management of the system and the use of GNNs. GNNs are taken as node classifiers to analyze the state of each edge server in the IIoT system. However, in reality, adversarial attacks often arise in the IIoT, severely impacting system performance. Therefore, a black-box graph injection attack, Bayesian Ridge Regression Injection Attack(BRRIA), is proposed to study the impact of the internal relations on a system and to investigate the vulnerabilities of GNNs. Extensive experiments on two public datasets demonstrate the effectiveness of our attack method. In both experiments targeting specific victim nodes and those attacking a certain category of nodes by targeting critical nodes, BRRIA demonstrates a higher attack accuracy compared to an advanced method. Besides, a synthetic dataset designed to simulate industrial production processes was used to demonstrate the effectiveness of the BRRIA method.

19 March 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
QWQiang Wu
Qiang Wu
YHYiming Huang
Yiming Huang
YZYujie Zeng
Yujie Zeng
YTYijie Teng
Yijie Teng
FZFang Zhou
Fang Zhou
Linyuan LüLinyuan Lü
Linyuan Lü
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.

13 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
CSChang Su
Chang Su
FZFang Zhou
Fang Zhou
Linyuan LüLinyuan Lü
Linyuan Lü
Exploring the internal mechanism of information spreading is critical for understanding and controlling the process. Traditional spreading models often assume individuals play the same role in the spreading process. In reality, however, individuals' diverse characteristics contribute differently to the spreading performance, leading to a heterogeneous infection rate across the system. To investigate network spreading dynamics under heterogeneous infection rates, we integrate two individual-level features -- influence (i.e., the ability to influence neighbors) and susceptibility (i.e., the extent to be influenced by neighbors) -- into the independent cascade model. Our findings reveal significant differences in spreading performance under heterogeneous and constant infection rates, with traditional structural centrality metrics proving more effective in the latter scenario. Additionally, we take the constant and heterogeneous infection rates into a state-of-the-art maximization algorithm, the well-known TIM algorithm, and find the seeds selected by heterogeneous infection rates are more dispersed compared to those under constant rates. Lastly, we find that both individuals' influence and susceptibility are vital to the spreading performance. Strikingly, susceptible individuals are particularly important to spreading when information is disseminated by social celebrities. By integrating influence and susceptibility into the spreading model, we gain a more profound understanding of the underlying mechanisms driving information spreading.