Fetching the paper…
Reading the bibliography…
Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning.
Continuity and location of zeros of linear combinations of polynomials
Mishael Zedek. 1965 · 1965
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation. III
Chandler Davis and William Morton Kahan. 1970 · 1970
Earlier work this paper cites.
The structure of superspace
David A Edwards. 1975 · 1975
Earlier work this paper cites.
Groups of polynomial growth and expanding maps
Mikhael Gromov. 1981 · 1981
Earlier work this paper cites.
Cross-validatory choice of the number of components from a principal component analysis
HT Eastment and WJ Krzanowski. 1982 · 1982
Earlier work this paper cites.
A distance measure between attributed relational graphs for pattern recognition
Alberto Sanfeliu and King-Sun Fu. 1983 · 1983
Earlier work this paper cites.
Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity
Asim Kumar Debnath, Rosa L Lopez de Compadre, Gargi Debnath, Alan J Shusterman, and Corwin Hansch. 1991 · 1991
Earlier work this paper cites.
On a relation between graph edit distance and maximum common subgraph
Horst Bunke. 1997 · 1997
Earlier work this paper cites.
Normalized cuts and image segmentation
Jianbo Shi and Jitendra Malik. 2000 · 2000
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Ng, Michael Jordan, and Yair Weiss. 2001 · 2001
Earlier work this paper cites.
Laplacian eigenmaps for dimensionality reduction and data representation
Mikhail Belkin and Partha Niyogi. 2003 · 2003
Earlier work this paper cites.
On graph kernels: Hardness results and efficient alternatives
Thomas Gärtner, Peter Flach, and Stefan Wrobel. 2003 · 2003
Earlier work this paper cites.
Laplacians and the Cheeger inequality for directed graphs
Fan Chung. 2005 · 2005
Earlier work this paper cites.
Metric structures for Riemannian and non-Riemannian spaces
Mikhail Gromov. 2007 · 2007
Earlier work this paper cites.
On the use of Gromov-Hausdorff distances for shape comparison
Facundo Mémoli. 2007 · 2007
Earlier work this paper cites.
Laplace-Beltrami eigenfunctions for deformation invariant shape representation. In Symposium on geometry processing , Vol. 257. 225–233
Raif M Rustamov et al · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike Von Luxburg. 2007 · 2007
Earlier work this paper cites.
Resolving the sign ambiguity in the singular value decomposition
Rasmus Bro, Evrim Acar, and Tamara G Kolda. 2008 · 2008
Earlier work this paper cites.
Exploring network structure, dynamics, and function using NetworkX
Aric Hagberg, Pieter Swart, and Daniel S Chult. 2008 · 2008
Earlier work this paper cites.
A study of graph spectra for comparing graphs and trees
Richard C Wilson and Ping Zhu. 2008 · 2008
Earlier work this paper cites.
Gromov-Hausdorff stable signatures for shapes using persistence. In Computer Graphics Forum , Vol. 28. Wiley Online Library, 1393–1403
Frédéric Chazal, David Cohen-Steiner, Leonidas J Guibas, Facundo Mémoli, and Steve Y Oudot. 2009 · 2009
Earlier work this paper cites.
Faster computation of the direct product kernel for graph classification. In 2009 IEEE Symposium on Computational Intelligence and Data Mining . IEEE, 267–274
Nikhil S Ketkar, Lawrence B Holder, and Diane J Cook. 2009 · 2009
Earlier work this paper cites.
Optimal transport: old and new . Vol. 338
Cédric Villani. 2009 · 2009
Earlier work this paper cites.
Comparing stars: On approximating graph edit distance
Zhiping Zeng, Anthony KH Tung, Jianyong Wang, Jianhua Feng, and Lizhu Zhou. 2009 · 2009
Cited alongside, same era.
Novel topological descriptors for analyzing biological networks
Matthias M Dehmer, Nicola N Barbarini, Kurt K Varmuza, and Armin A Graber. 2010 · 2010
Cited alongside, same era.
A survey of graph edit distance
Xinbo Gao, Bing Xiao, Dacheng Tao, and Xuelong Li. 2010 · 2010
Cited alongside, same era.
Graph kernels
S Vichy N Vishwanathan, Nicol N Schraudolph, Risi Kondor, and Karsten M Borgwardt. 2010 · 2010
Cited alongside, same era.
Network anatomy and in vivo physiology of visual cortical neurons
Davi D Bock, Wei-Chung Allen Lee, Aaron M Kerlin, Mark L Andermann, Greg Hood, Arthur W Wetzel, Sergey Yurgenson, Edward R Soucy, Hyon Suk Kim, and R Clay Reid. 2011 · 2011
Cited alongside, same era.
A tutorial in connectome analysis: topological and spatial features of brain networks
Marcus Kaiser. 2011 · 2011
The journey of graph kernels through two decades
Swarnendu Ghosh, Nibaran Das, Teresa Gonçalves, Paulo Quaresma, and Mahantapas Kundu. 2018 · 2018
Later among the works it cites.
Netlsd: hearing the shape of a graph. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 2347–2356
Anton Tsitsulin, Davide Mottin, Panagiotis Karras, Alexander Bronstein, and Emmanuel Müller. 2018 · 2018
Later among the works it cites.
Optimal Transport for structured data with application on graphs
Titouan Vayer, Laetitia Chapel, Rémi Flamary, Romain Tavenard, and Nicolas Courty. 2018 · 2018
Later among the works it cites.
A community-developed open-source computational ecosystem for big neuro data
Joshua T Vogelstein, Eric Perlman, Benjamin Falk, Alex Baden, William Gray Roncal, Vikram Chandrashekhar, Forrest Collman, Sharmishtaa Seshamani, Jesse L Patsolic, Kunal Lillaney, et al · 2018
Later among the works it cites.
An information-theoretic, all-scales approach to comparing networks
James P Bagrow and Erik M Bollt. 2019 · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Netsimile: A scalable approach to size-independent network similarity
Michele Berlingerio, Danai Koutra, Tina Eliassi-Rad, and Christos Faloutsos. 2012 · 2012
Cited alongside, same era.
Combining collation and annotation efforts toward completion of the rat and mouse connectomes in BAMS
Mihail Bota, Hong-Wei Dong, and Larry W Swanson. 2012 · 2012
Cited alongside, same era.
Matrix analysis
Roger A Horn and Charles R Johnson. 2012 · 2012
Cited alongside, same era.
Many sparse cuts via higher eigenvalues. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing . 1131–1140
Anand Louis, Prasad Raghavendra, Prasad Tetali, and Santosh Vempala. 2012 · 2012
Cited alongside, same era.
System-wide rewiring underlies behavioral differences in predatory and bacterial-feeding nematodes
DanieláJ Bumbarger, Metta Riebesell, RalfáJ Sommer, et al · 2013
Cited alongside, same era.
Deltacon: A principled massive-graph similarity function. In Proceedings of the 2013 SIAM International Conference on Data Mining . SIAM, 162–170
Danai Koutra, Joshua T Vogelstein, and Christos Faloutsos. 2013 · 2013
Cited alongside, same era.
Later among the works it cites.
GOT: An optimal transport framework for graph comparison
Hermina Petric Maretic, Mireille EL Gheche, Giovanni Chierchia, and Pascal Frossard. 2019 · 2019
Later among the works it cites.
Giannis Nikolentzos, Giannis Siglidis, and Michalis Vazirgiannis. 2019 · 2019
Later among the works it cites.
Efficient estimation of a Gromov–Hausdorff distance between unweighted graphs
Vladyslav Oles, Nathan Lemons, and Alexander Panchenko. 2019 · 2019
Later among the works it cites.
Fourier could be a data scientist: From graph Fourier transform to signal processing on graphs
Benjamin Ricaud, Pierre Borgnat, Nicolas Tremblay, Paulo Gonçalves, and Pierre Vandergheynst. 2019 · 2019
Later among the works it cites.
Spectral and Algebraic Graph Theory. (2019)
Daniel Spielman. 2019 · 2019
Later among the works it cites.
Comparing methods for comparing networks
Mattia Tantardini, Francesca Ieva, Lucia Tajoli, and Carlo Piccardi. 2019 · 2019
Later among the works it cites.
Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning . PMLR, 6932–6941
Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence Carin. 2019 · 2019
Later among the works it cites.
Graph Kernels: State-of-the-Art and Future Challenges
Karsten Borgwardt, Elisabetta Ghisu, Felipe Llinares-López, Leslie O’Bray, and Bastian Rieck. 2020 · 2020
Later among the works it cites.
Wasserstein embedding for graph learning
Soheil Kolouri, Navid Naderializadeh, Gustavo K Rohde, and Heiko Hoffmann. 2020 · 2020
Later among the works it cites.
A survey on graph kernels
Nils M Kriege, Fredrik D Johansson, and Christopher Morris. 2020 · 2020
Later among the works it cites.
Modeling network populations via graph distances
Simón Lunagómez, Sofia C Olhede, and Patrick J Wolfe. 2020 · 2020
Later among the works it cites.
Metrics for graph comparison: a practitioner’s guide
Peter Wills and François G Meyer. 2020 · 2020
Later among the works it cites.
Spectral methods for data science: A statistical perspective
Yuxin Chen, Yuejie Chi, Jianqing Fan, Cong Ma, et al · 2021
Later among the works it cites.
Generalized spectral clustering via Gromov-Wasserstein learning. In International Conference on Artificial Intelligence and Statistics . PMLR, 712–720
Samir Chowdhury and Tom Needham. 2021 · 2021
Later among the works it cites.
Graph Matching via Optimal Transport
Ali Saad-Eldin, Benjamin D Pedigo, Carey E Priebe, and Joshua T Vogelstein. 2021 · 2021
Later among the works it cites.
Sign and basis invariant networks for spectral graph representation learning
Derek Lim, Joshua Robinson, Lingxiao Zhao, Tess Smidt, Suvrit Sra, Haggai Maron, and Stefanie Jegelka. 2022 · 2022
Closest in time.
Learning convolutional neural networks for graphs. In International conference on machine learning . PMLR, 2014–2023
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016 · 2023
Closest in time.