Connectivity threshold for random subgraphs of the Hamming graph (Q287817)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6583860
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity threshold for random subgraphs of the Hamming graph |
scientific article; zbMATH DE number 6583860 |
Statements
Connectivity threshold for random subgraphs of the Hamming graph (English)
0 references
23 May 2016
0 references
connectivity threshold
0 references
percolation
0 references
random graph
0 references
critical window
0 references
0.8297990560531616
0 references
0.8016773462295532
0 references
0.7801533341407776
0 references
0.7635762095451355
0 references
