University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Percolation in High-Dimensional Product Graphs

## Percolation in High-Dimensional Product GraphsAdd to your list(s) Download to your calendar using vCal - Joshua Erde, Graz
- Thursday 20 October 2022, 15:00-16:00
- LTC.
If you have a question about this talk, please contact Johannes Carmesin. A classic result of Erdős and Rényi describes the phase transition that the component structure of the binomial random graph G(n,p) undergoes when p is around 1/n. Below this point, the graph typically contains only small components, of logarithmic order, whereas above this point many of these component coalesce to a unique `giant’ component of linear order, and all other components are of logarithmic order. It has been observed that quantitatively similar phase transitions occur in many other percolation models, and, in particular, work of Ajtai, Komlós and Szemerédi and of Bollobás, Kohayakawa and Łuczak shows that such a phenomena occurs in the percolated hypercube. We consider this phase transition in percolation on graphs arising from the cartesian product of many graphs and show that, under some mild conditions on the factor graphs, this phenomena is universal. Joint with Sahar Diskin, Mihyun Kang and Michael Krivelevich This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsComputer Science Departmental Series Analysis seminar Analysis Seminar## Other talksStructured Decompositions: recursive data and recursive algorithms Tight Lower Bounds for Parameterized Algorithms under ETH (Special colloquium): Quantum enhanced superresolution confocal microscopy TBA View fusion vis-à-vis a Bayesian interpretation of Black-Litterman for portfolio allocation Hidden Markov Model in Multiple Testing on Dependent Data |