Next: Summary Up: PROPERTIES OF REARRANGEMENT PATHWAYS Previous: Cooperativity   Contents

# Applications to LJ and LJ Clusters and BLJ Liquid

Figure 3.2 shows results for the most cooperative and uncooperative processes we have found for the LJ cluster that are localised mainly on two atoms. In these calculations we have used the database of transition states that was found previously as the result of a discrete path sampling calculation conducted for this system [10,8]. The cooperative rearrangement [Figure 3.2(a,c)] is the one with the maximum two-overlap . For this pathway , , and . The values of and both reflect the fact that the motion of the two atoms is accompanied by a slight distortion of the cluster core. This example shows that while and allow us to quantify localisation and cooperativity, and correctly reflect the number of atoms that participate and move cooperatively in ideal cases, there will not generally be a simple correspondence between their values and the number of atoms that move. This complication is due to the fact that small displacements of atoms in the core will generally occur, no matter how localised the rearrangement is. In addition, the data reduction performed in Equation 3.7 and Equation 3.13 means that a range of pathways can give the same value for or . Since the size of the contribution from a large number of small displacements depends on the shape of the displacement distribution function the number of possibilities grows with the size of the index.

The uncooperative rearrangement depicted in the Figure 3.2(b,d) was harder to identify. In principle we could have selected the pathway that maximises from all the rearrangements localised on two atoms. However, this approach picks out rearrangements localised on one atom, where distortion of the core accounts for the value of . Instead, we first selected from all the rearrangements with those where two atoms move by approximately the same amount, while the displacement of any other atom is significantly smaller. These are the rearrangements that maximise , where and are the total displacements of the two atoms that move the most. After this procedure we selected the rearrangement with the maximum value of . Figure 3.2 (b) shows that this rearrangement features the displacement of one atom at a time, and the atom that moves first also moves last. For this pathway the values of , and are , and , respectively. Further illustrations and movies of the corresponding rearrangements are available online [181].

Figure 3.2 illustrates several general trends that we have observed for cluster rearrangements. Firstly, we have found that the barrier height is smaller for the cooperative rearrangements [Figure 3.2(c,d)]. Usually atoms that move cooperatively are neighbours. Rearrangements generally involve a change of the environment for the atoms that move. Cooperative motion can reduce this perturbation since for any of the participants the local environment is partly preserved because it moves with the atom in question. Flatter points on the energy profile [circled in Figure 3.2(d)] usually signify a change in the mechanism, i.e. one group of atoms stops moving and another group starts. By comparing (b) and (d) in Figure 3.2 we conclude that flatter points on the energy profile correlate with the most cooperative parts of this rearrangement.

A simple correlation between barrier heights and and does not seem to exist. The barrier height is not a function of cooperativity alone, but also of the energetics of the participating atoms. The way the and indices have been defined can make them insensitive to details of the rearrangements that will affect the energetics. For instance, neither index depends on the location of the participating atoms or the directionality of their motion. In most cases cooperatively moving particles are adjacent, i.e. localised in space; however, long-distance correlations of atomic displacements also occur. One such case is depicted in Figure 3.5 (a). This path is nearly symmetric with respect to the integrated path length ( ), but is very asymmetric with respect to the uphill and downhill barrier heights ( ). This rearrangement has . Interestingly, and calculated separately for both sides of the pathway are very similar, i.e. the two steepest-descent pathways cannot be distinguished using these indices. Close inspection of this rearrangement reveals that one side of the pathway involves the rearrangement of two atomic triplets that share a vertex, while the other side involves the drift of all five atoms on the surface of the cluster [see the insets in Figure 3.5 (a)]. Although does not distinguish these cases, the motion in the second side of the path is more cooperative. The participating atoms move together, which results in a significantly lower downhill barrier.

and also describe properties of the whole pathway. A significant number of pathways that we observed were rather non-uniform, i.e. very cooperative phases alternated with uncooperative ones. To distinguish such pathways in the LJ database we calculated a set containing 's evaluated for each pair of adjacent frames. Then a selection of pathways was made with , where is the moment ratio evaluated for the set . While this procedure ensured that corresponds closely to the number of atoms that moves between any two snapshots of the rearrangement, it did not distinguish cases where different atoms contribute to the value of in different frames [see Figure 3.5 (b)]. The average uphill and downhill barriers for this subset of rearrangements are times smaller than the average barriers for the complete LJ database (Table 3.1). Figure 3.6 shows that and calculated for these rearrangements are highly correlated and span a range of values, implying that widely different pathways are represented. Finally, all the selected pathways are an order of magnitude shorter than the average path length for the whole database, even though this database contains many short rearrangements localised on one atom.

 All Cooperative Uphill barrier 3.03 0.06 Downhill barrier 0.97 0.03 Path length 3.08 0.58

Figure 3.7 shows the values of the and indices plotted against each other for pathway databases calculated for LJ, LJ and BLJ. The two databases for BLJ labelled as and are taken from Reference middletonw01 and correspond to databases BLJ1 and BLJ12 in that paper. BLJ1 and BLJ12 were obtained using two different sampling schemes intended to provide an overview of a wide range of configuration space and a thorough probe of a smaller region, respectively. These databases were constructed by systematic exploration of the PES, and we refer the reader to the original work for further details [171]. Each BLJ database contains transition states. The LJ and LJ databases were obtained in discrete path sampling (DPS) studies [10,8]. and contain and transition states, respectively. Figure 3.7 is a density plot where darker shading signifies a higher concentration of data points. The outlying points are connected by a solid line to define the area in which all the points lie. Figure 3.7 shows that as grows the allowed range of increases, especially for LJ. For the LJ database rearrangements with appear to be very rare or poorly sampled. Figure 3.7 also shows that for all these systems rearrangements localised on two or three atoms dominate. This result may be an intrinsic property. However, it may also be due to the geometric perturbation scheme used in producing the starting points for the transition state searches employed in generating these databases. For databases BLJ1 and BLJ12 there are significantly more rearrangements with larger values of and compared to LJ, which suggests that the abundance of very localised rearrangements for clusters may be a surface effect. The apparent absence of cooperative rearrangements in LJ database for large values of may be due to the fact that only the pathways between compact phases of this cluster were sampled thoroughly, i.e. rearrangements involving liquid-like structures that are expected to have larger values of are probably underrepresented.

Figure 3.8 depicts the average barrier as a function of the participation and cooperativity indices. and were calculated separately for both sides of the pathway and the corresponding barriers (uphill or downhill) were averaged to produce a density plot of barrier height. Data boundaries do not coincide with those shown in Figure 3.7 due to numerical imprecision in preparing Figure 3.7. Figure 3.8 illustrates that for each system cooperative rearrangements have the lowest barriers, irrespective of the value of . For clusters, cooperative rearrangements have lower barriers than uncooperative rearrangements with as small as , while for bulk barriers corresponding to rearrangements with low become comparable to these for very cooperative rearrangements with high .

In further computational experiments we found that attempts to connect the endpoints of uncooperative pathways using the algorithm described in Chapter 2 either required more images and iterations or converged to an alternative pathway. In some cases additional difficulties arose, such as convergence to a higher index saddle instead of a transition state, which can happen if the linear interpolation guess conserves a symmetry plane. Figure 3.9 shows calculated from Equation 3.13 plotted against for the LJ pathway database. Knowing the integrated path length, , for each pathway we started doubly nudged elastic band calculations with three images per unit of distance and iterations per image. Most of the points that correspond to runs that failed or converged to an alternative pathways are concentrated in the region of small values for .

As can be seen from Figure 3.7, the LJ database contains significantly more pathways with large values of and compared to LJ, where most of the rearrangements are localised on two atoms. The fact that the LJ database is almost exhaustive then suggests that localised rearrangements either start to dominate as the system size increases or that the sampling scheme used for LJ was biased towards such mechanisms. Systematic sampling of the configuration space for stationary points often employs perturbations of every degree of freedom followed by minimisation [162]. The LJ database was obtained in this fashion, while the LJ database was generated during the DPS approach [8]. In this procedure discrete paths are perturbed by replacing local minima with structures obtained after perturbing all the coordinates and minimising. To investigate whether the perturbation scheme can affect the resulting database of stationary points in more detail we consider the case of LJ, since nearly all the transition states are known. Figure 3.10 presents the results of two independent runs aimed at locating most of the transition states for this system. Every cycle a perturbation was applied to a randomly selected transition state from the database and the resulting geometry was used as a starting point for a new transition state search using eigenvector-following [22,23,72,24,19]. Only distinct permutation-inversion isomers were saved. In the first run (bottom curve) every degree of freedom was perturbed by , where is a random number in the interval  [162]. For the second run (top curve) we introduced a perturbation scheme including correlation. atoms out of were displaced by a vector , where the components , and are again random numbers drawn from . The atoms to be displaced were selected based on their relative positions in the cluster. One atom was first selected at random, while the remaining were chosen to be its closest neighbours. The top curve was generated from a run with . Both runs required approximately the same time to produce two nearly identical databases, each containing about pathways. However, as can be seen from Figure 3.7, random perturbation of all the degrees of freedom results in uncooperative rearrangements being found first, while employing correlated perturbations has the opposite effect.

Next: Summary Up: PROPERTIES OF REARRANGEMENT PATHWAYS Previous: Cooperativity   Contents
Semen A Trygubenko 2006-04-10