# CRITICAL PERCOLATION ON THE HAMMING GRAPH

When: | 2nd of October 2017 tot 1st of October 2017 |

Starttime | 16:00 |

On Monday (02/10/2017), we have another interesting talk in our Probability and Statistics seminar series at TU Delft.
When: Monday October 2nd, 16:00
Percolation on fInite graphs is known to exhibit a phase transition similar to the Erdos-Renyi Random Graph in presence of sufficiently weak geometry. We focus on the Hamming graph $H(d,n)$ (the cartesian product of d complete graphs on $n$ vertices each) when $d$ is fixed and $n o infty$. We identify the critical point $p^{(d)}_c$ at which such phase transition happens and we analyse the structure of the largest connected components at criticality. We prove that the scaling limit of component sizes is identical to the one for critical Erdos-Renyi components, while the number of surplus edges is much higher. These results are obtained coupling percolation to the trace of branching random walks on the Hamming graph.
More details on the seminar's website: |