Critical random hypergraphs: The emergence of a giant set of identifiable vertices

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/009117904000000847 in the Annals of Probability (http://www.imstat.org/aop/) by the Ins

Scientific paper

10.1214/009117904000000847

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase transition takes various forms, depending on the values of the parameters controlling the different types of hyperedges. It may be continuous as in a random graph. (In fact, when there are no higher-order edges, it is exactly the emergence of the giant component.) In this case, there is a sequence of possible sizes of ``components'' (including but not restricted to N^{2/3}). Alternatively, the phase transition may be discontinuous. We are particularly interested in the nature of the discontinuous phase transition and are able to exhibit precise asymptotics. Our method extends a result of Aldous [Ann. Probab. 25 (1997) 812-854] on component sizes in a random graph.

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

Critical random hypergraphs: The emergence of a giant set of identifiable vertices 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 Critical random hypergraphs: The emergence of a giant set of identifiable vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical random hypergraphs: The emergence of a giant set of identifiable vertices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-84477

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