Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-hgkh8 Total loading time: 0 Render date: 2024-03-27T10:24:24.301Z Has data issue: false hasContentIssue false

13 - Further directions and open problems

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

We end this book with a concise list of open questions which are grouped by theme.

Randomized algorithms

13.1.1 Best randomized algorithm for Iterated Majority

It may look surprising (owing to the simple iterative structure of the Iterated Majority function introduced in Example 1.5), but the following problem is to our knowledge not settled.

Open Problem 13.1Find the randomized algorithm with smallest possible revealment for the Iterated Majority function fk on n = 3k bits. Even the order of magnitude of the decay to 0 (i.e., the exponent) is not known although there are some known bounds.

13.1.2 Best randomized algorithms for critical percolation

Open Problem 13.2

(a) Find algorithms for crossing events in percolation on the triangular lattice that examine on average at most n7/4−∈ sites for some ∈>0.

(b) Show that any algorithm examines on average at least n6/4+∈ sites for some ∈ > 0. (This would strengthen the lower bound obtained in Section 8.4 in Chapter 8).

13.1.3 Randomized algorithm and spectrum One way to obtain better bounds on the noise sensitivity of a Boolean function through the randomized algorithm approach (e.g., the percolation crossing events fn) is to find the algorithms with the smallest possible revealments. Another possible direction is to address the following problem.

Open Problem 13.3Prove a sharper version of Theorem 8.2 from (SS10).

13.1.4 Randomized algorithms and pivotal points

In (PSSW07), the authors introduce a seemingly very efficient randomized algorithm: one starts at some random initial site (using a well-chosen initial distribution) and then at each step, one picks the site that has the largest probability to be pivotal conditioned on what has been revealed so far. See (PSSW07). Their numerical simulations suggest that this randomized algorithm is more efficient than the one we used in Chapter 8 using an interface. Yet, nothing is rigorously known.

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.

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.

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.

Available formats
×