Approximating Clustering Coefficient and Transitivity

DOI10.7155/JGAA.00108MaRDI QIDQ3378518zbMATH OpenOpenAlexFDO

Authors Thomas Schank, Dorothea Wagner

Publication date 3 April 2006

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/52329

zbMATH Keywords

fast approximation algorithmgraph generator algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Efficient computation of the Weighted Clustering Coefficient
• Efficient Computation of the Weighted Clustering Coefficient
• Estimating Clustering Indexes in Data Streams
• The clustering coefficient of a scale-free random graph
• Large values of the clustering coefficient

Cited in

(21)

• Predicting adolescent social networks to stop smoking in secondary schools
• Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
• Influence of dynamical change of edges on clustering coefficients
• Tuning the clustering coefficient of generalized circulant networks
• Network properties of healthy and Alzheimer brains
• Clustering coefficients of large networks
• Large values of the clustering coefficient
• Clique counting in MapReduce: algorithms and experiments
• A quantitative measure for path structures of complex networks
• Efficient Computation of the Weighted Clustering Coefficient
• An experimental study on generating planar graphs
• Colorful triangle counting and a \textsc{MapReduce} implementation
• Approximately counting triangles in sublinear time
• On the Complexity of Sampling Vertices Uniformly from a Graph
• On approximating the number of k-cliques in sublinear time
• Efficient computation of the Weighted Clustering Coefficient
• Interest clustering coefficient: a new metric for directed networks like twitter
• Estimating the clustering coefficient using sample complexity analysis
• Similar coefficient of cluster for discrete elements
• When local and global clustering of networks diverge
• Main-memory triangle computations for very large (sparse (power-law)) graphs

This page was built for publication: Approximating Clustering Coefficient and Transitivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378518)