Threshold phenomena for random discrete structures

TL;DR

This paper provides an accessible overview of threshold phenomena in Erdős-Rényi random graphs and introduces the Kahn-Kalai Conjecture with intuitive examples for a general audience.

Contribution

It offers a gentle, expository introduction to complex concepts in random graph theory and the Kahn-Kalai Conjecture, making them accessible to newcomers.

Findings

Explains threshold phenomena in Erdős-Rényi graphs

Introduces the Kahn-Kalai Conjecture with examples

Targets a general audience for better understanding

Abstract

In this expository article, we give a gentle introduction to the Erd\H{o}s-R\'enyi random graphs and threshold phenomena that they exhibit. We also mildly introduce the Kahn-Kalai Conjecture with several intuitive examples, mainly targeting the general audience.