Reducing algorithm for percolation cluster analysis

Norbert Sendra, Tomasz Gwizdałła, Jerzy Czerbniak


The determination of percolation threshold is the substantial question for a lot of problems which may be modeled by the formalism of cellular automata. There is a set of well known algorithms which deal with this topic. All of them have some advantages and drawbacks connected to calculational or memory complexity. In our work we are going to present a new approach which we call reducing algorithm. In our procedure we avoid the large memory occupancy which is usually connected to the algorithms aiming not only at confirming the existence of percolation cluster. Our approach makes it also possible to reduce time complexity by only single scan through the analyzed space. In the paper we present some basics of algorithm and the comparison of its effectiveness to other, mentioned earlier, ones.

Full Text:


Data publikacji: 2006-01-01 00:00:00
Data złożenia artykułu: 2016-04-27 10:15:49


Total abstract view - 245
Downloads (from 2020-06-17) - PDF - 0



  • There are currently no refbacks.

Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.