Journal article
Critical random hypergraphs: The emergence of a giant set of identifiable vertices
- Abstract:
-
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.)...
Expand abstract
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Journal:
- ANNALS OF PROBABILITY
- Volume:
- 33
- Issue:
- 4
- Pages:
- 1573-1600
- Publication date:
- 2005-07-01
- DOI:
- ISSN:
-
0091-1798
- Source identifiers:
-
172771
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
pubs:172771
- UUID:
-
uuid:b321c56e-4eca-412e-b9f1-d4afb4f6f6ca
- Local pid:
- pubs:172771
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2005
If you are the owner of this record, you can report an update to it here: Report update to this record