Fine-grained domain counting and percolation analysis in two-dimensional lattice systems with linked lists.

We present a fine-grained approach to identify clusters and perform percolation analysis in a two-dimensional (2D) lattice system. In our approach, we develop an algorithm based on the linked-list data structure whereby the members of a cluster are nodes of a path. This path is mapped to a linked-list.