Metric recovery from directed unweighted graphs
We analyze directed, unweighted graphs obtained from x[subscript i] ∈ R[superscript d] by connecting vertex i to j iff |x[subscript i] − x[subscript j]| < ε(x[subscript i]). Examples of such graphs include k-nearest neighbor graphs, where ε(x[subscript i]) varies from point to point, and, arguabl...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
PMLR
2018
|
| Online Access: | http://hdl.handle.net/1721.1/115404 https://orcid.org/0000-0003-0521-5855 https://orcid.org/0000-0003-4283-6327 https://orcid.org/0000-0002-2199-0379 |