Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lower Ricci Curvature for Efficient Community Detection (2401.10124v2)

Published 18 Jan 2024 in stat.ME, cs.SI, physics.soc-ph, and stat.AP

Abstract: This study introduces the Lower Ricci Curvature (LRC), a novel, scalable, and scale-free discrete curvature designed to enhance community detection in networks. Addressing the computational challenges posed by existing curvature-based methods, LRC offers a streamlined approach with linear computational complexity, making it well-suited for large-scale network analysis. We further develop an LRC-based preprocessing method that effectively augments popular community detection algorithms. Through comprehensive simulations and applications on real-world datasets, including the NCAA football league network, the DBLP collaboration network, the Amazon product co-purchasing network, and the YouTube social network, we demonstrate the efficacy of our method in significantly improving the performance of various community detection algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (59)
  1. Mixed membership stochastic block models. Advances in neural information processing systems 21.
  2. Communities detection for advertising by futuristic greedy method with clustering approach. Big Data 9(1), 22–40.
  3. Generalized Ricci curvature and the geometry of graphs. Actes des rencontres du CIRM 3(1), 69–78.
  4. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008(10), P10008.
  5. Boothby, W. M. (1986). An introduction to differentiable manifolds and Riemannian geometry. Academic press.
  6. Chung, F. R. (1997). Spectral graph theory, Volume 92. American Mathematical Soc.
  7. Network analysis of the cosmos galaxy field. Monthly Notices of the Royal Astronomical Society 477(4), 4738–4748.
  8. Community detection in complex networks: From statistical foundations to data science applications. Wiley Interdisciplinary Reviews: Computational Statistics 14(2), e1566.
  9. Riemannian geometry, Volume 6. Springer.
  10. Ricci curvature of finite Markov chains via convexity of the entropy. Archive for Rational Mechanics and Analysis 206, 997–1038.
  11. Augmentations of Forman’s Ricci curvature and their applications in community detection. arXiv preprint arXiv:2306.06474.
  12. Forman (2003). Bochner’s method for cell complexes and combinatorial Ricci curvature. Discrete & Computational Geometry 29, 323–374.
  13. Fortunato, S. (2010). Community detection in graphs. Physics reports 486(3-5), 75–174.
  14. Community detection in networks: A user guide. Physics reports 659, 1–44.
  15. Girvan, M. and M. E. Newman (2002). Community structure in social and biological networks. Proceedings of the national academy of sciences 99(12), 7821–7826.
  16. The elements of statistical learning: data mining, inference, and prediction, Volume 2. Springer.
  17. Stochastic block models: First steps. Social networks 5(2), 109–137.
  18. Multiple local community detection. ACM SIGMETRICS Performance Evaluation Review 45(3), 76–83.
  19. Co-citation and co-authorship networks of statisticians. Journal of Business & Economic Statistics 40(2), 469–485.
  20. Ollivier’s Ricci curvature, local clustering and curvature-dimension inequalities on graphs. Discrete & Computational Geometry 51(2), 300–322.
  21. The web as a graph: Measurements, models, and methods. In Computing and Combinatorics: 5th Annual International Conference, COCOON’99 Tokyo, Japan, July 26–28, 1999 Proceedings 5, pp. 1–17. Springer.
  22. A guide to conquer the biological network era using graph theory. Frontiers in bioengineering and biotechnology 8, 34.
  23. Learning to discover social circles in ego networks. Advances in neural information processing systems 25.
  24. Ricci curvature of graphs. Tohoku Mathematical Journal, Second Series 63(4), 605–627.
  25. Lin, Y. and S.-T. Yau (2010). Ricci curvature and eigenvalue estimate on locally finite graphs. Mathematical research letters 17(2), 343–356.
  26. Measurement and Analysis of Online Social Networks. In Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC’07), San Diego, CA.
  27. Mohar, B. (1989). Isoperimetric numbers of graphs. Journal of combinatorial theory, Series B 47(3), 274–291.
  28. Newman, M. E. (2001). The structure of scientific collaboration networks. Proceedings of the national academy of sciences 98(2), 404–409.
  29. Newman, M. E. (2004). Fast algorithm for detecting community structure in networks. Physical review E 69(6), 066133.
  30. Newman, M. E. (2006). Modularity and community structure in networks. Proceedings of the national academy of sciences 103(23), 8577–8582.
  31. Finding and evaluating community structure in networks. Physical review E 69(2), 026113.
  32. Revisiting over-smoothing and over-squashing using Ollivier-Ricci curvature. In International Conference on Machine Learning, pp. 25956–25979. PMLR.
  33. Ricci curvature of the internet topology. In 2015 IEEE conference on computer communications (INFOCOM), pp.  2758–2766. IEEE.
  34. Ollivier, Y. (2007). Ricci curvature of metric spaces. Comptes Rendus Mathematique 345(11), 643–646.
  35. Uncovering the overlapping community structure of complex networks in nature and society. nature 435(7043), 814–818.
  36. Peixoto, T. P. (2014). Hierarchical block structures and high-resolution model selection in large networks. Physical Review X 4(1), 011047.
  37. Computing communities in large networks using random walks. In Computer and Information Sciences-ISCIS 2005: 20th International Symposium, Istanbul, Turkey, October 26-28, 2005. Proceedings 20, pp.  284–293. Springer.
  38. Defining and identifying communities in networks. Proceedings of the national academy of sciences 101(9), 2658–2663.
  39. Near linear time algorithm to detect community structures in large-scale networks. Physical review E 76(3), 036106.
  40. Rand, W. M. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical association 66(336), 846–850.
  41. Reynolds, D. A. et al. (2009). Gaussian mixture models. Encyclopedia of biometrics 741(659-663).
  42. Méthodes de calcul différentiel absolu et leurs applications. Mathematische Annalen 54(1-2), 125–201.
  43. Rossetti, G. (2020). Angel: efficient, and effective, node-centric community discovery in static and dynamic networks. Applied Network Science 5(1), 26.
  44. Cdlib: a python library to extract, compare and evaluate communities from complex networks. Applied Network Science 4(1), 1–26.
  45. Graph curvature for differentiating cancer networks. Scientific reports 5(1), 12323.
  46. Ollivier-Ricci curvature-based method to community detection in complex networks. Scientific reports 9(1), 9800.
  47. Forman curvature for directed networks. arXiv preprint arXiv:1605.04662.
  48. Forman curvature for complex networks. Journal of Statistical Mechanics: Theory and Experiment 2016(6), 063206.
  49. Academic team formation as evolving hypergraphs. Scientometrics 85(3), 721–740.
  50. Understanding over-squashing and bottlenecks on graphs via curvature. arXiv preprint arXiv:2111.14522.
  51. From Louvain to Leiden: guaranteeing well-connected communities. Scientific reports 9(1), 5233.
  52. Tran, L. (2012). Hypergraph and protein function prediction with gene expression data. arXiv preprint arXiv:1212.0388.
  53. Adapting community detection algorithms for disease module identification in heterogeneous biological networks. Frontiers in genetics 10, 164.
  54. Villani, C. et al. (2009). Optimal transport: old and new, Volume 338. Springer.
  55. Information theoretic measures for clusterings comparison: is a correction for chance necessary? In Proceedings of the 26th annual international conference on machine learning, pp.  1073–1080.
  56. West, D. B. et al. (2001). Introduction to graph theory, Volume 2. Prentice hall Upper Saddle River.
  57. Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In 2011 ieee 11th international conference on data mining workshops, pp.  344–349. IEEE.
  58. Defining and evaluating network communities based on ground-truth. In Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, pp.  1–8.
  59. Community detection based on similarities of communication behavior in ip networks. Journal of Ambient Intelligence and Humanized Computing 13(3), 1451–1461.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets