Abstract-- We investigate cascade dynamics in thresholdcontrolled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, ...
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
Istvan Erlich, Ganesh K. Venayagamoorthy, Nakawiro...