The diameter of a random subgraph of the hypercube

DOI10.1002/rsa.20442zbMath1252.05201OpenAlexW2020012616MaRDI QIDQ3165461

Tomáš Kulich

Publication date: 26 October 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20442

zbMATH Keywords

hypercubediameterrandom graphmetric propertiesrandom cubical graph

Mathematics Subject Classification ID

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

Uses Software

• PVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-temperature Glauber dynamics on \({\mathbb{Z}^d}\)
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Distributed average consensus with least-mean-square deviation
• Matrix algorithms on a hypercube. I: Matrix multiplication
• Largest random component of a k-cube
• On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
• Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
• Majority Bootstrap Percolation on the Hypercube
• The Maturation of the Probabilistic Method
• The Evolution of Random Subgraphs of the Cube
• Radius and diameter of random subgraphs of the hypercube
• Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
• The two possible values of the chromatic number of a random graph
• Range of cube-indexed random walk

This page was built for publication: The diameter of a random subgraph of the hypercube