Efficient Computation of the Weighted Clustering Coefficient

DOI10.1007/978-3-319-13123-8_4zbMath1342.05166OpenAlexW3032173745MaRDI QIDQ2945270

Silvio Lattanzi, Stefano Leonardi

Publication date: 9 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11573/951136

zbMATH Keywords

sampling techniquesclustering coefficient in weighted networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network protocols (68M12)

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
• Triangle Sparsifiers
• Approximating Clustering Coefficient and Transitivity
• 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