2017
Mar
02

# Basic Notions: Ori Gurel Gurevich (HUJI) - On Smirnov's proof of conformal invariance of critical percolation

4:00pm to 5:00pm

## Location:

Manchester Building, Lecture Hall 2

Abstract:

Let G be an infinite connected graph. For each vertex of G we decide

randomly and independently: with probability p we paint it blue and

with probability 1-p we paint it yellow. Now, consider the subgraph of

blue vertices: does it contain an infinite connected component?

There is a critical probability p_c(G), such that if p>p_c then almost

surely there is a blue infinite connected component and if p

We will focus on planar graphs, specifically on the triangular

Let G be an infinite connected graph. For each vertex of G we decide

randomly and independently: with probability p we paint it blue and

with probability 1-p we paint it yellow. Now, consider the subgraph of

blue vertices: does it contain an infinite connected component?

There is a critical probability p_c(G), such that if p>p_c then almost

surely there is a blue infinite connected component and if p

__p_c or p<p_c.__We will focus on planar graphs, specifically on the triangular