Around two theorems and a lemma by Lucio Russo

DOI10.2140/memocs.2018.6.69zbMath1390.60343OpenAlexW2806138272WikidataQ124813223 ScholiaQ124813223MaRDI QIDQ1648777

Gil Kalai, Itai Benjamini

Publication date: 27 June 2018

Published in: Mathematics and Mechanics of Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/memocs.2018.6.69

zbMATH Keywords

percolationdiscrete isoperimetryconformal uniformizationRusso-Seymour-Welsh theoremRusso's 0-1 lawRusso's lemma

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Compact Riemann surfaces and uniformization (30F10) Percolation (82B43)

Cites Work

• Unnamed Item
• Crossing probabilities for Voronoi percolation
• A structure theorem for Boolean functions with small total influences
• The critical probability of bond percolation on the square lattice equals 1/2
• Boolean functions with low average sensitivity depend on few coordinates
• On Russo's approximate zero-one law
• Influences of variables and threshold intervals under group symmetries
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• The influence of variables in product spaces
• Random walks and harmonic functions on infinite planar graphs using square tilings
• Critical percolation in the plane: conformal invariance, Cardy's formula, scaling limits
• Are many small sets explicitly small?
• Almost Isoperimetric Subsets of the Discrete Cube
• Thresholds and Expectation Thresholds
• An approximate zero-one law
• A note on percolation
• Percolation Probabilities on the Square Lattice
• Sharp thresholds of graph properties, and the $k$-sat problem
• Every monotone graph property has a sharp threshold
• Analysis of Boolean Functions
• Noise Sensitivity of Boolean Functions and Percolation

This page was built for publication: Around two theorems and a lemma by Lucio Russo