Search Results for author:
Found 3 papers, 2 papers with code
Dynamic Ranking and Translation Synchronization
In this setup, we are given a sequence of comparison graphs $(G_t)_{t\in \mathcal{T}}$, where $\mathcal{T} \subset [0, 1]$ is a grid representing the time domain, and for each item $i$ and time $t\in \mathcal{T}$ there is an associated unknown strength parameter $z^*_{t, i}\in \mathbb{R}$.
Seeded graph matching for the correlated Wigner model via the projected power method
In the \emph{graph matching} problem we observe two graphs $G, H$ and the goal is to find an assignment (or matching) between their vertices such that some measure of edge agreement is maximized.
Latent Distance Estimation for Random Geometric Graphs
We introduce a spectral estimator of the pairwise distance between latent points and we prove that its rate of convergence is the same as the nonparametric estimation of a function on $\mathbb{S}^{d-1}$, up to a logarithmic factor.
