Random walks in convex sets

Similar Works

Action	Title	Year	Authors
+	Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions	2004	Ben Morris Alistair Sinclair
+	Random walks on truncated cubes and sampling 0-1 knapsack solutions	2003	Ben Morris Alistair Sinclair
+	Improved Bounds for Sampling Contingency Tables	1999	Ben Morris
+	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows	2006	Mary Cryan Martin Dyer Leslie Ann Goldberg Mark Jerrum Russell Martin
+ PDF Chat	Estimating the probability that a given vector is in the convex hull of a random sample	2023	Satoshi Hayakawa Terry Lyons Harald Oberhauser
+ PDF Chat	Approximately Counting Knapsack Solutions in Subquadratic Time	2024	Weiming Feng Ce Jin
+ PDF Chat	Independence Models for Integer Points of Polytopes.	2011	Austin Shapiro
+	Revisiting Random Points: Combinatorial Complexity and Algorithms	2022	Sariel Har-Peled Elfarouk Harb
+	Sampling from convex sets with a cold start using multiscale decompositions	2022	Hariharan Narayanan Amit Rajaraman Piyush Srivastava
+	Random hyperplane search trees in high dimensions	2015	Luc Devroye James King
+	Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows	2003	Mary Cryan Martin Dyer Leslie Ann Goldberg Mark Jerrum Russell Martin
+	Sampling contingency tables	1997	Martin Dyer Ravi Kannan John Mount
+	Bounds on the number of integer points in a polytope via concentration estimates	2010	Austin Shapiro
+	Bounds on the number of integer points in a polytope via concentration estimates	2010	Austin Shapiro
+	Hit-and-Run is Fast and Fun 1	2003	Santosh Vempala
+	Improved bounds for sampling contingency tables	2002	Ben Morris
+	Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles	2009	Stephen Baumert Archis Ghate Seksan Kiatsupaibul Yanfang Shen Robert L. Smith Zelda B. Zabinsky
+	Random walks on polytopes and an affine interior point method for linear programming	2009	Ravi Kannan Hariharan Narayanan
+	Random hyperplane search trees in high dimensions	2011	Luc Devroye James King
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2003	Mary Cryan Martin Dyer

Works That Cite This (8)

Action	Title	Year	Authors
+	Analysis of convergence rates of some Gibbs samplers on continuous state spaces	2013	Aaron Smith
+	Random walks on the vertices of transportation polytopes with constant number of sources	2003	Mary Cryan Martin Dyer Haiko Müller Leen Stougie
+	Random walks on truncated cubes and sampling 0-1 knapsack solutions	2003	Ben Morris Alistair Sinclair
+	Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows	2003	Mary Cryan Martin Dyer Leslie Ann Goldberg Mark Jerrum Russell Martin
+	Approximate counting by dynamic programming	2003	Martin Dyer
+	None	2008	Mary Cryan Martin Dyer Haiko Müller Leen Stougie
+	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows	2006	Mary Cryan Martin Dyer Leslie Ann Goldberg Mark Jerrum Russell Martin
+	Analysis of Convergence Rates of Some Gibbs Samplers on Continuous State Spaces	2011	Aaron Smith

Works Cited by This (0)

Action	Title	Year	Authors