Random Walks in Polytopes and Negative Dependence
We present a Gaussian random walk in a polytope that starts at a point inside and continues until it gets absorbed at a vertex. Our main result is that the probability distribution induced on the
vertices by this random walk has strong negative dependence properties for matroid polytopes. Such distributions are highly sought after in randomized algorithms as they imply concentration
properties. Our random walk is simple to implement, computationally efficient and can be viewed as an algorithm to round the starting point in an unbiased manner. The proof relies on a simple
inductive argument that synthesizes the combinatorial structure of matroid polytopes with the geometric structure of multivariate Gaussian distributions. Our result not only implies a long
line of past results in a unified and transparent manner, but also implies new results about constructing negatively associated distributions for all matroids.
Random walks
Matroid
Polytope
Brownian motion
Negative dependence
50:1-50:10
Regular Paper
Yuval
Peres
Yuval Peres
Mohit
Singh
Mohit Singh
Nisheeth K.
Vishnoi
Nisheeth K. Vishnoi
10.4230/LIPIcs.ITCS.2017.50
Nima Anari, Shayan Oveis Gharan, and Alireza Rezaei. Monte carlo markov chain algorithms for sampling strongly rayleigh distributions and determinantal point processes. In Vitaly Feldman, Alexander Rakhlin, and Ohad Shamir, editors, Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016, volume 49 of JMLR Workshop and Conference Proceedings, pages 103-115. JMLR.org, 2016. URL: http://jmlr.org/proceedings/papers/v49/anari16.html.
http://jmlr.org/proceedings/papers/v49/anari16.html
Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, and Amin Saberi. An o(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pages 379-389. SIAM, 2010. URL: http://dx.doi.org/10.1137/1.9781611973075.32.
http://dx.doi.org/10.1137/1.9781611973075.32
Julius Borcea, Petter Brändén, and Thomas Liggett. Negative dependence and the geometry of polynomials. Journal of the American Mathematical Society, 22(2):521-567, 2009.
Petter Brändén and Rafael S González D'León. On the half-plane property and the tutte group of a matroid. Journal of Combinatorial Theory, Series B, 100(5):485-492, 2010.
Petter Brändén and Johan Jonasson. Negative dependence in sampling. Scandinavian Journal of Statistics, 39(4):830-838, 2012.
Chandra Chekuri, Jan Vondrak, and Rico Zenklusen. Dependent randomized rounding via exchange properties of combinatorial structures. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pages 575-584. IEEE, 2010.
Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Multi-budgeted matchings and matroid intersection via dependent rounding. In Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms, pages 1080-1097. SIAM, 2011.
Devdatt P Dubhashi and Alessandro Panconesi. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, 2009.
Devdatt P Dubhashi and Desh Ranjan. Balls and bins: A study in negative dependence. BRICS Report Series, 3(25), 1996.
Tomás Feder and Milena Mihail. Balanced matroids. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 26-38. ACM, 1992.
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. Dependent rounding and its applications to approximation algorithms. Journal of the ACM (JACM), 53(3):324-360, 2006.
Shayan Oveis Gharan, Amin Saberi, and Mohit Singh. A randomized rounding approach to the traveling salesman problem. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 550-559. IEEE, 2011.
Kumar Joag-Dev and Frank Proschan. Negative association of random variables with applications. The Annals of Statistics, pages 286-295, 1983.
Lap Chi Lau, Ramamoorthi Ravi, and Mohit Singh. Iterative methods in combinatorial optimization, volume 46. Cambridge University Press, 2011.
Shachar Lovett and Raghu Meka. Constructive discrepancy minimization by walking on the edges. SIAM J. Comput., 44(5):1573-1582, 2015. URL: http://dx.doi.org/10.1137/130929400.
http://dx.doi.org/10.1137/130929400
Ronald F Patterson, Wendy D Smith, Robert L Taylor, and Abolghassem Bozorgnia. Limit theorems for negatively dependent random variables. Nonlinear Analysis: Theory, Methods &Applications, 47(2):1283-1295, 2001.
Robin Pemantle. Towards a theory of negative dependence. Journal of Mathematical Physics, 41(3):1371-1390, 2000.
Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer Science &Business Media, 2002.
Mohit Singh and Nisheeth K. Vishnoi. Entropy, optimization and counting. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages 50-59. ACM, 2014. URL: http://dx.doi.org/10.1145/2591796.2591803.
http://dx.doi.org/10.1145/2591796.2591803
Aravind Srinivasan. Distributions on level-sets with applications to approximation algorithms. In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, pages 588-597. IEEE, 2001.
Ming Yuan, Chun Su, and Taizhong Hu. A central limit theorem for random fields of negatively associated processes. Journal of Theoretical Probability, 16(2):309-323, 2003.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode