YoVDO

Planar Site Percolation via Tree Embeddings

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Graph Theory Courses Probability Theory Courses Statistical Mechanics Courses Planar Graphs Courses Discrete Geometry Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a lecture on planar site percolation through tree embeddings presented by Zhongyang Li from the University of Connecticut at IPAM's Statistical Mechanics and Discrete Geometry Workshop. Delve into the proof of a conjecture by Benjamini and Schramm from 1996, demonstrating that for infinite, connected planar graphs with minimal vertex degree of at least 7, i.i.d. Bernoulli(p) site percolation almost surely results in infinitely many infinite 1-clusters within a specific probability interval. Discover the novel construction of embedded trees on such graphs, which forms the basis of the proof. Gain insights into the properties of site percolation on planar graphs and their implications for statistical mechanics and discrete geometry.

Syllabus

Zhongyang Li - Planar Site Percolation via Tree Embeddings - IPAM at UCLA


Taught by

Institute for Pure & Applied Mathematics (IPAM)

Related Courses

Statistical Mechanics: Algorithms and Computations
École normale supérieure via Coursera
Physics of Materials
Indian Institute of Technology Madras via Swayam
From Atoms to Materials: Predictive Theory and Simulations
Purdue University via edX
Statistical Mechanics
Indian Institute of Technology Madras via Swayam
Thermodynamics: Classical To Statistical
Indian Institute of Technology Guwahati via Swayam