Characterising submonolayer deposition via visibility graphs
classification
❄️ cond-mat.mes-hall
physics.comp-ph
keywords
visibilitygraphislanddepositiongraphssizesubmonolayeralgorithm
read the original abstract
We use visibility graphs as a tool to analyse the results of kinetic Monte Carlo (kMC) simulations of submonolayer deposition in a one-dimensional point island model. We introduce an efficient algorithm for the computation of the visibility graph resulting from a kMC simulation and show that from the properties of the visibility graph one can determine the critical island size, thus demonstrating that the visibility graph approach, which implicitly combines size and spatial data, can provide insights into island nucleation and growth processes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.