2012
DOI: 10.1016/j.jcp.2011.12.029
|View full text |Cite
|
Sign up to set email alerts
|

Off-lattice pattern recognition scheme for kinetic Monte Carlo simulations

Abstract: openAccessArticle: FalsePage Range: 3548-3548doi: 10.1016/j.jcp.2011.12.029Harvest Date: 2016-01-12 15:09:32issueName:cover date: 2012-05-01pubType

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 21 publications
(19 citation statements)
references
References 41 publications
0
19
0
Order By: Relevance
“…The strength of this approach is that a known event can be efficiently matched to a new geometry by using existing subgraph matching algorithms (60). Alternatively, a grid-based approach to pattern recognition of local environments avoids the explicit definition of bonds and retains the fast matching property (61). A weakness of these methods is that graph edges or grid entries are discrete, so there is a trade-off between the size of the environment used to describe an event and the number of graphs in the database.…”
Section: Kdb: Kinetic Databasementioning
confidence: 99%
“…The strength of this approach is that a known event can be efficiently matched to a new geometry by using existing subgraph matching algorithms (60). Alternatively, a grid-based approach to pattern recognition of local environments avoids the explicit definition of bonds and retains the fast matching property (61). A weakness of these methods is that graph edges or grid entries are discrete, so there is a trade-off between the size of the environment used to describe an event and the number of graphs in the database.…”
Section: Kdb: Kinetic Databasementioning
confidence: 99%
“…A recent extension to three dimensions has a similar scaling with interaction range. 14 Another interesting idea, put forward by El-Mellouhi et al, 9 is to store the local environments around active atoms in terms of their bonding topology. An algorithm called NAUTY (Ref.…”
Section: E Previous Workmentioning
confidence: 99%
“…Several KMC methods are available and are implemented depending on the investigated time and space scales. Atomistic kinetic Monte Carlo (AKMC) methods monitor the positions of all atoms on the lattice [8][9][10] or over the space [11,12]. The variant method is commonly known as object kinetic Monte Carlo (OKMC), rather simulate diffusing entities like defect-solute clusters [13].…”
Section: Introductionmentioning
confidence: 99%