• search hit 63 of 1114
Back to Result List

The order of the giant component of random hypergraphs

Please always quote using this URN:urn:nbn:de:0296-matheon-3705
  • We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph. The proof relies on a new, purely probabilistic approach, and is based on Stein’s method as well as exposing the edges of H_d(n, p) in several rounds.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Michael Behrisch, Amin Coja-Oghlan, Mihuyn Kang
URN:urn:nbn:de:0296-matheon-3705
Referee:Hans Jürgen Prömel
Document Type:Preprint, Research Center Matheon
Language:English
Date of first Publication:2007/07/01
Release Date:2007/05/01
Tag:
Institute:Humboldt-Universität zu Berlin
Preprint Number:366
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.