On Clustering Coefficients in Complex Networks

January 04, 2024 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexander I Nesterov arXiv ID 2401.02999 Category physics.soc-ph Cross-listed cs.NI, cs.SI Citations 1 Venue arXiv.org Last Checked 4 months ago
Abstract
The clustering coefficient is a valuable tool for understanding the structure of complex networks. It is widely used to analyze social networks, biological networks, and other complex systems. While there is generally a single common definition for the local clustering coefficient, there are two different ways to calculate the global clustering coefficient. The first approach takes the average of the local clustering coefficients for each node in the network. The second one is based on the ratio of closed triplets to all triplets. It is shown that these two definitions of the global clustering coefficients are strongly inequivalent and may significantly impact the accuracy of the outcome.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted