Kink-jump algorithm

A kink-jump algorithm displaces a few atoms at some point in the chain at each step. 

Fig. 9.2 Illustration of some of the possible moves on the simple cubic lattice for the standard kink jump algorithm.

The kink-jump technique applies random local rotational jumps along the chain. An algorithm for the bead-rod model would have, for example, the following steps ... 

Fig. 1.4 Various examples of dynamic Monte Carlo algorithms for SAWs sites taken by beads are shown by dots, and bonds connecting the bead are shown by lines. Bonds that are moved are shown as a wavy line (before the move) or broken line (after the move), while bonds that are not moved are shown as full lines, (a) Generalized Verdier-Stockmayer algorithm on the simple cubic lattice showing three type of motions end-bond motion, kink-jump motion, 90° crankshaft rotation (b) slithering snake algorithm (c) pivot algorithm. (From Kremer and Binder )...

Simulations of polymer blends or block copolymers involve two rather distinct aspects one aspect is the generation of equilibrium configurations of dense polymer melts and the relaxation of the configurations of individual chains this aspect is not essentially different from simulations that deal with one-component polymer solutions and melts, as treated in other chapters of this book. The work described in the present chapter has used dynamic Monte Carlo methods such as combinations of kink jump and crankshaft rotation algorithms (Fig. 7.5(a)) " or simple hops of effective monomers in randomly chosen lattice directions (in the case of the bond fluctuation model " ) or the slithering snake technique. 52-54,55,80,81 algorithms need a nonzero concentration of vacancies,... 

---