On the structure of isometrically embeddable metric spaces
From MaRDI portal
Publication:5071129
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science (46B85) Geometric embeddings of metric spaces (30L05)
Abstract: Since its popularization in the 1970s the Fiedler vector of a graph has become a standard tool for clustering of the vertices of the graph. Recently, Mendel and Noar, Dumitriu and Radcliffe, and Radcliffe and Williamson have introduced geometric generalizations of the Fiedler vector. Motivated by questions stemming from their work we provide structural characterizations for when a finite metric space can be isometrically embedded in a Hilbert space.
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3882485 (Why is no real title available?)
- scientific article; zbMATH DE number 4208110 (Why is no real title available?)
- scientific article; zbMATH DE number 3920523 (Why is no real title available?)
- scientific article; zbMATH DE number 3536162 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- An introduction to the theory of reproducing kernel Hilbert spaces
- Conditionally strictly negative definite kernels
- Corrigendum to "On Isometric Embeddings of Graphs"
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
- Euclidean distortion and the sparsest cut
- Expander flows, geometric embeddings and graph partitioning
- Expanders with respect to Hadamard spaces and random graphs
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Finite metric spaces of strictly negative type
- Improved Cheeger's inequality, analysis of spectral partitioning algorithms through higher order spectral gap
- Isometric embeddings of graphs
- Isoperimetric numbers of graphs
- Measured descent: A new embedding method for finite metrics
- Nonlinear spectral calculus and super-expanders
- On Isometric Embeddings of Graphs
- On distance scales, embeddings, and efficient relaxations of the cut cone
- On the maximal error of spectral approximation of graph bisection
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Spectra of graphs
- Spectral partitioning with multiple eigenvectors
- Spectral partitioning works: planar graphs and finite element meshes
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(12)- Isometric embeddings of bounded metric spaces in the Gromov-Hausdorff class
- scientific article; zbMATH DE number 3853808 (Why is no real title available?)
- Almost isometric embeddings into configuration-compacta
- Isometric embeddings of a class of separable metric spaces into Banach spaces
- scientific article; zbMATH DE number 2110393 (Why is no real title available?)
- Isometric embedding of ultrametric (non-Archimedean) spaces in Hilbert space and Lebesgue space
- Thick metric spaces, relative hyperbolicity, and quasi-isometric rigidity.
- scientific article; zbMATH DE number 7410408 (Why is no real title available?)
- On isometry and isometric embeddability between ultrametric Polish spaces
- Almost isometric embedding between metric spaces
- On almost isometric embedding from \(C(\Omega)\) into \(C_0(\Omega_0)\)
- On the boundary behavior of imbeddings of metric spaces into a Euclidean space
This page was built for publication: On the structure of isometrically embeddable metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071129)