Connectivity threshold for random subgraphs of the Hamming graph (Q287817)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Connectivity threshold for random subgraphs of the Hamming graph
scientific article

    Statements

    Connectivity threshold for random subgraphs of the Hamming graph (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2016
    0 references
    connectivity threshold
    0 references
    percolation
    0 references
    random graph
    0 references
    critical window
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references