Connectivity threshold for random subgraphs of the Hamming graph

DOI10.1214/16-ECP4479zbMath1336.05074arXiv1504.05350MaRDI QIDQ287817

Lorenzo Federico, Tim Hulshof, Remco van der Hofstad

Publication date: 23 May 2016

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

Full work available at URL: https://arxiv.org/abs/1504.05350

zbMATH Keywords

percolationrandom graphconnectivity thresholdcritical window

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Connectivity (05C40)

Related Items (1)

Expansion of Percolation Critical Points for Hamming Graphs

This page was built for publication: Connectivity threshold for random subgraphs of the Hamming graph