What is the satisfiability threshold of random balanced Boolean expressions?. Issue 3 (18th December 2021)

• Record Type: Journal Article
• Authors: Lindenstrauss, Naomi; Talagrand, Michel
• Is Part Of: Random structures & algorithms. Volume 61:Issue 3(2022)
• Page Start: 599
• Page End: 615
• Publication Date: 2021-12-18
• Subjects: 68Q87 -- 94D10 -- 68R07 -- 60C05; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.21069
• Languages: English
• ISSNs: 1042-9832

Abstract

Abstract: We consider the model of random Boolean expressions based on balanced binary trees with 2 N $$ {2}^N $$ leaves, to which are randomly attributed one of k N $$ {k}_N $$ Boolean variables or their negations. We prove that if for every c > 0 $$ c>0 $$ it holds that k N exp ( − c N ) → 0 $$ {k}_N\exp \left(-c\sqrt{N}\right)\to 0 $$ then asymptotically with high probability the Boolean expression is either a tautology or an antitautology. Our methods are based on the study of a certain binary operation on the set of probability measures on { 0, 1 } I $$ {\left\{0, 1\right\}}^I $$ for a finite set I .