IWOCA 2013: Combinatorial Algorithms pp 127-139 | Cite as
Phase Transition of Random Non-uniform Hypergraphs
Abstract
Non-uniform hypergraphs appear in several domains of computer science as in the satisfiability problems and in data analysis. We analyze their typical structure before and near the birth of the complex component, that is the first connected component with more than one cycle. The model of non-uniform hypergraph studied is a natural generalization of the multigraph process defined in the “giant paper” [1]. This paper follows the same general approach based on analytic combinatorics. We study the evolution of hypergraphs as their complexity, defined as the excess, increases. Although less natural than the number of edges, this parameter allows a precise description of the structure of hypergraphs. Finally, we compute some statistics of the hypergraphs with a given excess, including the expected number of edges.
Keywords
Hypergraph phase transition analytic combinatoricsPreview
Unable to display preview. Download preview PDF.
References
- 1.Janson, S., Knuth, D.E., Luczak, T., Pittel, B.: The birth of the giant component. Random Struct. Algorithms 4(3), 233–359 (1993)MathSciNetCrossRefMATHGoogle Scholar
- 2.Erdös, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17 (1960)MATHGoogle Scholar
- 3.Karoǹski, M., Łuczak, T.: The phase transition in a random hypergraph. Journal of Computational and Applied Mathematics 42(1), 125–135 (2002); Probabilistic Methods in Combinatorics and Combinatorial OptimizationGoogle Scholar
- 4.Ravelomanana, V.: Birth and growth of multicyclic components in random hypergraphs. Theor. Comput. Sci. 411(43), 3801–3813 (2010)MathSciNetCrossRefMATHGoogle Scholar
- 5.Schmidt-Pruzan, J., Shamir, E.: Component structure in the evolution of random hypergraphs. Combinatorica 5(1), 81–94 (1985)MathSciNetCrossRefMATHGoogle Scholar
- 6.Darling, R.W.R., Norris, J.R.: Structure of large random hypergraphs. Ann. Appl. Probab., 125–152 (2004)Google Scholar
- 7.Gessel, I.M., Kalikow, L.H.: Hypergraphs and a functional equation of Bouwkamp and de Bruijn. J. Comb. Theory, Ser. A 110(2), 275–289 (2005)MathSciNetCrossRefMATHGoogle Scholar
- 8.Wright, E.M.: The number of connected sparsely edged graphs. Journal of Graph Theory 1, 317–330 (1977)MathSciNetCrossRefMATHGoogle Scholar
- 9.Karoǹski, M., Łuczak, T.: The number of connected sparsely edged uniform hypergraphs. Discrete Mathematics 171(1-3), 153–167 (1997)MathSciNetCrossRefGoogle Scholar
- 10.Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press (2009)Google Scholar
- 11.Berge, C.: Graphs and Hypergraphs. Elsevier Science Ltd. (1985)Google Scholar
- 12.Bergeron, F., Labelle, G., Leroux, P.: Combinatorial Species and Tree-like Structures. Cambridge University Press (1997)Google Scholar
- 13.Oger, B.: Decorated hypertrees. CoRR abs/1209.0941 (2012)Google Scholar
- 14.Banderier, C., Flajolet, P., Schaeffer, G., Soria, M.: Random maps, coalescing saddles, singularity analysis, and airy phenomena. Random Struct. Algorithms 19(3-4), 194–246 (2001)MathSciNetCrossRefMATHGoogle Scholar
- 15.Flajolet, P., Knuth, D.E., Pittel, B.: The first cycles in an evolving graph. Discrete Mathematics 75(1-3), 167–215 (1989)MathSciNetCrossRefMATHGoogle Scholar
- 16.Wright, E.M.: The number of connected sparsely edged graphs III: Asymptotic results. Journal of Graph Theory 4(4), 393–407 (1980)MathSciNetCrossRefMATHGoogle Scholar
- 17.Flajolet, P., Salvy, B., Schaeffer, G.: Airy phenomena and analytic combinatorics of connected graphs. The Electronic Journal of Combinatorics 11, 34 (2004)MathSciNetGoogle Scholar
- 18.Bollobás, B., Janson, S., Riordan, O.: Sparse random graphs with clustering, cite arxiv:0807 (2008)Google Scholar