Efficient computation of the Weighted Clustering Coefficient

References

• L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: Membership, growth, and evolution. In KDD, 2006.
   Google Scholar
• A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani. The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America.
   Web of Science ®Google Scholar
• L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD’08.
   Google Scholar
• B. Bollobas. Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks.
   Google Scholar
• F. Bonchi, F. Gullo, A. Kaltenbrunner, and Y. Volkovich. Core decomposition of uncertain graphs. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’14, pages 1316–1325, New York, NY, USA, 2014. ACM.
   Google Scholar
• C. Budak, D. Agrawal, and A. El Abbadi. Structural trend analysis for online social networks. VLDB’11.
   Google Scholar
• L. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler. Counting triangles in data streams. In PODS 06.
   Google Scholar
• C. Castillo, D. Donato, L. Becchetti, P. Boldi, S. Leonardi, M. Santini, and S. Vigna. A reference collection for web spam. SIGIR ’06.
   Google Scholar
• J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI ’04.
   Google Scholar
• G. Fagiolo. Clustering in complex directed networks. Phys. Rev. E.
   Google Scholar
• S. J. Hardiman and L. Katzir. Estimating clustering coefficients and size of social networks via random walk. In WWW ’13.
   Google Scholar
• P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov.
   Web of Science ®Google Scholar
• P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov., 2008.
   Web of Science ®Google Scholar
• M. Jha, C. Seshadhri, and A. Pinar. A space efficient streaming algorithm for triangle counting using the birthday paradox. In KDD ’13.
   Google Scholar
• G. Kalna and D. J. Higham. Clustering coefficients for weighted networks. In Symposium on Network Analysis in Natural Sciences and Engineering.
   Google Scholar
• H. Kwak, C. Lee, H. Park, and S. Moon. What is twitter, a social network or a news media? In WWW ’10.
   Google Scholar
• M. Latapy. Main-memory triangle computations for very large (sparse(power-law)) graphs. Theoretical Computer Science.
   Web of Science ®Google Scholar
• J. Leskovec and E. Horvitz. Planetary-scale views on a large instant-messaging network.
   Google Scholar
• J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In KDD, 2005.
   Google Scholar
• E. Liberty. Simple and deterministic matrix sketches. In KDD, 2014.
   PubMedGoogle Scholar
• L. Lopez-Fernandez, G. Robles, and J. M. Gonzalez-Barahona. Applying social network analysis to the information in cvs repositories. In 1st International Workshop on Mining Software Repositories (MSR).
   Google Scholar
• M. E. J. Newman. Analysis of weighted networks. Phys. Rev. E, 70:056131, Nov 2004.
   Web of Science ®Google Scholar
• M. E. J. Newman, D. J. Watts, and S. H. Strogatz. Random graph models of social networks. Proc. Natl. Acad. Sci. USA, 99:2566–2572, 2002.
   PubMed Web of Science ®Google Scholar
• J.-P. Onnela, J. Saramäki, J. Kertész, and K. Kaski. Intensity and coherence of motifs in weighted complex networks. Physical Review E.
   Web of Science ®Google Scholar
• T. Opsahl and P. Panzarasa. Clustering in weighted networks. Social Networks.
   Web of Science ®Google Scholar
• R. Pagh and C. E. Tsourakakis. Colorful triangle counting and a mapreduce implementation.
   Google Scholar
• J. Saramäki, M. Kivelä, J.-P. Onnela, K. Kaski, and J. Kertesz. Generalizations of the clustering coefficient to weighted complex networks. Physical Review E.
   Web of Science ®Google Scholar
• T. Schank and D. Wagner. Approximating clustering coefficient and transitivity. Journal of Graph Algorithms and Applications.
   PubMedGoogle Scholar
• T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In WEA ’05.
   Google Scholar
• S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In WWW’ 11.
   Google Scholar
• L. Takac and M. Zabovsky. Data analysis in public social networks. In International Scientific Conference & International Workshop Present Day Trends of Innovations, 2012.
   Google Scholar
• C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. Doulion: counting triangles in massive graphs with a coin. In KDD ’09.
   Google Scholar
• C. E. Tsourakakis, M. N. Kolountzakis, and G. L. Miller. Triangle sparsifiers. J. Graph Algorithms Appl.
   PubMedGoogle Scholar
• D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature.
   Web of Science ®Google Scholar
• J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In ICDM, 2012.
   Google Scholar
• Z. Yang, C. Wilson, X. Wang, T. Gao, B. Y. Zhao, and Y. Dai. Uncovering social network sybils in the wild. In IMF ’11.
   Google Scholar
• B. Zhang, S. Horvath, et al. A general framework for weighted gene co-expression network analysis. Statistical applications in genetics and molecular biology.
   Web of Science ®Google Scholar
• Y. Zhang, Z. Zhang, J. Guan, and S. Zhou. Analytic solution to clustering coefficients on weighted networks. arXiv preprint arXiv:0911.0476, 2009.
   Google Scholar