University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Towards a 1-dependent version of the Harris--Kesten theorem

## Towards a 1-dependent version of the Harris--Kesten theoremAdd to your list(s) Download to your calendar using vCal - Victor Falgas Ravry, Umea
- Thursday 27 January 2022, 13:00-14:00
- Attention: unusual time, zoom link: https://bham-ac-uk.zoom.us/j/87124623071.
If you have a question about this talk, please contact Johannes Carmesin. Consider a random subgraph of the square integer lattice Z2 obtained by including each edge independently at random with probability p, and leaving it out otherwise. The Harris—Kesten theorem states that if p is at most 1/2, then almost surely all connected components in this random subgraph are finite, while if p>1/2 then almost surely there exists a unique infinite connected component. But now what if we introduced some local dependencies between the edges? More precisely, suppose each edge still has a probability p of being included in our random subgraph, but its state (present/absent) may depend on the states of edges it shares a vertex with. To what extent can we exploit such local dependencies to delay the appearance of an infinite component? In this talk I will discuss this question, which first arose in work of Balister, Bollobás and Walters in 2005, and discuss some recent progress on it made in joint work with Nicholas Day, Robert Hancock and Vincent Pfenninger. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:- Attention: unusual time, zoom link: https://bham-ac-uk.zoom.us/j/87124623071
- Combinatorics and Probability Seminar
- School of Mathematics Events
Note that ex-directory lists are not shown. |
## Other listsSoCS PhD Research Training Sessions Theoretical Physics Journal Club and Group Meeting Centre for Computational Biology Seminar Series## Other talksTBA GRB 211211A and the Emerging Diversity of Merger-driven Gamma-ray Bursts Precise asteroseismic ages from young pulsating stars A novel ringdown amplitude-phase consistency test A compositional theory of digital circuits: Part II FnS: Time-complexity analysis of co-evolutionary algorithms as an adversarial optimisation approach |