Homological connectivity of random k-dimensional complexes

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages

Scientific paper

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with probability p. Let H_{k-1}(Y;R) denote the (k-1)-dimensional reduced homology group of Y with coefficients in a finite abelian group R. Let R and k \geq 1 be fixed. It is shown that p=(k \log n)/n is a sharp threshold for the vanishing of H_{k-1}(Y;R).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Homological connectivity of random k-dimensional complexes 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 Homological connectivity of random k-dimensional complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homological connectivity of random k-dimensional complexes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-532249

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.