James R. Lee

activity

20042022

most citedMeasured descent: A new embedding method for finite metrics

72 citations · 223 across the 37 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

cs.DS2017

k-server via multiscale entropic regularization

Sebastien Bubeck, Michael B. Cohen, James R. Lee +2

We present an $O ((lo g k)^{2})$ -competitive randomized algorithm for the $k$ -server problem on hierarchically separated trees (HSTs). This is the first $o (k)$ -competitive randomized…

cs.DS2017

Fusible HSTs and the randomized k-server conjecture

James R. Lee

We exhibit an $O ((lo g k)^{6})$ -competitive randomized algorithm for the $k$ -server problem on any metric space. It is shown that a potential-based algorithm for the fractional $k$ -s…

math.MG2017★ 1 cited

Discrete uniformizing metrics on distributional limits of sphere packings

James R. Lee

Suppose that ${G_{n}}$ is a sequence of finite graphs such that each $G_{n}$ is the tangency graph of a sphere packing in $R^{d}$ . Let $ρ_{n}$ be a uniformly random vertex of $G…

math.PR2017★ 3 cited

Conformal growth rates and spectral geometry on distributional limits of graphs

James R. Lee

For a unimodular random graph $(G, ρ)$ , we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal grow…