Exploration in Bernoulli percolation (Nikita Gladkov, UNIGE)

29.09.2025 16:15 – 18:00

Abstract:
Consider Bernoulli percolation on a graph, where edges are kept open independently with some probability. By revealing edges one at a time, one can analyze the structure of connected clusters and establish correlation inequalities for connectivity events. I will present several of these inequalities and outline the exploration-based arguments behind them.

Lieu

Bâtiment: Conseil Général 7-9

Room 1-15, Séminaire Math Physics

entrée libre