• Corpus ID: 9716414

# Metric recovery from directed unweighted graphs

@article{Hashimoto2015MetricRF,
title={Metric recovery from directed unweighted graphs},
author={Tatsunori B. Hashimoto and Yi Sun and T. Jaakkola},
journal={ArXiv},
year={2015},
volume={abs/1411.5720}
}
• Published 20 November 2014
• Mathematics, Computer Science
• ArXiv
We analyze directed, unweighted graphs obtained from $x_i\in \mathbb{R}^d$ by connecting vertex $i$ to $j$ iff $|x_i - x_j| < \epsilon(x_i)$. Examples of such graphs include $k$-nearest neighbor graphs, where $\epsilon(x_i)$ varies from point to point, and, arguably, many real world graphs such as co-purchasing graphs. We ask whether we can recover the underlying Euclidean metric $\epsilon(x_i)$ and the associated density $p(x_i)$ given only the directed graph and $d$. We show that consistent…
17 Citations

## Figures from this paper

Approximating geodesics via random points
• Mathematics
The Annals of Applied Probability
• 2019
Given a `cost' functional $F$ on paths $\gamma$ in a domain $D\subset\mathbb{R}^d$, in the form $F(\gamma) = \int_0^1 f(\gamma(t),\dot\gamma(t))dt$, it is of interest to approximate its minimum cost
Rates in the Central Limit Theorem and diffusion approximation via Stein's Method
We present a way to use Stein's method in order to bound the Wasserstein distance of order $2$ between a measure $\nu$ and another measure $\mu$, assumed to be the reversible measure of a diffusion
Lens Depth Function and k-Relative Neighborhood Graph: Versatile Tools for Ordinal Data Analysis
• Computer Science
J. Mach. Learn. Res.
• 2017
This paper proposes algorithms for the problems of medoid estimation, outlier identification, classification, and clustering when given only ordinal data based on estimating the lens depth function and the $k$-relative neighborhood graph on a data set.
Revealing the Basis: Ordinal Embedding Through Geometry
• Computer Science
ArXiv
• 2018
This work considers a computational geometric approach based on selecting comparisons to discover points close to nearly-orthogonal "axes" and embed the whole set by their projections along each axis, which can be viewed as selecting constraints for an optimizer which will produce an almost-perfect embedding for sufficiently dense datasets.
Statistical learning algorithms for geometric and topological data analysis
The concept of persistent homology, a concept of algebraic topology, is used to improve the pooling step of the bag-of-words approach for 3D shapes to improve its efficiency on both real and synthetic data.
Statistical learning algorithms for topological and geometric data analysis
The concept of persistent homology, a concept of algebraic topology, is used to improve the pooling step of the bag-of-words approach for 3D shapes to improve its efficiency on both real and synthetic data.
On Sampling and Recovery of Topology of Directed Social Networks – A Low-Rank Matrix Completion Based Approach
• Computer Science
2019 IEEE 44th Conference on Local Computer Networks (LCN)
• 2019
Evaluation of the proposed method to extract the network topology from a small sample of distance measures without the need for exhaustive measurements shows that the proposed technique is effective even when only a small fraction of distance entries are available.
Inference in Social Networks from Ultra-Sparse Distance Measurements via Pretrained Hadamard Autoencoders
• Computer Science
2020 IEEE 45th Conference on Local Computer Networks (LCN)
• 2020
An autoencoder based technique paired with pretraining, to predict missing topology information in ultra-sparsely sampled social networks and shows that pretrained autoen coder far outperforms LMC when the number of distance samples available is less than 1%, while being competitive for higher fraction of samples.
Machine learning in a setting of ordinal distance information
This talk will talk about a result that states the asymptotic uniqueness of ordinal embeddings, and introduce data-dependent kernel functions that can be evaluated given only ordinal distance information about a data set that provide a generic alternative to the Ordinal embedding approach and avoid some of its drawbacks.
Supplementary materials and proofs
• Mathematics, Physics
• 2015
2 Hitting times 3 2.1 Typical hitting times are large . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Exponential mixing on spatial graphs . . . . . . . . . . . . . . . .

## References

SHOWING 1-10 OF 20 REFERENCES
Density estimation from unweighted k-nearest neighbor graphs: a roadmap
• Mathematics
NIPS
• 2013
It is proved how one can estimate the density p just from the unweighted adjacency matrix of the graph, without knowing the points themselves or any distance or similarity scores.
Density-preserving quantization with application to graph downsampling
• Computer Science
COLT
• 2014
This work provides a solution to the problem of vector quantization of i.i.d. samples drawn from a densityp on R d that takes the unweighted k-nearest neighbor graph on the sample as input and generates quantization centers that are “evenly spaced”.
Shortest path distance in random k-nearest neighbor graphs
• Computer Science, Mathematics
ICML
• 2012
It is proved that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are detrimental to machine learning.
Random Walks on Infinite Graphs and Groups — a Survey on Selected topics
Contents 1. Introduction 2 2. Basic definitions and preliminaries 3 A. Adaptedness to the graph structure 4 B. Reversible Markov chains 4 C. Random walks on groups 5 D. Group-invariant random walks
An Analysis of the Convergence of Graph Laplacians
• Computer Science, Mathematics
ICML
• 2010
A kernel-free framework is introduced to analyze graph constructions with shrinking neighborhoods in general and apply it to analyze locally linear embedding (LLE) and how desirable properties such as a convergent spectrum and sparseness can be achieved by choosing the appropriate graph construction.
The PageRank Citation Ranking : Bringing Order to the Web
• Computer Science, Mathematics
WWW 1999
• 1999
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
The dynamics of viral marketing
• Computer Science
TWEB
• 2007
While on average recommendations are not very effective at inducing purchases and do not spread very far, this work presents a model that successfully identifies communities, product, and pricing categories for which viral marketing seems to be very effective.
The igraph software package for complex network research
• Computer Science
• 2006
Platform-independent and open source igraph aims to satisfy all the requirements of a graph package while possibly remaining easy to use in interactive mode as well.
Some Useful Functions for Functional Limit Theorems
This paper facilitates applications of the continuous mapping theorem by determining when several important functions and sequences of functions preserve convergence.
A Database for Handwritten Text Recognition Research
• J. Hull
• Computer Science
IEEE Trans. Pattern Anal. Mach. Intell.
• 1994
An image database for handwritten text recognition research is described that contains digital images of approximately 5000 city names, 5000 state names, 10000 ZIP Codes, and 50000 alphanumeric characters to overcome the limitations of earlier databases.