Phase transition of random non-uniform hypergraphs

Banderier, 2001, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Random Struct. Algorithms, 19, 194, 10.1002/rsa.10021 Bender, 1990, The asymptotic number of labeled connected graphs with a given number of vertices and edges, Random Struct. Algorithms, 1, 129, 10.1002/rsa.3240010202 Berge, 1985 Bergeron, 1997 Bollobás, 2011, Sparse random graphs with clustering, Random Struct. Algorithms, 38, 269, 10.1002/rsa.20322 Cooper, 2004, The cores of random hypergraphs with a given degree sequence, Random Struct. Algorithms, 25, 353, 10.1002/rsa.20040 Darling, 2004, Structure of large random hypergraphs, Ann. Appl. Probab., 23, 125 Dembo, 2008, Finite size scaling for the core of large random hypergraphs, Ann. Appl. Probab., 18, 1993, 10.1214/07-AAP514 Erdős, 1960, On the Evolution of Random Graphs, vol. 5, 17 Flajolet, 2009 Flajolet, 1989, The first cycles in an evolving graph, Discrete Math., 75, 167, 10.1016/0012-365X(89)90087-3 Flajolet, 2004, Airy phenomena and analytic combinatorics of connected graphs, Electron. J. Comb., 11 Gessel, 2005, Hypergraphs and a functional equation of Bouwkamp and de Bruijn, J. Comb. Theory, Ser. A, 110, 275, 10.1016/j.jcta.2004.11.002 Ghoshal, 2009, Random hypergraphs and their applications, Phys. Rev. E, 79, 066118, 10.1103/PhysRevE.79.066118 Hwang, 1998, On convergence rates in the central limit theorems for combinatorial structures, Eur. J. Comb., 19, 329, 10.1006/eujc.1997.0179 Janson, 1993, The birth of the giant component, Random Struct. Algorithms, 4, 233, 10.1002/rsa.3240040303 Karoǹski, 1997, The number of connected sparsely edged uniform hypergraphs, Discrete Math., 171, 153, 10.1016/S0012-365X(96)00076-3 Karoǹski, 2002, The phase transition in a random hypergraph, J. Comput. Appl. Math., 142, 125, 10.1016/S0377-0427(01)00464-2 Molloy, 1995, A critical point for random graphs with a given degree sequence, Random Struct. Algorithms, 6, 161, 10.1002/rsa.3240060204 Newman, 2001, Random graphs with arbitrary degree distributions and their applications, Phys. Rev. E, 64, 026118, 10.1103/PhysRevE.64.026118 Oger, 2013, Decorated hypertrees, J. Comb. Theory, Ser. A, 120, 1871, 10.1016/j.jcta.2013.07.006 Pittel, 2005, Counting connected graphs inside-out, J. Comb. Theory, Ser. B, 93, 127, 10.1016/j.jctb.2004.09.005 Ravelomanana, 2010, Birth and growth of multicyclic components in random hypergraphs, Theor. Comput. Sci., 411, 3801, 10.1016/j.tcs.2010.05.042 Schmidt-Pruzan, 1985, Component structure in the evolution of random hypergraphs, Combinatorica, 5, 81, 10.1007/BF02579445 van der Hofstad, 2006, Counting connected graphs asymptotically, Eur. J. Comb., 26, 1294, 10.1016/j.ejc.2006.05.006 Wright, 1977, The number of connected sparsely edged graphs, J. Graph Theory, 1, 317, 10.1002/jgt.3190010407 Wright, 1980, The number of connected sparsely edged graphs III: asymptotic results, J. Graph Theory, 4, 393, 10.1002/jgt.3190040409