30 citations · 31 across the 10 of their papers we have counts for
4 papers · 1 filter
Limits of Weighted Graphs via Random Quotients
Eitan Levin, Venkat Chandrasekaran
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchange…
Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity
Venkat Chandrasekaran, Timothy Duff, Jose Israel Rodriguez +1
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optim…
Poset-Markov Channels: Capacity via Group Symmetry
Eray Unsal Atay, Eitan Levin, Venkat Chandrasekaran +1
Computing channel capacity is in general intractable because it is given by the limit of a sequence of optimization problems whose dimensionality grows to infinity. As a result, co…
Any-Dimensional Polynomial Optimization via de Finetti Theorems
Eitan Levin, Venkat Chandrasekaran
Polynomial optimization problems often arise in sequences indexed by dimension, and it is of interest to compute bounds on the optimal values of all problems in the sequence. Examp…