On 28th November OxTalks will move to the new Halo platform and will become 'Oxford Events' (full details are available on the Staff Gateway).
There will be an OxTalks freeze beginning on Friday 14th November. This means you will need to publish any of your known events to OxTalks by then as there will be no facility to publish or edit events in that fortnight. During the freeze, all events will be migrated to the new Oxford Events site. It will still be possible to view events on OxTalks during this time.
If you have any questions, please contact halo@digital.ox.ac.uk
We introduce a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. We start with a collection of logical statements and known implications, as represented by an oriented graph G on n vertices. Then we attempt to logically complete the knowledge by transitivity, however, a censor places restrictions, represented by open and closed directed edges. We show that if G is a connected graph of bounded degree, and all other edges are open independently with probability p, then the transition between sparse and full completion of open edges occurs at p_c = (log n)^{-1/2+o(1)}. Joint work with Janko Gravner.