Inequalities for connectivity events in Bernoulli percolation

-
Nikita Gladkov, UCLA
Fine Hall 224

Events such as "two vertices are connected by an open path" naturally emerge in Bernoulli percolation. In this talk, we will examine the dependencies between these events for various vertex pairs and derive key FKG-type inequalities governing their probabilities.