On the graph-density of random 0/1-polytopes

Details On the graph-density of random 0/1-polytopes On the graph-density of random 0/1-polytopes

2003-06-17

arxiv.org/abs/math/0306246v1

Mathematics

Combinatorics

11 pages, to appear in: Proceedings of RANDOM03 (Princeton Univ., Aug 24 - Aug 26, 2003)

Scientific paper

Let X_{d,n} be an n-element subset of {0,1}^d chosen uniformly at random, and denote by P_{d,n} := conv X_{d,n} its convex hull. Let D_{d,n} be the density of the graph of P_{d,n} (i.e., the number of one-dimensional faces of P_{d,n} divided by n(n-1)/2). Our main result is that, for any function n(d), the expected value of D_{d,n(d)} converges (with d tending to infinity) to one if, for some arbitrary e > 0, n(d) <= (\sqrt{2}-e)^d holds for all large d, while it converges to zero if n(d) >= (\sqrt{2}+e)^d holds for all large d.

Affiliated with

Also associated with

No associations

Rating

On the graph-density of random 0/1-polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the graph-density of random 0/1-polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the graph-density of random 0/1-polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-265472