The diameter of a random subgraph of the hypercube
From MaRDI portal
Recommendations
Cites work
- Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
- Contamination and decontamination in majority-based systems
- Distributed average consensus with least-mean-square deviation
- Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
- scientific article; zbMATH DE number 4010568 (Why is no real title available?)
- scientific article; zbMATH DE number 4059455 (Why is no real title available?)
- Largest random component of a k-cube
- Majority Bootstrap Percolation on the Hypercube
- Matrix algorithms on a hypercube. I: Matrix multiplication
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- Radius and diameter of random subgraphs of the hypercube
- Random subgraphs of finite graphs. III: The phase transition for the n-cube
- Range of cube-indexed random walk
- The Evolution of Random Subgraphs of the Cube
- The Maturation of the Probabilistic Method
- The two possible values of the chromatic number of a random graph
- Zero-temperature Glauber dynamics on \({\mathbb{Z}^d}\)
Cited in
(5)
This page was built for publication: The diameter of a random subgraph of the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165461)
