most citedLow rank estimation of smooth kernels on graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing math.STShow all

2 papers · 1 filter

math.ST2012★ 2 cited

Low rank estimation of smooth kernels on graphs

Vladimir Koltchinskii, Pedro Rangel

Let (V,A) be a weighted graph with a finite vertex set V, with a symmetric matrix of nonnegative weights A and with Laplacian . Let be a symme…

math.ST2012

Low Rank Estimation of Similarities on Graphs

Vladimir Koltchinskii, Pedro Rangel

Let (V, E) be a graph with vertex set V and edge set E. Let (X, X', Y) \in V \times V \times {-1, 1} be a random triple, where X, X' are independent uniformly distributed vertices…