The phase transition in a random hypergraph

DOI10.1016/S0377-0427(01)00464-2zbMath0995.05131MaRDI QIDQ1612300

Michał Karoński, Tomasz Łuczak

Publication date: 22 August 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

phase transitionrandom hypergraphlargest component

Mathematics Subject Classification ID

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

Related Items (28)

Evolution of high-order connected components in random hypergraphs ⋮ Birth and growth of multicyclic components in random hypergraphs ⋮ Phase transition in count approximation by count-min sketch with conservative updates ⋮ Limiting probabilities of first order properties of random sparse graphs and hypergraphs ⋮ What Are Higher-Order Networks? ⋮ Unnamed Item ⋮ Counting Connected Hypergraphs via the Probabilistic Method ⋮ Local Limit Theorems for the Giant Component of Random Hypergraphs ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Phase transition in the spanning-hyperforest model on complete hypergraphs ⋮ Cutoff for conjugacy-invariant random walks on the permutation group ⋮ Thresholds for extreme orientability ⋮ Pairs of SAT-assignments in random Boolean formulæ ⋮ Exploring hypergraphs with martingales ⋮ Counting connected graphs inside-out ⋮ Phase transition of random non-uniform hypergraphs ⋮ The order of the giant component of random hypergraphs ⋮ Largest Components in Random Hypergraphs ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ The SAT-UNSAT transition for random constraint satisfaction problems ⋮ When does the giant component bring unsatisfiability? ⋮ Loose cores and cycles in random hypergraphs ⋮ The Phase Transition in Multitype Binomial Random Graphs ⋮ Resolution complexity of random constraint satisfaction problems: Another half of the story ⋮ Model-based clustering for random hypergraphs ⋮ Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story ⋮ Local limit theorems via Landau-Kolmogorov inequalities ⋮ Asymptotic normality of the size of the giant component in a random hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Component structure in the evolution of random hypergraphs
• The number of connected sparsely edged uniform hypergraphs
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The birth of the giant component

This page was built for publication: The phase transition in a random hypergraph