Nikita Gladkov (UCLA): Inequalities in Graph Percolation

Március 27-én 14.00-től a Rényi Intézet Nagytermében Nikita Gladkov (UCLA) tart előadást.

Title:
Inequalities in Graph Percolation

Abstract:
Percolation on a graph is a random process that divides the edges into two groups: open and closed. Events such as "vertices v and w are connected via a path of open edges" occur within this process. We investigate the dependencies between these events and inequalities concerning their probabilities.