| | |
| | |
Stat |
Members: 3645 Articles: 2'504'928 Articles rated: 2609
26 April 2024 |
|
| | | |
|
Article overview
| |
|
Critical random hypergraphs: The emergence of a giant set of identifiable vertices | Christina Goldschmidt
; | Date: |
16 Dec 2003 | Journal: | Annals of Probability 2005, Vol. 33, No. 4, 1573-1600 DOI: 10.1214/009117904000000847 | Subject: | Probability; Combinatorics MSC-class: 60C05 (Primary) 05C65, 05C80, 60F17. (Secondary) | math.PR math.CO | 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.) 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. | Source: | arXiv, math.PR/0401208 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |