Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-vvkck Total loading time: 0 Render date: 2024-04-28T12:58:30.282Z Has data issue: false hasContentIssue false

Preface

Published online by Cambridge University Press:  18 December 2014

Christophe Garban
Affiliation:
Université Lyon I
Jeffrey E. Steif
Affiliation:
Chalmers University of Technology, Gothenberg
Get access

Summary

The purpose of this book is to present a self-contained theory of Boolean functions through the prism of statistical physics. The material presented here was initially designed as a set of lecture notes for the 2010 Clay summer school, and we decided to maintain the informal style which, we hope, will make this book more reader friendly.

Before going into Chapter 1, where precise definitions and statements are given, we wish to describe in an informal manner what this book is about. Our main companion through the whole book will be what one calls a Boolean function. This is simply a function of the following type:

f: {0, 1}n → {0, 1}.

Traditionally, the study of Boolean functions arises more naturally in theoretical computer science and combinatorics. In fact, over the last 20 years, mainly thanks to the computer science community, a very rich structure has emerged concerning the properties of Boolean functions. The first part of this book (Chapters 1 to 5) is devoted to a description of some of the main achievements in this field. For example, a crucial result that has inspired much of the work presented here is the so-called KKL theorem (for Kahn–Kalai–Linial, 1989), which in essence says that any “reasonable” Boolean function has at least one variable that has a large influence on the outcome (namely at least Ω(logn/n)). See Theorem 1.14.

The second part of this book is devoted to the powerful use of Boolean functions in the context of statistical physics and in particular in percolation theory. It was recognized long ago that some of the striking properties that hold in great generality for Boolean functions have deep implications in statistical physics. For example, a version of the KKL theorem enables one to recover in an elegant manner the celebrated theorem of Kesten from 1980 that states that the critical point for percolation on ℤ2, pc(ℤ2), is 1/2.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Preface
  • Christophe Garban, Université Lyon I, Jeffrey E. Steif, Chalmers University of Technology, Gothenberg
  • Book: Noise Sensitivity of Boolean Functions and Percolation
  • Online publication: 18 December 2014
  • Chapter DOI: https://doi.org/10.1017/CBO9781139924160.001
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Preface
  • Christophe Garban, Université Lyon I, Jeffrey E. Steif, Chalmers University of Technology, Gothenberg
  • Book: Noise Sensitivity of Boolean Functions and Percolation
  • Online publication: 18 December 2014
  • Chapter DOI: https://doi.org/10.1017/CBO9781139924160.001
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Preface
  • Christophe Garban, Université Lyon I, Jeffrey E. Steif, Chalmers University of Technology, Gothenberg
  • Book: Noise Sensitivity of Boolean Functions and Percolation
  • Online publication: 18 December 2014
  • Chapter DOI: https://doi.org/10.1017/CBO9781139924160.001
Available formats
×