Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exact and rapid linear clustering of networks with dynamic programming

Published 25 Jan 2023 in cs.SI, cs.DS, cs.LG, and stat.CO | (2301.10403v2)

Abstract: We study the problem of clustering networks whose nodes have imputed or physical positions in a single dimension, for example prestige hierarchies or the similarity dimension of hyperbolic embeddings. Existing algorithms, such as the critical gap method and other greedy strategies, only offer approximate solutions to this problem. Here, we introduce a dynamic programming approach that returns provably optimal solutions in polynomial time -- O(n2) steps -- for a broad class of clustering objectives. We demonstrate the algorithm through applications to synthetic and empirical networks and show that it outperforms existing heuristics by a significant margin, with a similar execution time.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. P. Almagro, M. Boguñá,  and M. Á. Serrano, “Detecting the ultra low dimensionality of real networks,” Nat. Commun. 13, 6096 (2022).
  2. M. Barthélemy, “Spatial networks,” Phys. Rep. 499, 1–101 (2011).
  3. N. Pinter-Wollman, E. A. Hobson, J. E. Smith, A. J. Edelman, D. Shizuka, S. de Silva, J. S. Waters, S. D. Prager, T. Sasaki, G. Wittemyer, J. Fewell,  and D. B. McDonald, “The dynamics of animal social networks: analytical, conceptual, and theoretical advances,” Behav. Ecol. 25, 242–255 (2014).
  4. E. A. Power and E. Ready, “Building Bigness: Reputation, Prominence, and Social Capital in Rural South India,” Am. Anthropol. 120, 444–459 (2018).
  5. E. E. Bruch and M. E. J. Newman, “Aspirational pursuit of mates in online dating markets,” Sci. Adv. 4, eaap9815 (2018).
  6. D. F. Gleich, “PageRank Beyond the Web,” SIAM Rev. 57, 321–363 (2015).
  7. J. Moody, “Race, School Integration, and Friendship Segregation in America,” Am. J. Sociol. 107, 679–716 (2001).
  8. M. Belkin and P. Niyogi, “Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering,” in Advances in Neural Information Processing Systems (NeurIPS), Vol. 14 (2001) pp. 585–591.
  9. M. Xu, “Understanding Graph Embedding Methods and Their Applications,” SIAM Rev. 63, 825–853 (2021).
  10. Josep Díaz, Jordi Petit,  and Maria Serna, “A survey of graph layout problems,” ACM Comput. Surv. 34, 313–356 (2002).
  11. M. Boguñá, I. Bonamassa, M. De Domenico, S. Havlin, D. Krioukov,  and M. Á. Serrano, “Network geometry,” Nat. Rev. Phys. 3, 114–135 (2021).
  12. I. Chami, Z. Ying, C. Ré,  and J. Leskovec, “Hyperbolic graph convolutional neural networks,” in Advances in Neural Information Processing Systems (NeurIPS), Vol. 32 (2019) pp. 4868–4879.
  13. A. Ng, M. Jordan,  and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in Advances in Neural Information Processing Systems (NeurIPS), Vol. 14 (2001) pp. 849–856.
  14. S. White and P. Smyth, “A Spectral Clustering Approach To Finding Communities in Graphs,” in Proceedings of the 2005 SIAM International Conference on Data Mining (SDM) (2005) pp. 274–285.
  15. M. E. J. Newman, “Modularity and community structure in networks,” Proc. Natl. Acad. Sci. U.S.A. 103, 8577–8582 (2006).
  16. M. A. Riolo and M. E. J. Newman, “First-principles multiway spectral partitioning of graphs,” J. Complex Netw. 2, 121–140 (2014).
  17. R. Bellman, Dynamic programming (Princeton University Press, 1957).
  18. B. Jackson, J.D. Scargle, D. Barnes, S. Arabhi, A. Alt, P. Gioumousis, E. Gwin, P. Sangtrakulcharoen, L. Tan,  and T. T. Tsai, “An algorithm for optimal partitioning of data on an interval,” IEEE Signal Process. Lett. 12, 105–108 (2005).
  19. B. Ball and M. E. J. Newman, “Friendship networks and social status,” Netw. Sci. 1, 16–30 (2013).
  20. C. De Bacco, D. B. Larremore,  and C. Moore, “A physical model for efficient ranking in networks,” Sci. Adv. 4, eaar8260 (2018).
  21. G. T. Cantwell and C. Moore, “Belief propagation for permutations, rankings, and partial orders,” Phys. Rev. E 105, L052303 (2022).
  22. S. Ragain and J. Ugander, “Pairwise choice markov chains,” in Advances in Neural Information Processing Systems (NeurIPS), Vol. 29 (2016) pp. 3198–3206.
  23. M. E. J. Newman, “Ranking with multiple types of pairwise comparisons,” Proc. R. Soc. A 478, 20220517 (2022).
  24. T. Kawamoto, M. Ochi,  and T. Kobayashi, “Consistency between ordering and clustering methods for graphs,” Phys. Rev. Research 5, 023006 (2023).
  25. I. Jokić and P. Van Mieghem, “Linear clustering process on networks,” IEEE Trans. Netw. Sci. Eng. , 1–10 (2023).
  26. M. Ochi and T. Kawamoto, Finding community structure using the ordered random graph model, Preprint arXiv:2210.08989 (2022).
  27. S. Osat, F. Papadopoulos, A. S. Teixeira,  and F. Radicchi, “Embedding-aided network dismantling,” Phys. Rev. Res. 5, 013076 (2023).
  28. M. Á. Serrano, M. Boguñá,  and F. Sagués, “Uncovering the hidden geometry behind metabolic networks,” Mol. Biosyst. 8, 843–850 (2012).
  29. Brian Karrer and M. E. J. Newman, “Stochastic blockmodels and community structure in networks,” Phys. Re. E 83, 016107 (2011).
  30. D. E. Knuth and M. F. Plass, “Breaking paragraphs into lines,” Softw. Pract. Exp. 11, 1119–1184 (1981).
  31. C. Moore and S. Mertens, The Nature of Computation (Oxford University Press, 2011).
  32. M. E. J. Newman, G. T. Cantwell,  and J.-G. Young, “Improved mutual information measure for clustering, classification, and community detection,” Phys. Rev. E 101, 042304 (2020).
  33. A. D. Henry, M. Lubell,  and M. McCoy, “Survey-Based Measurement of Public Management and Policy Networks,” J. Policy Anal. Manage. 31, 432–452 (2012).
  34. C. Roth, S. M. Kang, M. Batty,  and M. Barthelemy, “A long-time limit for world subway networks,” J. R. Soc. Interface 9, 2540–2550 (2012).
  35. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Phys. Rev. E 69, 026113 (2004).
  36. S. Fortunato, “Community detection in graphs,” Phys. Rep. 486, 75–174 (2010).
  37. G. García-Pérez, A. Allard, M. Á. Serrano,  and M. Boguñá, “Mercator: uncovering faithful hyperbolic embeddings of complex networks,” New J. Phys. 21, 123033 (2019).
  38. A. Ghasemian, H. Hosseinmardi,  and A. Clauset, “Evaluating Overfit and Underfit in Models of Network Community Structure,” IEEE Trans. Knowl. Data Eng. 32, 1722–1735 (2020).
  39. Jack Choquette, “NVIDIA hopper H100 GPU: Scaling performance,” IEEE Micro  (2023).
  40. V. D. Blondel, J.-L. Guillaume, R. Lambiotte,  and E. Lefebvre, “Fast unfolding of communities in large networks,” J. Stat. Mech. 2008, P10008 (2008).
  41. A. Clauset, M. E. J. Newman,  and C. Moore, “Finding community structure in very large networks,” Phys. Rev. E 70, 066111 (2004).
  42. B. Désy, P. Desrosiers,  and A. Allard, “Dimension matters when modeling network communities in hyperbolic spaces,” PNAS Nexus 2, pgad136 (2023).
  43. C. Seshadhri, A. Sharma, A. Stolman,  and A. Goel, “The impossibility of low-rank representations for triangle-rich complex networks,” Proc. Natl. Acad. Sci. U.S.A. 117, 5631–5637 (2020).
Citations (5)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up