Climbing up a random subgraph of the hypercube

DOI10.1214/24-ecp639MaRDI QIDQ6654865

Sahar Diskin, Michael Anastos, Michael Krivelevich, Dor Elboim

Publication date: 20 December 2024

Published in: Electronic Communications in Probability (Search for Journal in Brave)

zbMATH Keywords

hypercubephase transitionbond percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Detecting tampering in a random hypercube
• Largest random component of a k-cube
• Evolution of the \(n\)-cube
• Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
• Complete matchings in random subgraphs of the cube
• The Evolution of the Cube
• The Evolution of Random Subgraphs of the Cube
• Probability

This page was built for publication: Climbing up a random subgraph of the hypercube