exercises:2018_ethz_mmm:kmc2018
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| exercises:2018_ethz_mmm:kmc2018 [2018/03/08 08:21] – created dpasserone | exercises:2018_ethz_mmm:kmc2018 [2020/08/21 10:15] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| ===== | ===== | ||
| + | <note tip> | ||
| + | Please download the program **kinetic_monte_carlo.py** from [[https:// | ||
| + | </ | ||
| The molecule shown in the image (hexaiodo-substituted | The molecule shown in the image (hexaiodo-substituted | ||
| macrocycle cyclohexa-m-phenylene (CHP) ), when deposited on a noble metal substrate such as | macrocycle cyclohexa-m-phenylene (CHP) ), when deposited on a noble metal substrate such as | ||
| Line 11: | Line 14: | ||
| The relative probability of diffusion and of binding to a neighboring molecule | The relative probability of diffusion and of binding to a neighboring molecule | ||
| determine the shape of the network that will be obtained. | determine the shape of the network that will be obtained. | ||
| - | The experiments performed at Empa [ [[http:// | + | The experiments performed at Empa [ [[http:// |
| while on a Au substrate 2D networks will form. | while on a Au substrate 2D networks will form. | ||
| Line 18: | Line 21: | ||
| <note tip> | <note tip> | ||
| The python program KMC.py will allow you to simulate the diffusion and binding of molecules | The python program KMC.py will allow you to simulate the diffusion and binding of molecules | ||
| - | once the energy barriers for the diffusion event and for the binding event as well as the simulation temperature | + | once the energy barriers for the diffusion event and for the binding event as well as the simulation temperature |
| Line 26: | Line 29: | ||
| Molecules free to diffuse will be represented via blue dots. | Molecules free to diffuse will be represented via blue dots. | ||
| - | Molecules that irreversibly formed a bond with a neighboring molecule will be represented by red dots. | + | Molecules that "irreversibly" |
| - | At the end of the execution a snapshot of the final configuration | + | A few snapshots |
| + | |||
| + | Execute the program | ||
| + | < | ||
| + | python kinetic_monte_carlo.py | ||
| + | </ | ||
| The program asks you for some input: | The program asks you for some input: | ||
| < | < | ||
| - | coverage | ||
| update graph each steps | update graph each steps | ||
| + | coverage | ||
| temperature in K | temperature in K | ||
| diffusion barrier | diffusion barrier | ||
| Line 39: | Line 48: | ||
| </ | </ | ||
| - | < | + | < |
| **TASK 1** | **TASK 1** | ||
| execute the program with the following parameters: | execute the program with the following parameters: | ||
| < | < | ||
| - | coverage 0.1 | + | update graph each steps 1000 |
| - | update graph each steps 500 | + | coverage 0.3 |
| - | number of steps 100000 | + | number of steps 130000 |
| temperature in K 300 | temperature in K 300 | ||
| diffusion barrier 0.1 | diffusion barrier 0.1 | ||
| Line 52: | Line 61: | ||
| Observe how events occur. | Observe how events occur. | ||
| Observe how time evolves. | Observe how time evolves. | ||
| - | Did the job perform all the 100000 | + | Did the job perform all the 300000 |
| Observe the patterns obtained. | Observe the patterns obtained. | ||
| </ | </ | ||
| - | < | + | < |
| **TASK 2** | **TASK 2** | ||
| execute the program with the following parameters: | execute the program with the following parameters: | ||
| < | < | ||
| - | coverage 0.1 | + | update graph each steps 1000 |
| - | update graph each steps 500 | + | coverage 0.3 |
| - | number of steps 100000 | + | number of steps 300000 |
| temperature in K 300 | temperature in K 300 | ||
| diffusion barrier 0.3 | diffusion barrier 0.3 | ||
| Line 69: | Line 78: | ||
| Do you notice differences in the way events occur? | Do you notice differences in the way events occur? | ||
| How is evolving time compared to the previous case? | How is evolving time compared to the previous case? | ||
| - | How does the final geometry differ | + | How does the final geometry differ |
| </ | </ | ||
| - | < | + | < |
| + | **TASK 3** | ||
| Now have a look at the python code. | Now have a look at the python code. | ||
| The MAIN section | The MAIN section | ||
| Line 120: | Line 130: | ||
| </ | </ | ||
| </ | </ | ||
| - | < | + | < |
| - | **TASK | + | **TASK |
| - | Have a look on the section of the code that create | + | Have a look at the section of the code that creates |
| comment on which are the critical points in setting up a KMC simulation | comment on which are the critical points in setting up a KMC simulation | ||
| to describe a real process. | to describe a real process. | ||
| - | + | </ | |
| - | **TASK | + | <note important> |
| - | At each step of the simulaiton the list of possible events is created (or, betetr, updated) | + | **TASK |
| - | an event is chosen randomly and is then actuated. | + | At each step of the simulaiton the list of possible events is created (or, better, updated). |
| + | An event is chosen randomly and is then actuated. | ||
| Would it be possible to execute simultaneously more events at each KMC step? | Would it be possible to execute simultaneously more events at each KMC step? | ||
| </ | </ | ||
exercises/2018_ethz_mmm/kmc2018.1520497284.txt.gz · Last modified: (external edit)
