Behrisch, Michael, Coja-Oghlan, Amin and Kang, Mihyun (2010) The order of the giant component of random hypergraphs. Random Structures and Algorithms, Vol.36 (No.2). pp. 149-184. doi:10.1002/rsa.20282 ISSN 1042-9832.

Text 20282_ftp.pdf - Published Version Embargoed item. Restricted access to Repository staff only Download (344Kb)

Request Changes to record.

Abstract

We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n,p) with edge probability p = c/, where c > (d - 1)-1 is a constant. The proof relies on a new, purely probabilistic approach.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Mathematics
Journal or Publication Title:	Random Structures and Algorithms
Publisher:	John Wiley & Sons, Inc.
ISSN:	1042-9832
Official Date:	March 2010
Dates:	Date Event March 2010 Published
Volume:	Vol.36
Number:	No.2
Page Range:	pp. 149-184
DOI:	10.1002/rsa.20282
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Date of first compliant deposit:	20 December 2015

Request changes or add full text files to a record

Repository staff actions (login required)

View Item