2018
Oct
29

# Combinatorics: Noam Lifshitz, BIU, "Sharp thresholds for sparse functions with applications to extremal combinatorics."

11:00am to 1:00pm

## Location:

Rothberg CS blgd, room B500, Safra campus, Givat, Ram

Speaker: Noam Lifshitz, BIU

Title: Sharp thresholds for sparse functions with applications to extremal combinatorics.

Abstract:

The sharp threshold phenomenon is a central topic of research in the analysis of Boolean functions. Here, one aims to give sufficient conditions for a monotone Boolean function $f$ to satisfy $\mu_{p}(f)=o(\mu_{q}(f))$, where $q = p + o(p)$, and $\mu_{p}(f)$ is the probability that $f=1$ on an input with independent coordinates, each taking the value $1$ with probability $p$.

Title: Sharp thresholds for sparse functions with applications to extremal combinatorics.

Abstract:

The sharp threshold phenomenon is a central topic of research in the analysis of Boolean functions. Here, one aims to give sufficient conditions for a monotone Boolean function $f$ to satisfy $\mu_{p}(f)=o(\mu_{q}(f))$, where $q = p + o(p)$, and $\mu_{p}(f)$ is the probability that $f=1$ on an input with independent coordinates, each taking the value $1$ with probability $p$.