Hypergraph Dangling Centrality and DC-HPC: Code, Processed Data, and Reproducibility Materials

This repository contains the source code, processed analytical data, and reproducibility materials supporting the manuscript “Dangling Centrality in Hypergraphs: Structural Vulnerability and Centrality-Guided Overlapping Community Discovery.” The archive includes implementations of Hypergraph Dangling Centrality, conventional hypergraph centralities, baseline hyperedge-percolation community detection, the proposed DC-HPC framework, Spearman rank-correlation analysis, and HDC-, hyperdegree-, and random-seed community-discovery experiments. The study uses the Enron e-mail, NDC-classes, and Walmart Trips hypergraph datasets obtained from the Cornell Higher-Order Network Dataset Repository.