Clustering coefficient reflecting pairwise relationships within hyperedges
Abstract Hypergraphs are generalizations of simple graphs that allow for the representation of complex group interactions beyond pairwise relationships. Clustering coefficients quantify local link density in networks and have been widely studied for both simple graphs and hypergraphs. However, exist...
Saved in:
| Main Authors: | Rikuya Miyashita, Shiori Hironaka, Kazuyuki Shudo |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-07869-8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Sampling nodes and hyperedges via random walks on large hypergraphs
by: Kazuki Nakajima, et al.
Published: (2025-06-01) -
CENSor: Detecting Illicit Bitcoin Operation via GCN-Based Hyperedge Classification
by: Suyeol Lee, et al.
Published: (2024-01-01) -
Research on relevance between k-core and clustering coefficient in complex network
by: Jun LIU, et al.
Published: (2015-01-01) -
Comparison of modularity-based approaches for nodes clustering in hypergraphs
by: Poda, Veronica, et al.
Published: (2024-03-01) -
Hypernetwork link prediction method based on the SCL-CMM model
by: REN Yuyuan, et al.
Published: (2024-06-01)