Critical random hypergraphs: The emergence of a giant set of identifiable vertices
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 para...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2005
|