The Order of the Giant Component of Random Hypergraphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

28 pages, 1 figure

Scientific paper

We establish central and local limit theorems for the number of vertices in
the largest component of a random $d$-uniform hypergraph $\hnp$ with edge
probability $p=c/\binnd$, where $(d-1)^{-1}+\epsa new, purely probabilistic approach, and is based on Stein's method as well as
exposing the edges of $H_d(n,p)$ in several rounds.

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

The Order of the Giant Component of Random Hypergraphs 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 The Order of the Giant Component of Random Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Order of the Giant Component of Random Hypergraphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-726931

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