Random walks on truncated cubes and sampling 0-1 knapsack solutions

SIAM Journal on Computing

Volumn 34, Issue 1, 2005, Pages 195-226

  Morris, Ben ^a   Sinclair, Alistair ^b  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Balanced permutations; Hypercubes; Knapsack problem; Markov chains; Random permutations; Random sampling; Random walks

Indexed keywords

BALANCED PERMUTATIONS; HYPERCUBES; KNAPSACK PROBLEM; RANDOM PERMUTATIONS; RANDOM SAMPLING; RANDOM WALKS;

APPROXIMATION THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; VECTORS;

RANDOM PROCESSES;

EID: 16244391110     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702411915     Document Type: Article

References (19)

1. M. CRYAN, M. DYER, L. GOLDBERG, M. JERRUM, AND R. MARTIN, Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 711-720.
2. P. DAGUM, M. LUBY, M. MIHAIL, AND U. VAZIRANI, Polytopes, permanents and graphs with large factors, in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1988, pp. 412-421.
3. P. DIACONIS AND D. STROOCK, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab., 1 (1991), pp. 36-61.
4. M. DYER, Approximate counting by dynamic programming, in Proceedings of the 35th ACM Symposium on Theory of Computing, ACM, New York, 2003, pp. 693-699.
5. M. DYER, A. FRIEZE, R. KANNAN, A. KAPOOR, L. PERKOVIC, AND U. VAZIRANI, A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem, Combin. Probab. Comput., 2 (1993), pp. 271-284.
6. G. R. GRIMMETT AND D. R. STIRZAKER, Probability and Random Processes, 3rd ed., Oxford University Press, Oxford, UK, 1992.
7. V. GRINBERG AND S. SEVAST'YANOV, Value of the Steinitz constant, Funktsional. Anal, i Prilozhen., 14 (1980), pp. 56-57.
8. W. HOEFFDING, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc., 58 (1963), pp. 13-30.
9. M. R. JERRUM, Mathematical foundations of the Markov chain Monte Carlo method, in Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, eds., Algorithms Combin. 16, Springer-Verlag, Berlin, 1998, pp. 116-165.
10. M. R. JERRUM AND A. J. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
11. M. R. JERRUM AND A. J. SINCLAIR, Polynomial-time approximation algorithms for the Ising model, SIAM J. Comput., 22 (1993), pp. 1087-1116.
12. M. R. JERRUM AND A. J. SINCLAIR, The Markov chain Monte Carlo method: An approach to approximate counting and integration, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS Publishing, Boston, 1997, pp. 482-520.
13. M. R. JERRUM, L. G. VALIANT, AND V. V. VAZIRANI, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci., 43 (1986), pp. 169-188.
14. R. KANNAN, Markov chains and polynomial time algorithms, in Proceedings of the 35th IEEE Conference on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1994, pp. 656-671.
15. B. MORRIS, Random Walks in Convex Sets, Ph.D. thesis, University of California at Berkeley, Berkeley, CA, 2000.
16. B. MORRIS AND A. J. SINCLAIR, Random walks on truncated cubes and sampling 0-1 knapsack solutions, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 230-240.
17. L. SALOFF-COSTE, Lectures on finite Markov chains, in Lectures on Probability Theory and Statistics, Lecture Notes in Math. 1665, Springer-Verlag, Berlin, 1997, pp. 301-413.
18. A. J. SINCLAIR, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
19. A. J. SINCLAIR, Algorithms for Random Generation and Counting, Progr. Theoret. Comput. Sci., Birkhäuser Boston, Boston, MA, 1993.