Sciweavers

30 search results - page 1 / 6
» Random half-integral polytopes
Sort
View
MOC
1998
83views more  MOC 1998»
13 years 4 months ago
A sweep-plane algorithm for generating random tuples in simple polytopes
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
Josef Leydold, Wolfgang Hörmann
DCG
2007
94views more  DCG 2007»
13 years 4 months ago
Banach-Mazur Distances and Projections on Random Subgaussian Polytopes
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
Rafal Latala, Piotr Mankiewicz, Krzysztof Oleszkie...
DCG
2008
110views more  DCG 2008»
13 years 4 months ago
An Inscribing Model for Random Polytopes
For convex bodies K with C2 boundary in Rd, we explore random polytopes with vertices chosen along the boundary of K. In particular, we determine asymptotic properties of the volum...
Ross M. Richardson, Van H. Vu, Lei Wu
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 5 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
DCG
2006
110views more  DCG 2006»
13 years 4 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho