Abstract
Noise sensitivity of functions on the leaves of a binary tree is studied, and a hypercontractive inequality is obtained. We deduce that the spider walk is not noise stable.
Original language | English |
---|---|
Pages (from-to) | 39-49 |
Number of pages | 11 |
Journal | Electronic Communications in Probability |
Volume | 4 |
DOIs | |
State | Published - 1 Jan 1999 |