165 citations · 950 across the 71 of their papers we have counts for
4 papers · 2 filters
Spectral Methods from Tensor Networks
Ankur Moitra, Alexander S. Wein
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problem…
Improved Bounds for Randomly Sampling Colorings via Linear Programming
Sitan Chen, Michelle Delcourt, Ankur Moitra +2
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of -colorings of a graph on vertices with maximum degree is r…
Efficiently Learning Mixtures of Mallows Models
Allen Liu, Ankur Moitra
Mixtures of Mallows models are a popular generative model for ranking data coming from a heterogeneous population. They have a variety of applications including social choice, reco…
Linear Programming Bounds for Randomly Sampling Colorings
Sitan Chen, Ankur Moitra
Here we study the problem of sampling random proper colorings of a bounded degree graph. Let be the number of colors and let be the maximum degree. In 1999, Vigoda showed t…