Exploring the sharp propagation connectivity threshold in hypergraphs

DOI10.1016/J.JMAA.2025.129509MaRDI QIDQ6983783zbMATH OpenFDO

Authors Guangyan Zhou, Bin Wang

Publication date 14 May 2025

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JMAA.2025.129509

zbMATH Keywords

hypergraphphase transitionpropagation connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65)

Cites work

• Component structure in the evolution of random hypergraphs
• Computational graph completion
• Connectivity of random hypergraphs with a given hyperedge size distribution
• Counting connected graphs and hypergraphs via the probabilistic method
• Counting connected graphs asymptotically
• Dominating sets in social network graphs
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Local limit theorems for the giant component of random hypergraphs
• On atom-bond connectivity index of graphs
• On the strength of connectedness of a random hypergraph
• Propagation connectivity of random hypergraphs
• Propagation Connectivity of Random Hypergraphs
• Random Graphs
• Random Graphs and Complex Networks
• Recurrence of distributional limits of finite planar graphs
• Rigorous results for random (2+p)-SAT
• Sharp thresholds of graph properties, and the k-sat problem
• Structure of large random hypergraphs
• The order of the giant component of random hypergraphs
• When does the giant component bring unsatisfiability?

This page was built for publication: Exploring the sharp propagation connectivity threshold in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983783)