Typification and Visualisation of Percolation Clusters
Objective:
Display and count the bonds between sites in percolation clusters for deeply
understanding of the related phenomena.
Introduction:
For an introduction to percolation please follow percolation
intro
Proposal:
-
Developing a C programs for generating clusters on the square and
cubic lattices.
-
Classifying the different objects (blobs, nodes, etc.) in the cluster.
-
Classifying an s cluster with different p perimeters.
Development:
-
A Hoshen-Koppelman algorithm will be used for labeling the lattice sites.
-
Other techniques will be investigated for speed up enumeration and simulation
times.
-
The AViz package will be used to visualize the clusters generated.
Computing:
-
Calculations will be performed on a Linux machine.
-
The results will be displayed in every system which supports the AViz package.
-
The results will be presented in a web page.
References:
-
Stauffer D. and Aharony A., Introduction to percolation theory, 2nd
edition.
- Gerald P. and Stanley H. E.,Beyond Blobs in Percolation Structure,
Phys. Rev. E, 65, 056126
- Grimmett G., Percolation, 2nd ed., Springer (1999).
- Frey T. and Decker E., Percolation Theory