Creation and Growth of Components in a Random Hypergraph Process

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

R\'{e}sum\'{e} \'{e}tendu

Scientific paper

Denote by an $\ell$-component a connected $b$-uniform hypergraph with $k$ edges and $k(b-1) - \ell$ vertices. We prove that the expected number of creations of $\ell$-component during a random hypergraph process tends to 1 as $\ell$ and $b$ tend to $\infty$ with the total number of vertices $n$ such that $\ell = o(\sqrt[3]{\frac{n}{b}})$. Under the same conditions, we also show that the expected number of vertices that ever belong to an $\ell$-component is approximately $12^{1/3} (b-1)^{1/3} \ell^{1/3} n^{2/3}$. As an immediate consequence, it follows that with high probability the largest $\ell$-component during the process is of size $O((b-1)^{1/3} \ell^{1/3} n^{2/3})$. Our results give insight about the size of giant components inside the phase transition of random hypergraphs.

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

Creation and Growth of Components in a Random Hypergraph Process 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 Creation and Growth of Components in a Random Hypergraph Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Creation and Growth of Components in a Random Hypergraph Process will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-168068

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