Efficient computation of the Weighted Clustering Coefficient
DOI10.1080/15427951.2016.1198281zbMath1461.68156OpenAlexW2460046588MaRDI QIDQ5856442
Silvio Lattanzi, Stefano Leonardi
Publication date: 26 March 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2016.1198281
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22) Internet topics (68M11)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Model of community emergence in weighted social networks
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
- Triangle Sparsifiers
- Approximating Clustering Coefficient and Transitivity
- Estimating Clustering Indexes in Data Streams
- Random graph models of social networks
- Collective dynamics of ‘small-world’ networks
- A General Framework for Weighted Gene Co-Expression Network Analysis
- Experimental and Efficient Algorithms
This page was built for publication: Efficient computation of the Weighted Clustering Coefficient
