cmdawson / percolation

Calculation of percolation thresholds for 2d lattices. Makes use of the boost::graph library.

percolation

This branch refactors the original honeycomb lattice to (hopefully) facilitate extensions to more general lattices.

All such lattices now derive from an abstract base class called Lattice which contains all the logic necessary to determine if a long-range connected component exists. General lattices that derive from this are responsible for two things:

1. Constructing the lattice
2. Implementing percolate(const double& p, const double& q)

Constructing the lattice naturally involves adding vertices and edges, but must also label extremities that a long-range connected component must include. For this the VertexT includes a field 'traverse' which can be either START, MIDDLE, or END. The is_crossable routine essentially tries to traverse from a START vertex to an END one.

The ostream<<operator produces a json description of the graph vertex coordinates that may be loaded using a WebGL viewer based on the excellent babylonjs framework. See the webgl subfolder, Note as usual if you're running this from a local filesystem you'll need to allow cross-origin requests, e.g google-chrome -–allow-file-access-from-files.

For background on such thresholds see for example here and see quant-ph/0605014 for their significance in quantum computing.