This work describes the percolation phenomena in different structures through deep neural networks and previously calculated statistical data of percolation. Despite being relatively simple and easy to calculate at small scales, the percolation process is computationally time-consuming at large scales; here, a significant computation is necessary to determine if a cluster percolates or not. We propose to train deep neural networks on small systems and scale to large systems. Our results show a reasonable accuracy rate on recognition of images, particularly on fully convolutional neural networks for the continuum case, a recent improvement on classical convolutional neural networks, improving the recognition of percolation phenomena, portability, and scalability.

1.
J. W.
Essam
, “
Percolation theory
,”
Reports on Progress in Physics
43
,
833
912
(
1980
).
2.
J.
Wang
,
Z.
Zhou
,
W.
Zhang
,
T. M.
Garoni
, and
Y.
Deng
, “
Bond and site percolation in three dimensions
,”
Phys. Rev. E
87
,
052107
(
2013
).
3.
T.
Gebele
, “
Site percolation threshold for square lattice
,”
Journal of Physics A: Mathematical and General
17
,
L51
L54
(
1984
).
4.
S.
Albawi
,
T. A.
Mohammed
, and
S.
Al-Zawi
, “
Understanding of a convolutional neural network,”
in
2017 International Conference on Engineering and Technology (ICET)
(
2017
) pp.
1
6
.
5.
J.
Long
,
E.
Shelhamer
, and
T.
Darrell
, “
Fully convolutional networks for semantic segmentation,”
in
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
(
2015
).
6.
F.
Milletari
,
N.
Navab
, and
S.-A.
Ahmadi
, “
V-net: Fully convolutional neural networks for volumetric medical image segmentation,”
in
2016 Fourth International Conference on 3D Vision (3DV)
(
2016
) pp.
565
571
.
7.
S. S. S.
Kruthiventi
,
K.
Ayush
, and
R. V.
Babu
, “
Deepfix: A fully convolutional neural network for predicting human eye fixations
,”
IEEE Transactions on Image Processing
26
,
4446
4456
(
2017
).
8.
S. R.
Park
and
J.
Lee
, “
A fully convolutional neural network for speech enhancement
,” (
2016
), arXiv:1609.07132 [cs.LG].
9.
P. V.
Tran
, “
A fully convolutional neural network for cardiac segmentation in short-axis mri
,” (
2017
), arXiv:1604.00494 [cs.CV].
10.
I.
Balberg
, “
Recent developments in continuum percolation
,”
Philosophical Magazine B
56
,
991
1003
(
1987
), https://doi.org/10.1080/13642818708215336.
11.
F.
Chollet
et al, “
Keras
,” (
2015
).
12.
G.
Van Rossum
and
F. L.
Drake
,
Python 3 Reference Manual
(
CreateSpace
,
Scotts Valley, CA
,
2009
).
13.
J.
Hoshen
,
M. W.
Berry
, and
K. S.
Minser
, “
Percolation and cluster structure parameters: The enhanced hoshen-kopelman algorithm
,”
Phys. Rev. E
56
,
1455
1460
(
1997
).
14.
A.
Al-Futaisi
and
T. W.
Patzek
, “
Extension of hoshen–kopelman algorithm to non-lattice environments
,”
Physica A: Statistical Mechanics and its Applications
321
,
665
678
(
2003
).
15.
A.
Clark
, “
Pillow (pil fork) documentation
,” (
2015
).
16.
L.
Dalcin
and
Y.-L. L.
Fang
, “
mpi4py: Status update after 12 years of development
,”
Computing in Science Engineering
23
,
47
54
(
2021
).
17.
A cluster is a group of white or black points in the structure, with a well defined shape
.
18.
D.
Stauffer
, “
Cluster structure for dilute ferromagnets and percolation
,”
Journal of Physics C: Solid State Physics
8
,
L172
L177
(
1975
).
19.
D. P.
Kingma
and
J.
Ba
, “
Adam: A method for stochastic optimization
,”
arXiv preprint arXiv:1412.6980
(
2014
).
20.
Y.
Ho
and
S.
Wookey
, “
The real-world-weight cross-entropy loss function: Modeling the costs of mislabeling
,”
IEEE Access
8
,
4806
4813
(
2019
).
This content is only available via PDF.
You do not currently have access to this content.