Fetching the paper…
Reading the bibliography…
We introduce COPT, a novel distance metric between graphs defined via an optimization routine, computing a coordinated pair of optimal transport maps simultaneously.
On translation of mass (in russian)
L. V. Kantorovich · 1942
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S Leinhardt · 1983
Earlier work this paper cites.
A multi-level algorithm for partitioning graphs
Bruce Hendrickson and Robert Leland · 1995
Earlier work this paper cites.
A fast and high quality multilevel scheme for partitioning irregular graphs
G. Karypis and V. Kumar · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
A. L. Barabási and R. Albert · 1999
Earlier work this paper cites.
The complexity of the matrix eigenproblem
V. Y. Pan and Z. Q. Chen · 1999
Earlier work this paper cites.
Emergence of scaling in random networks
A. Steger and N. Wormald · 1999
Earlier work this paper cites.
Networks, dynamics, and the small-world phenomenon
D. J Watts · 1999
Earlier work this paper cites.
Using the nyström method to speed up kernel machines
Christopher KI Williams and Matthias Seeger · 2001
Earlier work this paper cites.
A fast multi-scale method for drawing large graphs
D. H. Y Koren · 2002
Earlier work this paper cites.
Random geometric graphs
M Penrose · 2003
Earlier work this paper cites.
BRENDA, the enzyme database: updates and major new developments
I. Schomburg, A. Chang, C. Ebeling, M. Gremse, C. Heldt, G. Huhn, and D. Schomburg · 2004
Earlier work this paper cites.
Protein function prediction via graph kernels
K. M. Borgwardt, C. S. Ong, S. Schoenauer, S. V. N. Vishwanathan, A. J. Smola, and H. P. Kriegel · 2005
Earlier work this paper cites.
Gaussian Markov random fields: theory and applications
H. Rue and L. Held · 2005
Earlier work this paper cites.
Fast multiscale clustering and manifold identification
Galun M. Kushnir, D. and A. Brandt · 2006
Earlier work this paper cites.
On the geometry of metric measure spaces
K. Sturm · 2006
Earlier work this paper cites.
Weighted graph cuts without eigenvectors a multilevel approach
I. Dhillon, Y. Guan, and B. Kulis · 2007
Earlier work this paper cites.
Weighted graph cuts without eigenvectors a multilevel approach
Guan Y. Dhillon, I. S. and B. Kulis · 2007
Earlier work this paper cites.
Visualizing data using t-sne
L. J. P. van der Maaten and G. E. Hinton · 2008
Earlier work this paper cites.
Graph kernels
S. V. N. Vishwanathan, N. Schraudolph, R. Kondor, and K. Borgwardt · 2010
Cited alongside, same era.
Algebraic distance on graphs
J. Chen and I. Safro · 2011
Cited alongside, same era.
Gromov-Wasserstein distances and the metric approach to object matching
F. Mémoli · 2011
Cited alongside, same era.
Relaxation-based coarsening and multiscale graph organization
D. Ron, I. Safro, and A. Brandt · 2011
Cited alongside, same era.
Wasserstein geometry of Gaussian measures
A. Takatsu · 2011
Cited alongside, same era.
Subgraph matching kernels for attributed graphs
N. Kriege and P. Mutzel · 2012
Cited alongside, same era.
Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver
A multiscale pyramid transform for graph signals
D. I. Shuman, M. J. Faraji, and P. Vandergheynst · 2016
Later among the works it cites.
Geometric deep learning: Going beyond euclidean data
Bruna J. LeCun Y. Szlam A. Bronstein, M. M. and P. Vandergheynst · 2017
Later among the works it cites.
Matching node embeddings for graph similarity
G Nikolentzos, P Meladianos, and M Vazirgiannis · 2017
Later among the works it cites.
Dynamic edgeconditioned filters in convolutional neural networks on graphs
M. Simonovsky and N. Komodakis · 2017
Later among the works it cites.
Gromov-Wasserstein alignment of word embedding spaces
D. Alvarez-Melis and T. S. Jaakkola · 2018
Later among the works it cites.
A family of tractable graph distances
J Bento and S Ioannidis · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
O. E. Livne and A. Brandt · 2012
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Kron reduction of graphs with applications to electrical networks
F. Dörfler and F. Bullo · 2013
Cited alongside, same era.
Spectral networks and locally connected networks on graphs
Bresson X. Defferrard, M. and P Vandergheynst · 2014
Cited alongside, same era.
Powers of tensors and fast matrix multiplication
François Le Gall · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik Kingma and Jimmy Ba · 2015
Cited alongside, same era.
Later among the works it cites.
Spectrally approximating large graphs with smaller graphs
A. Loukas and P. Vandergheynst · 2018
Later among the works it cites.
Graph processing on GPUs: where are the bottlenecks?
Qiumin Xu, Hyeran Jeon, and Murali Annavaram · 2018
Later among the works it cites.
A unifying framework for spectrum-preserving graph sparsification and coarsening
G. Bravo-Hermsdorff and L. M. Gunderson · 2019
Later among the works it cites.
Learning graphs from data: a signal representation perspective
X Dong, D Thanou, M Rabbat, and P Frossard · 2019
Later among the works it cites.
Solving graph compression via optimal transport
V. K. Garg and T. Jakkola · 2019
Later among the works it cites.
Spectral coarsening of geometric operators
Hsueh-Ti Derek Liu, Alec Jacobson, and Maks Ovsjanikov · 2019
Later among the works it cites.
Graph reduction with spectral and cut guarantees
A. Loukas · 2019
Later among the works it cites.
GOT: An optimal transport framework for graph comparison
H. P. Maretic, M. E. Gheche, G. Chierchia, and P. Frossard · 2019
Later among the works it cites.
Optimal transport for structured data with application on graphs
T. Vayer, L. Chapel, R. Flamery, R. Tavenard, and N. Courty · 2019
Later among the works it cites.
Scalable gromov-Wasserstein learning for graph partitioning and matching
Hongteng Xu, Dixin Luo, and Lawrence Carin · 2019
Later among the works it cites.
Gromov-Wasserstein learning for graph matching and node embedding
Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence Carin · 2019
Later among the works it cites.
Wasserstein-based graph alignment
Hermina Petric Maretic, Mireille El Gheche, Matthias Minder, Giovanni Chierchia, and Pascal Frossard · 2020
Closest in time.