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
-
Mutual clustering coefficient-based suspicious-link detection approach for online social networks
by: Mudasir Ahmad Wani, et al.
Published: (2022-02-01) -
Chain and threshold hypergraphs
by: Shashwath S. Shetty, et al.
Published: (2025-08-01) -
Directed n-Superhypergraphs Incorporating Bipolar Fuzzy Information: A Multi-Tier Framework for Modeling Bipolar Uncertainty in Complex Networks
by: Florentin Smarandache, et al.
Published: (2025-07-01) -
AQST-ClustNet: Hybrid Aquila Quantum Sooty Tern Optimization for User Profile Clustering in Social Network
by: K. Dinesh Babu, et al.
Published: (2025-08-01) -
The simpliciality of higher-order networks
by: Nicholas W. Landry, et al.
Published: (2024-03-01)