1999
DOI: 10.1080/08927029908022121
|View full text |Cite
|
Sign up to set email alerts
|

Cluster Identification and Percolation Analysis Using a Recursive Algorithm

Abstract: A recursive algorithm for sampling properties of physical clusters such as size distribution and percolation is presented. The approach can be applied to any system with periodic boundary conditions, given a spatial definition of a cluster. We also introduce some modifications in the algorithm that increases the efficiency considerably if one is only interested in percolation analysis. The algorithm is implemented in Fortran 90 and is compared with a number of iterative algorithms. The recursive cluster identi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 17 publications
(9 reference statements)
0
10
0
Order By: Relevance
“…Percolation analysis involves two steps: First, some connectivity metric must be defined between adjacent percolating units; for water, we make the natural choice that two water molecules are connected if and only if there is a hydrogen bond between them. Next, some algorithm (usually recursive [122]) must be applied to check whether there exists a continuous network of connected (hydrogen bonded) water molecules that entirely spans the system length and is connected with itself through the periodic boundaries of the simulation box. If such a network exists, then it is said to percolate.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Percolation analysis involves two steps: First, some connectivity metric must be defined between adjacent percolating units; for water, we make the natural choice that two water molecules are connected if and only if there is a hydrogen bond between them. Next, some algorithm (usually recursive [122]) must be applied to check whether there exists a continuous network of connected (hydrogen bonded) water molecules that entirely spans the system length and is connected with itself through the periodic boundaries of the simulation box. If such a network exists, then it is said to percolate.…”
Section: Resultsmentioning
confidence: 99%
“…Electrostatic interactions were computed with the particle mesh Ewald (PME) approach [119] and van der Waals interactions were truncated at 1.4 nm accompanied with standard long-range correction. The MDTraj software was utilized for simulation analysis [120], NetworkX software was used for clustering analysis [121] and a recursive algorithm was employed for percolation analysis [122]; specific details of the analysis methods are discussed in the Supporting Information.…”
Section: Introductionmentioning
confidence: 99%
“…To be able to distinguish the different stages of the gel collapse, one may also try to identify clusters formed during a collapse transition. It should be noted that there is no exact definition of a cluster, and different cluster recognition algorithms may be used for this purpose. Here, we will define a cluster as the smallest set of units such that each unit is within a threshold distance, D , from at least one other nonbonded member of the set. As the choice of threshold distance is ambiguous, different values of D were investigated, based on the LJ potential energy curve, to test the sensitivity of the results.…”
Section: Model and Methodsmentioning
confidence: 99%
“…A cluster analysis was performed on the simulation snapshots of the liquids to determine how the glycine molecules tend to associate with each other in the aqueous solutions. The Edvinsson algorithm 31 was used to calculate cluster statistics.…”
Section: Methodsmentioning
confidence: 99%