Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 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

Ellipsoidal embeddings of graphs (2403.15023v2)

Published 22 Mar 2024 in cs.SI and cs.DM

Abstract: Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis tools are based on the algebraic representation of graphs via matrices such as the graph Laplacian, or on associated graph embeddings. Such embeddings associate to each node a set of coordinates in a vector space, a representation which can then be employed for learning tasks such as the classification or alignment of the nodes of the graph. As the geometric picture provided by embedding methods enables the use of a multitude of methods developed for vector space data, embeddings have thus gained interest both from a theoretical as well as a practical perspective. Inspired by trace-optimization problems, often encountered in the analysis of graph-based data, here we present a method to derive ellipsoidal embeddings of the nodes of a graph, in which each node is assigned a set of coordinates on the surface of a hyperellipsoid. Our method may be seen as an alternative to popular spectral embedding techniques, to which it shares certain similarities we discuss. To illustrate the utility of the embedding we conduct a case study in which we analyse synthetic and real world networks with modular structure, and compare the results obtained with known methods in the literature.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (64)
  1. S. H. Strogatz. Exploring complex networks. Nature, 410(6825):268–276, March 2001.
  2. M. E. J. Newman. The structure and function of complex networks. SIAM review, 45(2):167–256, 2003.
  3. Complex networks: Structure and dynamics. Physics Reports, 424(4-5):175–308, 2006.
  4. Synchronization in complex networks. Physics Reports, 469(3):93–153, 2008.
  5. Critical phenomena in complex networks. Rev. Mod. Phys., 80:1275–1335, October 2008.
  6. O. Sporns and E. Bullmore. Complex brain networks: graph theoretical analysis of structural and functional systems. Nat Rev Neurosci., 10, 2009.
  7. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys., 74:47–97, Jan 2002.
  8. T. Qin and K. Rohe. Regularized spectral clustering under the degree-corrected stochastic blockmodel. In Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2, NIPS’13, pages 3120–3128, 2013.
  9. U. von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395–416, 2007.
  10. Spectral clustering and the high-dimensional stochastic blockmodel. The Annals of Statistics, 39(4):1878–1915, 2011.
  11. Statistical inference on random dot product graphs: a survey. Journal of Machine Learning Research, 18(226):1–92, 2018.
  12. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, 2008.
  13. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8):888–905, August 2000.
  14. M. E. J. Newman. Spectral methods for community detection and graph partitioning. Phys. Rev. E, 88:042822, 2013.
  15. Consistency of spectral clustering. The Annals of Statistics, 36(2):555–586, apr 2008.
  16. The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering. In Machine Learning: ECML 2004, volume 3201 of Lecture Notes in Computer Science, pages 371–383. Springer Berlin / Heidelberg, 2004.
  17. Multiway spectral clustering: A margin-based perspective. Statistical Science, 23(3):383–403, 2008.
  18. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. Proceedings of the National Academy of Sciences, 102(21):7426–7431, 2005.
  19. S. Lafon and A.B. Lee. Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterization. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 28(9):1393–1403, September 2006.
  20. Diffusion maps, spectral clustering and reaction coordinates of dynamical systems. Applied and Computational Harmonic Analysis, 21(1):113–127, 2006. Diffusion Maps and Wavelets.
  21. Geometric network comparisons. In Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI’15, pages 102–110, Arlington, Virginia, United States, 2015. AUAI Press.
  22. L. Lovász. Large Networks and Graph Limits, volume 60 of Colloquium Publications. American Mathematical Society, 2012.
  23. E. Abbe and C. Sandon. Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 670–688, Oct 2015.
  24. Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel. Technometrics, 0(0):1–12, 2022.
  25. The hyperspherical geometry of community detection: modularity as a distance. Journal of Machine Learning Research, 24(112):1–36, 2023.
  26. Dynamics based features for graphs classification. arxiv:1705.10817, submitted.
  27. Representation learning on graphs: Methods and applications. arXiv preprint arXiv:1709.05584, 2017.
  28. A. Grover and J. Leskovec. node2vec: Scalable feature learning for networks. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2016.
  29. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
  30. B. Mohar. The laplacian spectrum of graphs. In Graph Theory, Combinatorics, and Applications, pages 871–898. Wiley, 1991.
  31. Spectral k-way ratio-cut partitioning and clustering. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13(9):1088–1096, 1994.
  32. T. P. Peixoto. Nonparametric bayesian inference of the microcanonical stochastic block model. Phys. Rev. E, 95:012317, Jan 2017.
  33. A. A. Amini and E. Levina. On semidefinite relaxations for the block model. Ann. Statist., 46(1):149–179, 02 2018.
  34. Achieving exact cluster recovery threshold via semidefinite programming. IEEE Transactions on Information Theory, 62(5):2788–2797, May 2016.
  35. Phase transitions in semidefinite relaxations. PNAS, 113(16):E2218–E2223, 2016.
  36. N. Boumal. Nonconvex phase synchronization. SIAM Journal on Optimization, 26(No. 4):2355–2377, 2016.
  37. A. Singer. Angular synchronization by eigenvectors and semidefinite programming. Applied and computational harmonic analysis, 30(1):20, 2011.
  38. The non-convex burer–monteiro approach works on smooth semidefinite programs. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS’16, pages 2765–2773, 2016.
  39. Maximizing modularity is hard, 2006.
  40. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74:036104, Sep 2006.
  41. Generalized power method for sparse principal component analysis. J. Mach. Learn. Res., 11:517–553, March 2010.
  42. Y. Chen and E. Candes. The projected power method: An efficient algorithm for joint alignment from pairwise differences, arxiv:1609.05820. 2016.
  43. A. Aspeel. Community Detection in Large-Scale Time-Varying Networks, A Modularity Based Approach; Master thesis, Université catholique de Louvain, 2017.
  44. Y. E. Nesterov. A method for solving the convex programming problem with convergence rate 𝒪⁢(1/k2)𝒪1superscript𝑘2\mathcal{O}(1/k^{2})caligraphic_O ( 1 / italic_k start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT ). In Dokl. Akad. Nauk SSSR, volume 269, pages 543–547, 1983.
  45. Positive semi-definite embedding for dimensionality reduction and out-of-sample extensions. SIAM Journal on Mathematics of Data Science, 4(1):153–178, 2022.
  46. Stability of graph communities across time scales. Proceedings of the National Academy of Sciences, 107(29):12755–12760, 2010.
  47. Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit. PLoS ONE, 7(2):e32210, 2 2012.
  48. The Stability of a Graph Partition: A Dynamics-Based Framework for Community Detection. In Animesh Mukherjee, Monojit Choudhury, Fernando Peruani, Niloy Ganguly, and Bivas Mitra, editors, Dynamics On and Of Complex Networks, Volume 2, Modeling and Simulation in Science, Engineering and Technology, pages 221–242. Springer New York, 5 2013.
  49. Multiscale dynamical embeddings of complex networks. submitted, April 2018.
  50. X. Zhang and M. E. J. Newman. Multiway spectral community detection in networks. Phys. Rev. E, 92:052808, Nov 2015.
  51. Z. Liu and M. Barahona. Geometric multiscale community detection: Markov stability and vector partitioning. Journal of Complex Networks, page cnx028, 2017.
  52. Benchmark graphs for testing community detection algorithms. Phys. Rev. E, 78:046110, Oct 2008.
  53. Self-similarity of complex networks and hidden metric spaces. Physical review letters, 100(7):078701, 2008.
  54. Julia Kempe. Quantum random walks: an introductory overview. Contemporary Physics, 44(4):307–327, 2003.
  55. S. Bubeck. Convex optimization: Algorithms and complexity. Found. Trends Mach. Learn., 8(3-4):231–357, November 2015.
  56. G. Csardi and T. Nepusz. The igraph software package for complex network research. InterJournal, Complex Systems:1695, 2006.
  57. L. A. Adamic and N. Glance. The political blogosphere and the 2004 u.s. election: Divided they blog. In Proceedings of the 3rd International Workshop on Link Discovery, LinkKDD ’05, pages 36–43, New York, NY, USA, 2005. ACM.
  58. Topological vulnerability of the european power grid under errors and attacks. International Journal of Bifurcation and Chaos, 17(07):2465–2475, 2007.
  59. J. McAuley and J. Leskovec. Learning to discover social circles in ego networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems - Volume 1, NIPS’12, pages 539–547, USA, 2012. Curran Associates Inc.
  60. Collective dynamics of ’small-world’ networks. Nature, 393(6684):440–442, June 1998.
  61. Signed networks in social media. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI ’10, pages 1361–1370, New York, NY, USA, 2010. ACM.
  62. http://www-personal.umich.edu/%7emejn/netdata/.
  63. M. E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98(2):404–409, 2001.
  64. L. Takac and M. Zabovsky. Data analysis in public social networks. In Int. Sci. Conf. and Int. Workshop Present Day Trends of Innovations, pages 1–6, 2012.

Summary

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

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