Entropic Optimal Transport on Random Graphs

DOI10.1137/22M1518281arXiv2201.03949OpenAlexW4389145971MaRDI QIDQ6148350

Nicolas Keriven

Publication date: 11 January 2024

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.03949

zbMATH Keywords

random graphsoptimal transport

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Continuum limit of total variation on point clouds
• Stability results on the smoothness of optimal transport maps with general costs
• Shortest path through random points
• Universally consistent vertex classification for latent positions graphs
• Gromov-Wasserstein distances and the metric approach to object matching
• Optimal transportation networks. Models and theory
• Towards a theoretical foundation for Laplacian-based manifold methods
• Expected distance based on random walks
• On the estimation of latent distances using graph distances
• Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model
• Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
• The geometry of continuous latent space models for network data
• Matrix estimation by universal singular value thresholding
• Consistency of spectral clustering in stochastic block models
• The Gromov-Wasserstein distance: a brief overview
• Approximating geodesics via random points
• Consistency of spectral clustering
• Convolutional wasserstein distances
• Hitting and commute times in large graphs are often misleading
• Geodesic Methods in Computer Vision and Graphics
• Barycenters in the Wasserstein Space
• Latent Space Approaches to Social Network Analysis
• Community Detection and Stochastic Block Models
• Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithm
• Graph Representation Learning
• A Survey of Statistical Network Models
• Optimal Transport
• <scp>SISTA</scp>: Learning Optimal Transport Costs under Sparsity Constraints

This page was built for publication: Entropic Optimal Transport on Random Graphs