72 citations · 223 across the 37 of their papers we have counts for
46 papers
Spectral hypergraph sparsification via chaining
James R. Lee
In a hypergraph on vertices where is the maximum size of a hyperedge, there is a weighted hypergraph spectral -sparsifier with at most $O(\varepsilon^{-2} \log…
Multiscale entropic regularization for MTS on general metric spaces
Farzam Ebrahimnejad, James R. Lee
We present an -competitive algorithm for metrical task systems (MTS) on any -point metric space that is also -competitive for service costs. This matches the c…
Non-existence of annular separators in geometric graphs
Farzam Ebrahimnejad, James R. Lee
Benjamini and Papasoglou (2011) showed that planar graphs with uniform polynomial volume growth admit -dimensional annular separators: The vertices at graph distance from an…
Relations between scaling exponents in unimodular random graphs
James R. Lee
We investigate the validity of the "Einstein relations" in the general setting of unimodular random networks. These are equalities relating scaling exponents: …
Chemical subdiffusivity of critical 2D percolation
Shirshendu Ganguly, James R. Lee
We show that random walk on the incipient infinite cluster (IIC) of two-dimensional critical percolation is subdiffusive in the chemical distance (i.e., in the intrinsic graph metr…
On planar graphs of uniform polynomial growth
Farzam Ebrahimnejad, James R. Lee
Consider an infinite planar graph with uniform polynomial growth of degree d > 2. Many examples of such graphs exhibit similar geometric and spectral properties, and it has been co…