| dc.date.accessioned |
2013-08-12T07:17:25Z |
und |
| dc.date.accessioned |
2017-10-24T12:04:37Z |
|
| dc.date.available |
2013-08-12T07:17:25Z |
und |
| dc.date.available |
2017-10-24T12:04:37Z |
|
| dc.date.issued |
2013-08-12T07:17:25Z |
|
| dc.identifier.uri |
http://radr.hulib.helsinki.fi/handle/10138.1/3039 |
und |
| dc.identifier.uri |
http://hdl.handle.net/10138.1/3039 |
|
| dc.title |
Spin Glasses, Boolean Satisfiability, and Survey Propagation |
en |
| ethesis.discipline |
Theoretical Physics |
en |
| ethesis.discipline |
Teoreettinen fysiikka |
fi |
| ethesis.discipline |
Teoretisk fysik |
sv |
| ethesis.discipline.URI |
http://data.hulib.helsinki.fi/id/C29de80f-21cd-424a-b706-b564d642b058 |
|
| ethesis.department.URI |
http://data.hulib.helsinki.fi/id/3acb09b1-e6a2-4faa-b677-1a1b03285b66 |
|
| ethesis.department |
Institutionen för fysik |
sv |
| ethesis.department |
Department of Physics |
en |
| ethesis.department |
Fysiikan laitos |
fi |
| ethesis.faculty |
Matematisk-naturvetenskapliga fakulteten |
sv |
| ethesis.faculty |
Matemaattis-luonnontieteellinen tiedekunta |
fi |
| ethesis.faculty |
Faculty of Science |
en |
| ethesis.faculty.URI |
http://data.hulib.helsinki.fi/id/8d59209f-6614-4edd-9744-1ebdaf1d13ca |
|
| ethesis.university.URI |
http://data.hulib.helsinki.fi/id/50ae46d8-7ba9-4821-877c-c994c78b0d97 |
|
| ethesis.university |
Helsingfors universitet |
sv |
| ethesis.university |
University of Helsinki |
en |
| ethesis.university |
Helsingin yliopisto |
fi |
| dct.creator |
Landau, Daniel |
|
| dct.issued |
2013 |
|
| dct.language.ISO639-2 |
eng |
|
| dct.abstract |
In recent years statistical physics and computational complexity have found mutually interesting subjects of research. The theory of spin glasses from statistical physics has been successfully applied to the boolean satisfiability problem, which is the canonical topic of computational complexity.
The study of spin glasses originated from experimental studies of the magnetic properties of impure metallic alloys, but soon the study of the theoretical models outshone the interest in the experimental systems. The model studied in this thesis is that of Ising spins with random interactions. In this thesis we discuss two analytical derivations on spin glasses: the famous replica trick on the Sherrington-Kirkpatrick model and the cavity method on a Bethe lattice spin glass.
Computational complexity theory is a branch of theoretical computer science that studies how the running time of algorithms scales with the size of the input. Two important classes of algorithms or problems are P and NP, or colloquially easy and hard problems. The first problem to be proven to belong to the class of NP-complete problems is that of boolean satisfiability, i.e., the study of whether there is an assignment of variables for a random boolean formula so that the formula is satisfied. The boolean satisfiability problem can be tackled with spin glass theory; the cavity method can be applied to it.
Boolean satisfiability exhibits a phase transition. As one increases the ratio of constraints to variables the probability of a random formula being satisfiable drops from unity to zero. This transition of random formulas from satisfiable to unsatisfiable is continuous for small formulas. It grows sharper with increasing problem size and becomes discrete at the limit of an infinite number of variables. The cavity method gives a value for the location of the phase transition that is in agreement with the numerical value.
The cavity method is an analytical tool for studying average values over a distribution, but it introduces so called surveys that can also be calculated numerically for a single instance. These surveys inspire the survey propagation algorithm that is implemented as a numerical program to efficiently solve large instances of random boolean satisfiability problems.
In this thesis I present a parallel version of survey propagation that achieves a speedup by a factor of 3 with 4 processors. With the improved version we are able to gain further knowledge on the detailed workings of survey propagation. It is found, firstly, that the number of iterations needed for one convergence of survey propagation depends on the number of variables, seemingly as ln(N). Secondly, it is found that the constraint to variable ratio for which survey propagation succeeds is dependent on the number of variables. |
en |
| dct.language |
en |
|
| ethesis.language.URI |
http://data.hulib.helsinki.fi/id/languages/eng |
|
| ethesis.language |
English |
en |
| ethesis.language |
englanti |
fi |
| ethesis.language |
engelska |
sv |
| ethesis.thesistype |
pro gradu-avhandlingar |
sv |
| ethesis.thesistype |
pro gradu -tutkielmat |
fi |
| ethesis.thesistype |
master's thesis |
en |
| ethesis.thesistype.URI |
http://data.hulib.helsinki.fi/id/thesistypes/mastersthesis |
|
| dct.identifier.urn |
URN:NBN:fi-fe2017112252487 |
|
| dc.type.dcmitype |
Text |
|
