Phase Transitions – like death and taxes? Why we should care; what to do about it. Scott Kirkpatrick, Hebrew University, Jerusalem With thanks to: Uri.

Slides:



Advertisements
Similar presentations
How to Solve Longstanding Open Problems In Quantum Computing Using Only Fourier Analysis Scott Aaronson (MIT) For those who hate quantum: The open problems.
Advertisements

Bayesian Belief Propagation
Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many pairwise comparisons do I need to do to check if a sequence.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
10/7/2014 Constrainedness of Search Toby Walsh NICTA and UNSW
Sep 15, 2014 Lirong Xia Computational social choice The easy-to-compute axiom.
Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space Chris Beck Princeton University Joint work with Paul Beame & Russell.
DIFFERENTIATION & INTEGRATION CHAPTER 4.  Differentiation is the process of finding the derivative of a function.  Derivative of INTRODUCTION TO DIFFERENTIATION.
All about noisy time series analysis in which features exist and long term behavior is present; finite boundary conditions are always an issue.
From the scale-free Web to Avogadro-scale Engineering Complexity Science Symposium, London, March 2004 Scott Kirkpatrick, Hebrew University, Jerusalem.
Message-Passing and Sudoku Scott Kirkpatrick, HUJI Danny Bickson, HUJI TAU, June 18, 2006.
Optimization in mean field random models Johan Wästlund Linköping University Sweden.
EXAMPLE 3 Prove the Alternate Interior Angles Theorem
Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
Survey Propagation Algorithm
CS774. Markov Random Field : Theory and Application Lecture 04 Kyomin Jung KAIST Sep
Phase Transitions of PP-Complete Satisfiability Problems D. Bailey, V. Dalmau, Ph.G. Kolaitis Computer Science Department UC Santa Cruz.
Wireless Distributed Sensor Tracking: Computation and Communication Bart Selman, Carla Gomes, Scott Kirkpatrick, Ramon Bejar, Bhaskar Krishnamachari, Johannes.
Semidefinite Programming
08/1 Foundations of AI 8. Satisfiability and Model Construction Davis-Putnam, Phase Transitions, GSAT Wolfram Burgard and Bernhard Nebel.
In Search of a Phase Transition in the AC-Matching Problem Phokion G. Kolaitis Thomas Raffill Computer Science Department UC Santa Cruz.
The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.
Hunting for Sharp Thresholds Ehud Friedgut Hebrew University.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
Properties of Logarithms
1 Slides by Asaf Shapira & Michael Lewin & Boaz Klartag & Oded Schwartz. Adapted from things beyond us.
1 Paul Beame University of Washington Phase Transitions in Proof Complexity and Satisfiability Search Dimitris Achlioptas Michael Molloy Microsoft Research.
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 2 Ryan Kinworthy CSCE Advanced Constraint Processing.
Comparing Beliefs, Surveys, and Random Walks for 3-SAT Scott Kirkpatrick, Hebrew University Joint work with Erik Aurell and Uri Gordon (see cond-mat/
1 Message Passing and Local Heuristics as Decimation Strategies for Satisfiability Lukas Kroc, Ashish Sabharwal, Bart Selman (presented by Sebastian Brand)
Introduction Think about all the angles formed by parallel lines intersected by a transversal. What are the relationships among those angles? In this lesson,
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
1 Growth of Functions CS 202 Epp, section ??? Aaron Bloomfield.
Logarithmic and Exponential Equations
5.1 – Exponential Functions. Exponential Function = a type of function in which a constant is raised to a variable power Many real-life applications using.
Summary: Isolated Systems, Temperature, Free Energy Zhiyan Wei ES 241: Advanced Elasticity 5/20/2009.
Proving Non-Reconstruction on Trees by an Iterative Algorithm Elitza Maneva University of Barcelona joint work with N. Bhatnagar, Hebrew University.
Large-scale Hybrid Parallel SAT Solving Nishant Totla, Aditya Devarakonda, Sanjit Seshia.
3.5 – Solving Systems of Equations in Three Variables.
Statistics for the Social Sciences Psychology 340 Fall 2013 Correlation and Regression.
The satisfiability threshold and clusters of solutions in the 3-SAT problem Elitza Maneva IBM Almaden Research Center.
8.5 – Using Properties of Logarithms. Product Property:
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
Coverage Criteria for Testing of Object Interactions in Sequence Diagrams Atanas (Nasko) Rountev Scott Kagan Jason Sawin Ohio State University.
Logarithmic and Exponential Equations Solving Equations.
Survey Propagation. Outline Survey Propagation: an algorithm for satisfiability 1 – Warning Propagation – Belief Propagation – Survey Propagation Survey.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
Solving Problems by searching Well defined problems A probem is well defined if it is easy to automatically asses the validity (utility) of any proposed.
NAME-PARMAR RAHUL S. BRANCH-ELECTRICAL ROLL NO (313) A. C
Christopher M. Bishop Object Recognition: A Statistical Learning Perspective Microsoft Research, Cambridge Sicily, 2003.
Hybridization of Carbon
SS r SS r This model characterizes how S(t) is changing.
Lagrange Multipliers. Objective: -Understand the method of Lagrange multipliers -Use Lagrange multipliers to solve constrained optimization problems (functions.
Why almost all satisfiable k - CNF formulas are easy? Danny Vilenchik Joint work with A. Coja-Oghlan and M. Krivelevich.
1. Write down the vapor-liquid equilibrium (VLE) equations for a binary system assuming that the vapor phase is ideal and the liquid phase follows Raoult’s.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
1 P NP P^#P PSPACE NP-complete: SAT, propositional reasoning, scheduling, graph coloring, puzzles, … PSPACE-complete: QBF, planning, chess (bounded), …
Propagation of stationary nonlinear waves in disordered media
Higher past papers Home page Home Button Select questions by paper
Combinatorics of colouring 3-regular trees
Multiscale Ensemble Filtering in Reservoir Engineering Applications
March 9th, 2015 Maxime Lapalme Nazim Ould-Brahim
Spin Glass Cavity Method in Random K-Satisfiability Problem
Arthur Choi and Adnan Darwiche UCLA
Testing Assignments of Boolean CSP’s
Introduction Think about all the angles formed by parallel lines intersected by a transversal. What are the relationships among those angles? In this lesson,
Solving Equations Containing Decimals
It means anything not quadratic in fields and derivatives.
Rewriting Equations Equivalent Equations.
Balanced scales and equations
Presentation transcript:

Phase Transitions – like death and taxes? Why we should care; what to do about it. Scott Kirkpatrick, Hebrew University, Jerusalem With thanks to: Uri Gordon, Erik Aurell, Johannes Schneider,…

Phase transitions are inevitable in Avogadro- scale engineering. System properties go from “good” to “not good enough” at the extremes of their parameter space  What happens in between these phases?  We have limited tools for understanding such transitions.  Physics of disordered materials: Sharp vs. smeared – Harris criterion Glass transitions  Combinatorics on large scales Sharp property crossovers – Friedgut’s theorem We should care because computing is HARD at phase boundaries.

SAT and 3-SAT as classic test cases Parameters: N variables, M constraining clauses, M/N constant For 3-SAT, phase diagram is known: M/N< 3.9“easy,” satisfiable (probably P) 3.9 < M/N < 4.27“hard,” but still satisfiable 4.27… < M/Nunsatisfiable, exponential cost Recent advances, applying message-passing, pushed boundary of solubility in the “hard-SAT” region from N = 300 to N = 10^7. General technique – soften the variables into beliefs or surveys

Surveys and Beliefs for the SAT problem Beliefs – probabilities that the spin is up or down  Avg. over satisfying configurations, as estimated by the local tree Surveys – probabilities that the spin is up or down  In all sat configurations.  This leaves a third possibility – spins that do both at different times. Equations for both are nearly identical. We can define hybrid methods, and they prove useful. Use beliefs or surveys to guide decimation – this solves problem.

Propagating surveys or beliefs in a “cavity”

Depth of decimation characterizes BP, SP and mixed-P

Study how SP, BP, m-P evolve by analyzing their hydrodynamics Use movies of N = 100,000 Look at three cases, SP, BP, and the hybrid-P:     (caution, large files)