Phase transition of random non-uniform hypergraphs

DOI10.1016/j.jda.2015.01.009zbMath1325.05122arXiv1304.5932OpenAlexW1986514804MaRDI QIDQ2018538

Elie de Panafieu

Publication date: 24 March 2015

Published in: Lecture Notes in Computer Science, Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5932

zbMATH Keywords

hypergraphphase transitionanalytic combinatorics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items

The birth of the strong components ⋮ Exact enumeration of satisfiable 2-SAT formulae ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Model-based clustering for random hypergraphs ⋮ An average study of hypergraphs and their minimal transversals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs and a functional equation of Bouwkamp and de Bruijn
• Birth and growth of multicyclic components in random hypergraphs
• Counting connected graphs asymptotically
• The first cycles in an evolving graph
• Finite size scaling for the core of large random hypergraphs
• Component structure in the evolution of random hypergraphs
• On convergence rates in the central limit theorems for combinatorial structures
• The number of connected sparsely edged uniform hypergraphs
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• Structure of large random hypergraphs
• Airy phenomena and analytic combinatorics of connected graphs
• Decorated hypertrees
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Sparse random graphs with clustering
• The number of connected sparsely edged graphs. III. Asymptotic results
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The number of connected sparsely edged graphs
• A critical point for random graphs with a given degree sequence
• The birth of the giant component