Efficiency of RG compared to CBMC

To test the efficiency of our algorithm, we have simulated the following systems at T = 5.0  

Note that p is the segment density. In all our simulations, we have used tcut = 1 -5. The length of our cubic simulation box was 10.0. We have simulated cdl systems using CBMC (f = 5,10, k = 5,10,15) and RG (f = 5, k = 1,2,3,4,5, I = 1,2,3,4,5). Note that, in principle, k itself can be a stochastic variable [111] - but here we have kept it fixed. We have performed two different trial moves  

In every MC trial move consists of either a trial regrowth or a trial displacement (both selected with equal probability). The amount of CPU time that is spent in the regrowth tried move is monitored during the simulation. A total simulation consists of 10 cycles, i.e. 10 trial moves per chain. 

First of all, we have checked if the implementation of RG and CBMC is correct. We have found excellent agreement in average energies, distribution of the radius of gyration of a chain and also the radial distribution function between RG and CBMC for various simulation parameters. In general, there are several ways to define the efficiency of a simulation  

Number of accepted trial moves divided by the CPU time (t]i). This definition is often used, but it does not say anything about the effectiveness of accepted trial moves in changing the molecular configuration. For example, if we swap between two different configurations the number of accepted trial moves can be large while the system itself is hardly changed. 

---