Short Talk: Nikita Gladkov

Consider two configurations, C_1 and C_2, in Bernoulli bond percolation on a general graph G. Take the set S of edges where one endpoint belongs to the cluster of a given vertex “a” in C_1. Now, construct a new configuration that matches C_1 on S and C_2 outside of S; this configuration will retain the same Bernoulli distribution. We identify a broader class of sets S with this property and leverage them to derive new bounds on the three-point function.