12 citations · 12 across the 4 of their papers we have counts for
4 papers
Collaboration of Random Walks on Graphs
Partha S. Dey, Daesung Kim, Grigory Terlov
Consider a collaborative dynamic of independent random walks on a finite connected graph . We are interested in the size of the set of vertices visited by at least one walke…
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
Daesung Kim, Hye Won Chung
The nonconvex formulation of the matrix completion problem has received significant attention in recent years due to its affordable complexity compared to the convex formulation. G…
Sharp inequalities for discrete singular integrals on the lattice
Rodrigo Bañuelos, Daesung Kim, Mateusz Kwaśnicki
This paper investigates higher dimensional versions of the longstanding conjecture verified in [Bañuelos and Kwaśnicki, Duke Math. J. (2019)] that the -norm of the discrete…
Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE
Jeonghwan Lee, Daesung Kim, Hye Won Chung
We study hypergraph clustering in the weighted -uniform hypergraph stochastic block model (\textsf{-WHSBM}), where each edge consisting of nodes from the same community h…