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

Percolation in High-Dimensional Product Graphs

Add to your list(s) Download to your calendar using vCal

  • UserJoshua Erde, Graz
  • ClockThursday 20 October 2022, 15:00-16:00
  • HouseLTC.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.