Local limit theorems for the giant component of random hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 341-352

  Behrisch, Michael ^a   Coja Oghlan, Amin ^b   Kang, Mihyun ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; NUMBER THEORY; RANDOM VARIABLES;

ENUMERATIVE COMBINATORICS; HYPERGRAPHS; JOINT DISTRIBUTION;

GRAPH THEORY;

EID: 38049059404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_25     Document Type: Conference Paper

References (27)

1. Andriamampianina, T., Ravelomanana, V.: Enumeration of connected uniform hypergraphs. In: Proceedings of FPSAC (2005)
2. Barraez, D., Boucheron, S., Fernandez de la Vega, W.: On the fluctuations of the giant component. Combinatorics, Probability and Computing 9, 287-304 (2000)
3. Barbour, A.D., Karonski, M., Rucinski, A.: A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Theory Ser. B 47, 125-145 (1989)
4. Behrisch, M., Coja-Oghlan, A., Kang, M.: The order of the giant component of random hypergraphs (preprint, 2007), available at http://arxiv.org/abs/0706. 0496
5. Behrisch, M., Coja-Oghlan, A., Kang, M.: Local limit theorems and the number of connected hypergraphs (preprint, 2007), available at http ://arxiv.org/abs/0706.0497
6. Bender, E.A., Canfield, E.R., McKay, B.D.: The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures and Algorithms 1, 127-169 (1990)
7. Bender, E.A., Canfield, E.R., McKay, B.D.: Asymptotic properties of labeled connected graphs. Random Structures and Algorithms 3, 183-202 (1992)
8. Bollobás, B.: Random graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
9. Coja-Oghlan, A., Moore, C., Sanwalani, V.: Counting connected graphs and hypergraphs via the probabilistic method. In: Random Structures and Algorithms (to appear)
10. Coppersmith, D., Gamarnik, D., Hajiaghayi, M., Sorkin, G.B.: Random MAX SAT, random MAX CUT, and their phase transitions. Random Structures and Algorithms 24, 502-545 (2004)
11. Erdos, P., Rényi, A.: On random graphs I. Publicationes Mathematicae Debrecen 5, 290-297 (1959)
12. Erdos, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17-61 (1960)
13. van der Hofstad, R., Spencer, J.: Counting connected graphs asymptotically. European Journal on Combinatorics 27, 1294-1320 (2006)
14. Janson, S.: The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Structures and Algorithms 7, 337-355 (1995)
15. Janson, S., Luczak, T., Ruciński, A.: Random Graphs. Wiley, Chichester (2000)
16. Karoński, M., Luczak, T.: The number of connected sparsely edged uniform hypergraphs. Discrete Math. 171, 153-168 (1997)
17. Karoński, M., Luczak, T.: The phase transition in a random hypergraph. J. Comput. Appl. Math. 142, 125-135 (2002)
18. Luczak, T.: On the number of sparse connected graphs. Random Structures and Algorithms 1, 171-173 (1990)
19. Luczak, M., Luczak, T.: The phase transition in the cluster-scaled model of a random graph. Random Structures and Algorithms 28, 215-246 (2006)
20. O'Connell, N.: Some large deviation results for sparse random graphs. Prob. Th. Relat. Fields 110, 277-285 (1998)
21. Pittel, B.: On tree census and the giant component in sparse random graphs. Random Structures and Algorithms 1, 311-342 (1990)
22. Pittel, B., Wormald, N.C.: Asymptotic enumeration of sparse graphs with a minimum degree constraint. J. Combinatorial Theory, Series A 101, 249-263 (2003)
23. Pittel, B., Wormald, N.C.: Counting connected graphs inside out. J. Combin. Theory, Series B 93, 127-172 (2005)
24. Ravelomanana, V., Rijamamy, A.L.: Creation and growth of components in a random hypergraph process. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 350-359. Springer, Heidelberg (2006)
25. Schmidt-Pruzan, J., Shamir, E.: Component structure in the evolution of random hypergraphs. Combinatorica 5, 81-94 (1985)
26. Stein, C.: A bound for the error in the normal approximation to the distribution of a sum of dependent variables. In: Proc. 6th Berkeley Symposium on Mathematical Statistics and Probability, pp. 583-602 (1970)
27. m(t). Theory Prob. Appl. 15, 55-67 (1970)