University of Cambridge > Talks.cam > Combinatorics Seminar > Bootstrap Percolation in the Hypercube

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Bootstrap Percolation in the Hypercube

Download to your calendar using vCal

  • UserNatasha Morrison (Oxford)
  • ClockThursday 22 October 2015, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

The \emph{$r$-neighbour bootstrap process} on a graph $G$ starts with an initial set of ``infected’’ vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a vertex becomes infected, it remains infected forever). If every vertex of $G$ becomes infected during the process, then we say that the initial set \emph{percolates}.

In this talk I will discuss the proof of a conjecture of Balogh and Bollob\’{a}s: for fixed $r$ and $d\to\infty$, the minimum cardinality of a percolating set in the $d$-dimensional hypercube is $\frac{1+o(1)}{r}\binom{d}{r-1}$. One of the key ideas behind the proof exploits a connection between bootstrap percolation and weak saturation. This is joint work with Jonathan Noel.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

effrey Cheah Biomedical Centre (Main Lecture Theatre), University of Cambridge Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Hoyle Committee Room

Other talks

Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels Title to be confirmed Title to be confirmed Max Perutz Lecture - Title TBC Polar Oceans Seminar Talk Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity