Fighting topological freezing in the two-dimensional CP$^{N-1}$ model
Martin Hasenbusch

TL;DR
This paper investigates methods to mitigate topological freezing in the 2D CP^{N-1} model through open boundary conditions and parallel tempering, showing promising results in reducing autocorrelation times.
Contribution
It demonstrates the effectiveness of open boundary conditions and parallel tempering in alleviating topological freezing in the CP^{N-1} model.
Findings
Open boundary conditions help avoid topological freezing.
Autocorrelation times remain large despite open boundaries.
Parallel tempering shows encouraging results in reducing freezing.
Abstract
We perform Monte Carlo simulations of the CP model on the square lattice for , , and . Our focus is on the severe slowing down related to instantons. To fight this problem we employ open boundary conditions as proposed by L\"uscher and Schaefer for lattice QCD. Furthermore we test the efficiency of parallel tempering in a line defect. Our results for open boundary conditions are consistent with the expectation that topological freezing is avoided, while autocorrelation times are still large. The results obtained with parallel tempering are encouraging.
| 0.8 | 72 | 20 | 0.6670180(54) | 28.0588(53) | 4.5970(28) | 0.0009711(22) | 1.19(1) |
| 0.85 | 96 | 28 | 0.6222722(36) | 46.8669(90) | 6.3965(37) | 0.0004651(17) | 3.02(5) |
| 0.9 | 136 | 38 | 0.5838375(23) | 78.186(17) | 8.8113(50) | 0.0002299(14) | 9.30(25) |
| 0.96 | 192 | 56 | 0.5440439(15) | 144.896(32) | 12.8674(74) | 0.0001042(14) | 43.3(2.4) |
| 1.00 | 248 | 72 | 0.5205875(11) | 219.052(64) | 16.524(11) | 0.0000616(15) | 131.(14.) |
| 0.625 | 26 | 3 | 0.833348(10) | 9.648(2) | 2.2879(6) | 0.001696(9) | 14.16(35) |
| 0.65 | 32 | 4 | 0.799334(8) | 12.179(2) | 2.6993(7) | 0.001170(9) | 28.76(90) |
| 0.675 | 38 | 5 | 0.768003(6) | 15.429(3) | 3.1814(8) | 0.000820(9) | 63.1(2.5) |
| 0.7 | 44 | 6 | 0.739044(7) | 19.603(6) | 3.744(2) | 0.000570(16) | 199.(18.) |
| 0.725 | 52 | 7 | 0.712213(7) | 24.954(11) | 4.398(3) | 0.000426(20) | 524.(64.) |
| 0.75 | 60 | 8 | 0.687255(5) | 31.86(3) | 5.165(8) | 0.00027(3) | 2600.(1000.) |
| 0.8 | 72 | 44 | 20 | 0.6670240(31) | 28.0531(29) | 4.6098(17) | 0.0009739(14) | 0.897(6) |
| 0.85 | 96 | 60 | 28 | 0.6222721(21) | 46.8619(48) | 6.4147(24) | 0.0004617(10) | 1.866(20) |
| 0.9 | 136 | 82 | 38 | 0.5838347(13) | 78.1989(80) | 8.8441(34) | 0.0002333(8) | 4.56(9) |
| 0.95 | 184 | 112 | 52 | 0.55026611(91) | 130.701(15) | 12.1309(47) | 0.00011930(65) | 9.88(23) |
| 1.0 | 248 | 152 | 72 | 0.52058941(63) | 219.083(27) | 16.5884(68) | 0.00006285(59) | 22.0(1.4) |
| 1.02 | 288 | 174 | 82 | 0.50964615(37) | 269.527(23) | 18.7875(54) | 0.00004939(38) | 27.4(1.2) |
| 1.05 | 344 | 210 | 98 | 0.49410845(36) | 368.394(39) | 22.6516(81) | 0.00003414(40) | 36.0(3.7) |
| periodic | open | ratio | |
|---|---|---|---|
| 0.8 | 0.00973 | 0.00576 | 0.6 |
| 0.85 | 0.00221 | 0.00184 | 0.8 |
| 0.9 | 0.000555 | 0.000545 | 1.0 |
| 0.95 | 0.000118 | 0.000159 | 1.3 |
| 1.0 | 0.0000217 | 0.0000389 | 1.8 |
| 1.02 | 0.00000864 | 0.0000254 | 2.9 |
| 1.05 | 0.00000385 | 0.0000126 | 3.3 |
| 0.625 | 38 | 22 | 3 | 0.8333946(36) | 9.6087(5) | 2.2968(5) | 0.0017056(50) | 8.32(11) |
| 0.65 | 44 | 26 | 4 | 0.7993498(29) | 12.1470(7) | 2.7137(5) | 0.0011668(46) | 14.95(28) |
| 0.675 | 52 | 32 | 5 | 0.7680222(24) | 15.3903(9) | 3.1992(7) | 0.0008015(47) | 29.4(1.1) |
| 0.7 | 60 | 38 | 6 | 0.7390678(20) | 19.5466(12) | 3.7638(8) | 0.0005708(48) | 57.2(2.9) |
| 0.725 | 72 | 44 | 7 | 0.7122223(15) | 24.8775(16) | 4.4188(10) | 0.0004220(50) | 117.(8.) |
| 0.75 | 84 | 52 | 8 | 0.6872687(13) | 31.7435(20) | 5.1852(12) | 0.0002891(40) | 146.(12.) |
| 0.8 | 112 | 70 | 11 | 0.6422831(9) | 51.9924(34) | 7.1207(16) | 0.0001534(23) | 154.(13.) |
| 0.85 | 156 | 100 | 15 | 0.6028740(6) | 85.7964(58) | 9.7556(23) | 0.0000803(13) | 145.(13.) |
| 0.9 | 212 | 132 | 20 | 0.5680773(4) | 142.539(10) | 13.3544(33) | 0.00004421(77) | 156.(15.) |
| 0.95 | 300 | 182 | 28 | 0.5371311(3) | 238.187(16) | 18.2419(43) | 0.00002327(37) | 103.(9.) |
| 0.65 | 56 | 34 | 6 | 0.7810290(15) | 15.9354(6) | 3.3730(6) | 0.0003598(51) | 173.(13.) |
| 0.7 | 76 | 48 | 8 | 0.7249816(10) | 25.5383(11) | 4.6324(8) | 0.0001858(28) | 174.(15.) |
| 0.75 | 104 | 64 | 11 | 0.6760887(7) | 41.4379(17) | 6.3550(11) | 0.0000977(15) | 171.(16.) |
| 0.8 | 140 | 86 | 15 | 0.6331986(5) | 67.9135(30) | 8.7023(16) | 0.0000518(8) | 145.(13.) |
| 0.8 | 112 | 11 | 8 | 16 | 16 | 0.6422829(12) | 51.9872(46) | 0.00015574(58) | 4.28(15) |
| 0.85 | 156 | 15 | 8 | 16 | 16 | 0.6028732(7) | 85.793(7) | 0.00008196(39) | 9.6(5) |
| 0.9 | 212 | 20 | 12 | 32 | 24 | 0.5680766(5) | 142.506(13) | 0.00004377(18) | 5.5(2) |
| 0.95 | 300 | 28 | 16 | 32 | 32 | 0.5371312(6) | 238.223(36) | 0.00002305(16) | 7.2(5) |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Fighting topological freezing in the two-dimensional CPN-1 model
Martin Hasenbusch
Institut für Physik, Humboldt-Universität zu Berlin, Newtonstr. 15, 12489 Berlin, Germany
Abstract
We perform Monte Carlo simulations of the CPN-1 model on the square lattice for , , and . Our focus is on the severe slowing down related to instantons. To fight this problem we employ open boundary conditions as proposed by Lüscher and Schaefer for lattice QCD. Furthermore we test the efficiency of parallel tempering in a line defect. Our results for open boundary conditions are consistent with the expectation that topological freezing is avoided, while autocorrelation times are still large. The results obtained with parallel tempering are encouraging.
pacs:
11.15.Ha, 12.38.Gc, 05.10.Ln
I Introduction
The CPN-1 model shares certain fundamental properties such as asymptotic freedom and confinement with QCD. Therefore this model has been frequently studied as a toy model of QCD. It has been shown Adda78 ; Witten79 that the model has a non-trivial vacuum structure with stable instanton solutions. It turned out that these topological objects pose a particular problem in the simulation of the lattice CPN-1 model, similar to lattice QCD.
On the torus, in the continuum limit, the configuration space is decomposed into sectors that are characterized by their topological charge. At finite lattice spacing, the free energy barriers between such sectors increase as the lattice spacing decreases. For Markov chain Monte Carlo algorithms that walk in a quasi continuous fashion through configuration space this means that they become essentially non-ergodic and slowing down becomes dramatic. Numerical results are compatible with an increase of autocorrelation times that is exponential in the inverse lattice spacing. In the case of the CPN-1 model this was first suggested and numerically verified in ref. campostrini . Later this behaviour was numerically confirmed for example in refs. Vicari04 ; Flynnetal15 . Modelling the autocorrelation times with a more conventional power law Ansatz, large powers are needed to fit the data. From a practical point of view, the consequence is that it becomes virtually impossible to access lattice spacings below a certain threshold. The numerical studies show that in the case of the CPN-1 model the problem becomes worse with increasing . Since it is much less expensive to simulate the two-dimensional model than lattice QCD, it is a good test bed for new ideas and algorithms that could overcome the severe slowing down of the topological modes. For example simulated tempering MaPa92 has been studied in ref. Vicari92 with moderate success. More recently, “trivializing maps in the Hybrid Monte Carlo algorithm” Engel11 or the “Metadynamics” method Metadynamics have been tested.
A very principle solution of the problem had been suggested in ref. LuSc11 . By abandoning periodic boundary conditions in one of the directions in favour of open ones, barriers between the topological sectors are abolished. This idea should work independently of the algorithm that is used in the simulation. The proposal has been further tested LuSc13 ; McGlMa14 and adopted in large scale simulations of lattice QCD with dynamical fermions, see for example refs. ALPHA14 ; CLS .
Here we shall probe in detail how open boundary conditions effect the slowing down in the case of the CPN-1 model. Since the CPN-1 model is much cheaper to simulate than lattice QCD, a larger range of lattice spacings can be studied and autocorrelation functions can be computed more accurately.
Furthermore, we shall explore parallel tempering raex ; SW86 as a solution to our problem. Parallel tempering is a well established approach in statistical physics to overcome effective non-ergodicity due to a ragged free energy landscape. The idea of parallel tempering and similar methods is to enlarge the configuration space such that the hills can be easily by-passed. A prototype problem is the study of spin-glasses, where parallel tempering is mandatory. For recent work see for example ref. Janus2013 . Typically a global parameter such as the temperature or an external field is used as parameter of the tempering. Here instead, we shall discuss a localized defect. In particular we shall interpolate between a system with a line defect and a homogeneous system with periodic boundary conditions.
Finally we like to mention that for the CPN-1 model dual formulations can be found. These can be simulated by using the worm algorithm wurm ; Ulli . In these dual formulations there are no topological sectors and hence severe slowing down does not occur in the simulation. For recent work and a discussion of the literature see ref. RiFo16 . Unfortunately, a similar approach to full QCD has not been worked out yet.
The outline of the paper is the following: In the next section we define the lattice model and the observables that we measure. Next we discuss the basic update algorithms and the parallel tempering scheme that are used. We perform standard simulations of lattices with periodic boundary conditions in both directions. We check that our results are consistent with those presented in the literature. Then follow our simulations with open boundary conditions in one of the directions. Next we discuss our runs with parallel tempering. We compare our results for physical quantities with those of the large -expansion. Finally we conclude and give an outlook.
II The model
We simulate the CPN-1 model on the square lattice. It is defined by the action
[TABLE]
where is a complex -component vector with and is a complex number with . The sites of the lattice are denoted by , where . The lattice spacing is set to in the following. This means that we trade a decreasing lattice spacing for an increasing correlation length. The gauge fields live on the links, which are denoted by , where gives the direction. is a unit vector in -direction. In -direction we shall always employ periodic boundary conditions. In [math]-direction either periodic or open boundary conditions are employed. Here we implement open boundary conditions in a crude way, simply setting for the links that connect and .
II.1 The observables
In the case of periodic boundary conditions in both directions we follow the literature. For completeness we recall the definitions of the observables that we measure.
The energy is given by
[TABLE]
Further observables are based on the composite operator
[TABLE]
or in terms of the components
[TABLE]
The connected correlation function is now defined as
[TABLE]
The Fourier transform of the correlation function is given by
[TABLE]
The magnetic susceptibility is given by
[TABLE]
The second moment correlation length is defined as
[TABLE]
where is the dimension of the system. In Monte Carlo simulations this definition has to be adjusted to the finite size of the lattice. A popular choice for the second moment correlation length on a finite lattice is
[TABLE]
A downside of this definition is that it introduces corrections that are avoided by other definitions; see for example eqs. (16,17) below.
A geometrical definition of the topological charge is given by BergLuescher81
[TABLE]
where the principle branch of the logarithm is taken and . Motivated by eq. (33) of ref. campostrini we have used
[TABLE]
where
[TABLE]
where and the integer is chosen such that . The topological susceptibility is then given by
[TABLE]
Note that the definitions (10) and (11) are not equivalent at finite lattice spacing. For at , which is the smallest value of that we have studied, we find that eq. (11) gives a value for the topological susceptibility that is about smaller than that obtained by using eq. (10). This difference decreases with increasing . The difference is roughly proportional to . For larger values of , the difference seems to decrease even more rapidly. We also did a few experiments with cooling. After one step of our cooling procedure, the difference in the topological susceptibility obtained by using the two different definitions of the topological charge is drastically reduced. We conclude that both definitions lead to the same results in the continuum limit. In most of our simulations, we only determined the topological susceptibility obtained with eq. (11), since it requires somewhat less CPU time than eq. (10). The numbers reported in the following always refer to eq. (11).
II.1.1 Open boundary conditions in [math]-directions
The definitions of susceptibilities and the second moment correlation length given above have to be adjusted to open boundary conditions. This has been discussed for example in section 3.2 of ref. ALPHA14 for the topological susceptibility in the case of lattice QCD.
Let us start with the definition of the magnetic susceptibility. First we rewrite the definition (7) for periodic boundary conditions such that it is suitable for generalization to open ones:
[TABLE]
where
[TABLE]
We assume that decays as for large and . In order to avoid effects due to open boundaries we restrict the summation over such that we stay away from the boundaries by the distance :
[TABLE]
where . The effects of the open boundary conditions decay exponentially fast with increasing , where we assume . The exponential decay is governed by the correlation length. Therefore should be chosen as a multiple of the correlation length . Below in section IV.2 we give a quantitative discussion of this point. In order to get the second moment correlation length (8) we compute
[TABLE]
The topological susceptibility is computed in an analogous fashion, taking into account the topological charge in the interior of the lattice. Details of the implementation are discussed below in section IV.2.
III The algorithms
In this section we discuss the update schemes that we use in our simulations. For our preliminary simulations with periodic boundary conditions in both directions and for the simulations with open boundary conditions in [math]-direction we use a hybrid of different local updates. In order to reduce the autocorrelation times of the topological susceptibility in the case of periodic boundary conditions in both directions, we employ a parallel tempering scheme raex ; SW86 . In the last part of this section we recall the definitions of the integrated and the exponential autocorrelation time and discuss how they can be determined from the data.
III.1 Basic local algorithms
As basic algorithm we use a hybrid of the Metropolis, the heatbath and the microcanonical overrelaxation algorithm. To a large extend, we follow section III of ref. campostrini . Let us first discuss the updates of the site variables and then the update of the gaugefields.
In an elementary step of the algorithm we update the variable at a single site , while keeping the gauge fields and the variables at all other sites fixed. The part of the action that depends on this site variable can be written as as
[TABLE]
where
[TABLE]
Note that the problem at this point is identical to the update of an invariant vector model with site variables of unit length. Instead of we would have to deal with the sum of the variables on the nearest neighbour sites. The microcanonical update keeps fixed, while the new value of has maximal distance from the old one. It is given by eq. (43a) of ref. campostrini :
[TABLE]
In addition to these updates, we have to perform updates that change the value of the action. To this end we implemented a heat-bath algorithm that is applied to the subset of three of the components of . The heatbath used here is identical to the one used in the simulation of the O(3)-Heisenberg model on the lattice or for the update of subgroups in the simulation of pure lattice gauge models CM82 ; Cr80 . We run through all components of taking the real and the complex part of the component as first two components for the heat-bath. The third component is randomly chosen among the real or complex parts of the remaining components of . Note that the CPU-time required by the microcanonical overrelaxation update is about one order of magnitude less than that for the heat-bath update.
For fixed variables the gaugefields can be updated independently of each other. The action reads
[TABLE]
where
[TABLE]
Here we performed a four hit Metropolis update, where the stepsize was chosen such that the acceptance rate is roughly , and a microcanonical update
[TABLE]
see eq. (43b) of campostrini .
In our standard simulations of lattices with periodic boundary conditions, we organized the elementary updates of site and link variables in the following way: First we sweep through the lattice in lexicographic order, updating the site variables by using the heat-bath algorithm. Then we update all link variables using the four hit Metropolis update. Next we sweep times through the lattice by using the microcanonical overrelaxation algorithm. Also here we go through the lattice in lexicographic order. For each sweep over the sites, microcanonical overrelaxation updates of the gaugefields are performed. In our simulations, we have chosen , which is for example the recommended choice for the simulation of the two-dimensional XY-model Guptaetal . The choices made in the design of our update scheme are based on a few preliminary simulations but still some ad hoc decisions are taken.
In the case of our simulations with open boundary conditions, we were aiming at the simulation of rather large correlation lengths and lattice sizes. Therefore, we parallelized the simulation program using the Message Passing Interface (MPI). For simplicity, we split the lattice in [math]-direction only. In order to simplify the parallelization, we used a checker-board decomposition of the lattice. First the variables on the odd sites are updated and than the ones on the even sites. Since odd sites have only even neighbours and vice versa, the updates on odd (even) only, can be done in parallel. Preliminary tests indicate that the ordering, lexicographical versus checker-board decomposed, has little influence on the autocorrelation times.
A measurement of the observables is performed after a heat-bath sweep and overrelaxation sweeps are completed.
III.2 Parallel tempering in a line defect
If one insists on specific boundary conditions in temporal direction that are different from open ones, parallel tempering or related methods might be an option to avoid the severe slowing down. Note that in ref. Vicari92 , simulated tempering with as parameter had been used in the simulation of the CPN-1 model; according to ref. Vicari04 “…, but apparently without achieving a particular advantage.” Since simulated tempering is closely related with parallel tempering we did not investigate parallel tempering in here. Instead, motivated by the nice results obtained by the simulations with open boundary conditions, see section IV.2 below, we consider parallel tempering restricted to a defect line. Let us sketch the idea: We expect that in the system with the defect line, the topological charge of a configuration is quickly changed by local updates. Then, via tempering, the configuration moves to the homogeneous system that we are interested in. The faster the configurations move from the bottom to the top of the parallel tempering chain, the more efficient is the algorithm.
In a preliminary study we introduced a sequence of systems that interpolate between open and periodic boundary conditions. Later we used instead a line defect, where the linear extension of the defect is smaller than the linear lattice size . The advantage is that less interpolating systems are needed for than for open boundary conditions. On the other hand, the smaller , the less topological objects can be created or destroyed in a unit of time. Below in section IV.3 we determine the optimal value of numerically. In order to define the interpolating systems, we generalize the action (1) to
[TABLE]
where for , and and else. In the case of open boundary conditions . labels the points of the tempering chain. In our simulations we take for simplicity a linear interpolation: . The homogeneous system corresponds to , while for the coupling along the defect line is completely eliminated. Since we have a configuration for each , we add an index to the field variables. In order to perform a swap of the configurations, only the contribution of the action at the defect , , has to be computed. To this end we define
[TABLE]
A swap of configurations between and is accepted with the probability
[TABLE]
In our simulations we run from up to in steps of one, proposing to swap the configurations at and . The number of replica is chosen such that the acceptance rate for the swap of configurations is larger than for all . In a tempering simulation, updates of the individual configurations, using for example the local Metropolis algorithm, alternate with swaps of the configurations. In a simulation with a global tempering parameter such as the temperature, one usually performs sweeps over the whole lattice in between swaps. In our case the tempering part of the action is localized. Furthermore, the correlation of with the field decays with the distance from the defect line. Therefore one might not necessarily always perform updates of all field variables between the swaps of configurations, allowing for a larger number of swaps for a given amount of CPU-time. To this end, we performed updates of the field variables on the sites and the gaugefields for a rectangle that is centred around the defect line. The linear extension of the rectangle is in 0-direction and in -direction. The index of indicates the level of our hierarchical update scheme. With increasing level , the size of the rectangle is reduced. Let us explain this update scheme by using a piece of pseudo-C code, representing a single cycle of the update scheme:
Sweeps over the full lattice; replica exchange; translation; for(i1=0;i1<n1;i1++) { Sweeps over box(l_1); replica exchange; translation; measure; for(i2=0;i2<n2;i2++) { Sweeps over box(l_2); replica exchange; translation; for(i3=0;i3<n3;i3++) { Sweep over box(l_3); replica exchange; translation; . . . until l_i = 1 } } ...}
In addition, in Fig. 1 we give a graphical representation of one update cycle. Let us go through the code step by step. “Sweeps over the full lattice” means that we perform one sweep over the whole lattice by using the heatbath update for the variables on the sites and the Metropolis update of the gaugefield. Then follow sweeps using the overrelaxation update of the variables on the sites as well as the gaugefields. “Sweeps over box(l_i)” means that we sweep over a rectangle characterized by . In particular for small values of we use a number of overrelaxation updates that is smaller than the one for sweeps over the whole lattice. In our numerical experiments we use throughout. is taken as an integer power of and roughly . “replica exchange” is the swap of configurations as discussed below eq. (26). An important ingredient of the update is the “translation”. Note that for we have restored the translational invariance of the system. Therefore we can shift the configuration for by a random distance in both directions. The idea is that topological objects are created or destroyed at any location in the lattice and need not to diffuse. Note that actively performing the translation would be computationally too expensive. Therefore we actually randomly chose a new location of the defect line for the system with . Performing swaps, we have to keep track of this location. In a preliminary study we switched off the translations. It turned out that the performance of the algorithm degrades markedly.
We performed no fine tuning of the parameters , , … . Instead we tried to balance the CPU-time needed for the different levels of the update scheme. For being the same for all levels , this means
[TABLE]
“measure” means a calculation of the observables discussed in section II.1. The measurement is only performed for the system , . In principle one would like to measure after each swap of configurations, since new configurations are shuffled to . However, since the measurement of the observables involve the field on the whole lattice, it costs more CPU-time than the updates at high levels of the update scheme. As a compromise, we perform the measurements along the update at level of our scheme. In our program we average over the measurements performed within one complete update cycle. These averages are written to the data file. In the analysis of our data, such a complete cycle is the unit of time in our Markov chain.
In order to compare with the standard update of the system with periodic boundary conditions, we have to take into account the additional effort. Ignoring that is not the same for all levels we arrive at the factor
[TABLE]
where is the number of replica and the number of levels of the update scheme.
We parallelized our program using the Message Passing Interface (MPI). To this end we distributed the configurations among the processes. As usual in parallel tempering simulations, we do not copy the configurations to new locations in memory. Instead the value of that is associated with the configurations is swapped.
III.3 Autocorrelation times
The performance of a Markov chain Monte Carlo algorithm is characterized by the autocorrelation time. There are different definitions of the autocorrelation time. These are based on the autocorrelation function. The autocorrelation function of an estimator is given by
[TABLE]
The modulus of the autocorrelation function is bounded from above by an exponentially decaying function. Following ref. Sokal we define
[TABLE]
and
[TABLE]
which characterizes the Markov chain. If the transition probabilities of the Markov chain satisfy detailed balance, the autocorrelation function is given by an exponential decay at large . Therefore it is useful to compute the effective autocorrelation time
[TABLE]
where , , … is the stride. With increasing it approaches . The integrated autocorrelation time of the estimator is given by
[TABLE]
The statistical error of the estimate of is
[TABLE]
where is the number of measurements and
[TABLE]
is the variance. Computing , we use the estimate of obtained from our simulation. Therefore the summation in eq. (33) has to be truncated at some finite . Since is falling off exponentially at large distances, the relative statistical becomes large at large distances. Therefore it is mandatory to truncate the summation at some point that is typically much smaller than the total length of the simulation. In the literature one can find various recommendations how this upper bound should be chosen. Sokal Sokal suggest to take , where the value of should be at least . Wolff Wolffless proposes to balance the statistical error with the systematic one that is due to the truncation of the sum.
In both cases it is assumed that the ratio is not too far from one. In systems like the one discussed here, this assumption is not satisfied for all observables. It turns out that can be associated with the topological modes. It can be cleanly observed in the topological susceptibility for example. However, it also enters into the autocorrelation function of other quantities like the susceptibility with a small amplitude. In such a situation, the rules of Sokal and Wolff are not suitable. In ref. Virotta the approach of ref. Wolffless was extend to take such a slow mode with a small amplitude explicitly into account.
IV Numerical results
In this section we present our numerical results. We study the performance of the algorithms, where we focus on the autocorrelation times of the topological susceptibility. First we discuss our standard simulations of systems with periodic boundary. Then we report the results for systems with open boundary conditions in [math]-direction. Finally we discuss our parallel tempering simulations of systems with periodic boundary conditions. We implemented the code in standard C and used the SIMD-oriented Fast Mersenne Twister algorithm twister as random number generator.
IV.1 Standard simulation of periodic boundary conditions
To set the scene, we performed preliminary simulations with periodic boundary conditions. We started with , where we compared with the extensive study presented in Flynnetal15 . Then we performed simulations for and . Note that the slowing down of the topological charge becomes more severe with increasing , see for example refs. Vicari92 ; campostrini ; Vicari04 .
IV.1.1 N=10
The values of and the lattice size were chosen to match a few of those of tables 6.2 and 6.3 of ref. Flynnetal15 . Note that the authors of ref. Flynnetal15 checked carefully for finite size effects. For the runs reported in tables 6.2 and 6.3 they have used a linear lattice size . Note that the authors of ref. Flynnetal15 used the over-heatbath algorithm petronzio ; campostrini , which is similar but not identical to the hybrid of heatbath and overrelaxation used here. We performed preliminary simulations at with various values of . It turns out that the performance has a quite shallow dependence on . At the end we took for our more extend run. For other values of we scaled proportional to the correlation length. Our numerical results are summarized in table 1. All simulations were started with an ordered configuration. For , we performed times one heatbath update and microcanonical overrelaxation updates along with the corresponding updates of the gaugefields. In the case of only such update cycles were performed. With increasing autocorrelation time, we discarded an increasing number of measurements at the beginning of the simulations. In the case of , we discarded measurements. Note that we performed a measurement after one sweep with the heatbath update and microcanonical overrelaxation updates. The integrated autocorrelation times are given in units of these measurement. While the integrated autocorrelation time of the topological susceptibility increases rapidly with increasing correlation length, the integrated autocorrelation times of the energy density and the magnetic susceptibility stay of order one. However one should note that in particular for the magnetic susceptibility there is a small overlap with . This is most significant for our largest value of . Using the program of ref. Virotta we find instead of , truncated at .
We tried to extract the exponential autocorrelation time from the autocorrelation function of the topological susceptibility. To this end we computed the effective autocorrelation time (32). In Fig. 2, as an example, we plot for . We see that rapidly approaches a plateau. The value that is approached at this plateau is consistent with . This means that the autocorrelation function of the topological susceptibility is given to a good approximation by a single exponential decay. This finding is consistent with the prediction based on the effective model given in ref. McGlMa14 . We checked that the same holds for any of the values of studied here. Furthermore we find analogous results for and .
In order to compare with ref. Flynnetal15 we multiply our values for by . In case of the topological susceptibility we find that our autocorrelation times are smaller by about a constant factor of . This means that the scaling with the correlation length should be the same. Note that in ref. Flynnetal15 results for coupling constants up to are given, where the second moment correlation length is and the integrated autocorrelation time of the topological susceptibility is .
IV.1.2 N=21
The authors of campostrini simulated the model using a hybrid of local Metropolis and microcanonical overrelaxation updates. They simulated up to , however only quote results for up to , where . In ref. Vicari92 results up to , where , are given. Note that in ref. Vicari92 simulated tempering in was used. In ref. Vicari04 the authors simulated the CPN-1 model with a Symanzik improved action by using a hybrid of local Metropolis and microcanonical overrelaxation updates. For they went up to a correlation length , where they find an integrated autocorrelation time of for the topological susceptibility. In the recent work Metadynamics , the metadynamics method was tested. As basic update algorithm the Hybrid-Monte-Carlo (HMC) algorithm HMC was used. By using the plain HMC algorithm, the authors were able to produce reliable estimates of the topological susceptibility up to , where . Employing the metadynamics method they could extend the range of the correlation length up to at , albeit the accuracy of their estimate at is moderate. For a discussion of the metadynamics method we refer the reader to ref. Metadynamics .
Our results are summarized in table 2. In our simulations for we used a smaller ratio as for to allow for more measurements. Throughout we used lattices of the linear size . Here still finite size effects can be seen at our level of statistical accuracy. However, this should be sufficient to study the scaling of the autocorrelation time of the topological susceptibility with the correlation length. For , , and we performed update cycles and the corresponding measurements. For , , and we performed only measurements. The number of discarded configurations increases with . In the case of we discarded the first measurements.
The integrated autocorrelation time increases rapidly with increasing correlation length. Fitting all data, we get with d.o.f.. Instead, fitting with the Ansatz with , as suggested in ref. Vicari04 , gives d.o.f..
We also performed simulations for larger values of . For we get a measurement of for the first time after 159201 update cycles. A sufficient equilibration is never reached in our run. In the case of , throughout our update cycles .
Our data are not good enough to decide on the functional form of the increase of with increasing correlation length. But it is clear that with standard algorithms and periodic boundary conditions it is practically impossible to get reliable results for the topological susceptibility for .
Later, as preliminary study for our simulations with open boundary conditions and parallel tempering, we performed additional simulations at for the linear lattice sizes , , , and . From the analysis of these simulations we conclude that for finite size effects can not be detected at our level of accuracy.
IV.1.3 N=41
First we performed simulations at for , , , , and to check for finite size effects. We took . Throughout we performed measurements. In the case of the energy density and the susceptibility, we find that the results are consistent among each other within the statistical error starting from . In the case of we see differences up to our largest lattice size. This is likely due to the corrections that are intrinsic to the definition (9) of . In the case of the topological susceptibility, we find that the results are consistent starting from . The same holds for the integrated autocorrelation time of the topological susceptibility. For we get . Extrapolating in , assuming corrections we arrive at at . Assuming scaling, we conclude that, similar to and , for finite size effects can be ignored at the level of our statistical accuracy.
Finally we performed simulations at , , , and with 100000 measurements each. For , the value of the topological susceptibility changed five times. For , , and it remained at zero throughout the whole simulation. We conclude that it is practically impossible to go beyond simulating periodic boundary conditions using standard Monte Carlo algorithms. For we find by interpolation of numerical results presented below . Note that in ref. Vicari92 could be reached, where .
IV.2 Open boundary conditions in [math]-direction
In our simulations, similar to lattice QCD, open boundary conditions are introduced to avoid the freezing of the topological charge in the simulation. The effects of the open boundary conditions on the observables are however unwanted. These effects decay exponentially fast with the distance from the boundaries. Therefore one discards the sites with a distance smaller than in the measurements of the observables. The value of is chosen such that the systematic error remains below a certain threshold. These systematical errors should be smaller than the statistical error that is reached in the simulations. Since the fraction of the lattice that is discarded should not be too large, one takes a few times . On the other hand, the diffusion of instantons from the boundary to the centre of the lattice requires more time with increasing . After a few preliminary simulations we fixed for all three values of . Furthermore we checked that is sufficient to avoid systematic errors that are larger than our statistical ones. In our simulations, we write an estimate of , eq. (16), , eq. (17), and for one value of for each measurement into the data file. After a few preliminary simulations we decided . These numbers are used to compute autocorrelation functions. In addition, we wrote the estimates of and the corresponding correlation function of the topological charge for each value to a file. Here we first averaged over , assuming that the dependence on is negligible. Furthermore, to reduce the amount of data, we binned 1000 measurements, writing the corresponding averages to the data file. This allows for a more flexible analysis of the data. In particular, we computed the effective correlation length
[TABLE]
and correspondingly . With increasing the effective correlation length approaches , which governs the asymptotic behaviour.
In order to reduce errors due to the truncation of the sum at in our estimates of the susceptibility and we added in eq. (16) the contribution
[TABLE]
and for eq. (17)
[TABLE]
which in fact improved the convergence of our estimates of and with increasing . For our final values of and we chose such that deviates from by a few permille.
We made attempts to fit our data for using a two-exponential Ansatz
[TABLE]
The results of such fits were not very convincing and we therefore do not report details. Very roughly our results are consistent with . For we tried to get an estimate for the ratio of amplitudes . We find , , and for , , and , respectively. Using these numbers, we computed for the Ansatz (39). This allows us to get an estimate for the deviation of from the asymptotic value . In order to balance with the statistical error, we are aiming at an error of about 2 permille. This is achieved for , , and for , , and , respectively.
In the case of the topological charge it turns out that the correlation function becomes negative for distances larger than zero. The modulus of the correlation function is decaying fast. This behaviour does not scale with the correlation length. For example for we find that the effective correlation length of the topological charge at distance increases from at up to at . On the other hand, the exponential correlation length is at and at . Furthermore the effective correlation length of the topological charge clearly increases with the distance. In our simulations we can not find a plateau. Therefore an extrapolation similar to eq. (37) is not useful in the case of the topological susceptibility. Instead we just truncate the summation at .
IV.2.1 N=10
In table 3 we summarize the parameters and a few basic results obtained from our simulations with open boundary conditions for . The values of and are chosen such that they match with a subset of those given in tables 6.2 and 6.3 of ref. Flynnetal15 . Throughout we started with ordered configurations. For up to we performed update cycles and measurements. For and we performed and update cycles, respectively. We discarded up to measurements for equilibration. The results for and are computed by using the extrapolations (37,38) with . The statistical errors of these quantities are computed by using the Jackknife method. Summing up to without extrapolation gives consistent results for the magnetic susceptibility. The error bars are slightly larger in this case. The results presented for the topological susceptibility are obtained by summing the correlation function of the topological charge up to . The statistical error depends on the choice of . For example for , which still might be considered as safe, the statistical error is smaller by a factor of up to .
Our results for , and are consistent with those of ref. Flynnetal15 . In the case of we find a small deviation that we attribute to the fact that different definitions are used. In the case of ref. Flynnetal15 the definition (9) is used, while we use eq. (8) along with eqs. (16,17).
Since in the case of open boundary conditions a different estimator of the topological susceptibility is used as for periodic boundary conditions, it is not sufficient to compare the integrated autocorrelation times of the simulations. Instead we define a performance index as the inverse of the square of the relative statistical error of the topological susceptibility divided by the number of the sweeps. In our case, the number of the sweeps is given by stat . Furthermore, we multiply by 4, to take the larger area of the lattice into account. Results for the performance index are summarized in table 4. At small values of , where the integrated autocorrelation time of the topological susceptibility is still small for periodic boundary conditions, the simulation with open boundary conditions is less efficient than that with periodic ones. At about we find roughly the same performance, while going to even lager values of , the open boundary conditions become more and more favourable. This comparison depends on the choice of in the case of open boundary conditions. Taking instead of we get an additional factor of up to in advantage of open boundary conditions.
Since for standard simulations with periodic boundary conditions are still feasible for a rather large correlation length, we could not demonstrate a really decisive advantage for open boundary conditions. The situation is different for the larger values of discussed below.
IV.2.2 N=21
In table 5 we summarize the parameters and a few basic results obtained from our simulations with open boundary conditions for . The analysis is performed in a similar fashion as for . Our results for , and are consistent with those given in tables A and B of ref. Metadynamics . The small difference in can be attributed to the different definitions that have been used. Note that for the authors of ref. Metadynamics find . Our result is fully consistent. However our error bar is smaller by a factor of 30.
In Fig. 3 we give the effective autocorrelation time of the topological susceptibility for and open boundary conditions. We computed also for different values of . We find that the behaviour of depends little on . For larger the values of scatter less.
For the value of still levels off reasonably well with increasing . We read off , which is similar to that we get from the simulation with periodic boundary conditions. For one would read off , which is well below that we find for periodic boundary conditions. For one can hardly spot a plateau. But it is quite plausible that we stay well below obtained for periodic boundary conditions. Starting from we can not find a plateau in the range that is plotted.
The other interesting observation is that for increasing the curves for seem to fall on top of each other for different values of . This means that slowing down is eliminated up to the increasing number of overrelaxation steps per measurement. Correspondingly we find that the integrated autocorrelation times given in table 3 stay roughly constant starting from . For we find an even smaller value of again. This is mainly due to the behaviour at large distances in the Markov chain. It is not clear to us, whether this is of significance.
Following the model for the diffusion of instantons in the lattice presented in ref. McGlMa14 , the autocorrelation function takes the form
[TABLE]
when the dynamics of the instantons is dominated by diffusion. We made no attempt to work out the coefficient based on the diffusion model. In Fig. 3 we plot as dashed line the effective autocorrelation time computed from eq. (40), where we took and . There is a reasonable match with obtained from the data for for .
Finally, in Fig. 4 we compare the integrated autocorrelation of the topological susceptibility for open and periodic boundary conditions in [math]-direction. The numbers are taken from table 2 and 5, respectively. As already discussed in section IV.1, the autocorrelation time seems to increase exponentially with the correlation length in the case of periodic boundary conditions. Instead, for open boundary conditions, we first see an increase that is similar to that with periodic boundary conditions. Then, at the autocorrelation time levels off. The difference between open and periodic boundary conditions for smaller values of is mainly due to the fact that different estimators of the topological susceptibility are used. The behaviour in the case of open boundary conditions can be explained along the lines of ref. McGlMa14 . For changes of the topological charge are dominantly due to the creation and destruction of instantons in the bulk. Then for the diffusion from and to the boundaries completely dominates. This diffusion is not effected by the severe slowing down.
IV.2.3 N=41
In table 6 we summarize the parameters and a few basic results obtained from our simulations with open boundary conditions for . Note that all four values of are in the range, where standard simulations with periodic boundary conditions show topological freezing. We abstain from a detailed discussion of the simulations, since the findings are very similar to those for .
Note that the integrated autocorrelation times of the topological susceptibility are only slightly larger than those for and .
IV.3 Periodic boundary conditions: parallel tempering
IV.3.1 N=10
We started our numerical experiments with open boundary conditions. We performed simulations at , where the autocorrelation time of the topological susceptibility is already large. We have chosen as linear size of the lattice. We performed a number of preliminary simulations to get an idea how the parameters of the update scheme should be chosen. Let us report the details of our final choice. The number of replica is . We performed 6000 update cycles. For swaps between and this gives an acceptance rate of about and drops to a bit more than for the pair and . Then it increases again up to a little less than for and . We have taken and , as parameters of the cycle. As in the simulations with open boundary conditions, we used for the sweeps over the whole lattice. For levels and we used , and , respectively. Here we performed measurements along with the updates at level 4 of the update cycle.
The efficiency of the parallel tempering algorithm can be characterized by the round trip time. This means that one follows the configurations on their way through the parameter of the tempering scheme. Based on this, one computes the average time that is needed to go from one end of the chain to the other. In our simulations, we followed only a single configuration to reduce the amount of data that is generated. For the same reason, the position of the configuration is recorded only once per cycle. This way, we might miss arrivals of the configuration at the top or the bottom of the tempering chain. Therefore we just computed the integrated autocorrelation time of the position. As average position in the chain we get , which is in reasonable agreement with the exact result . The integrated autocorrelation is , indicating that the configurations are indeed shuffled through the tempering chain within a few update cycles. Note that within one cycle 379 swap updates of the configurations are performed.
In the analysis of the data we discarded the first 1000 update cycles. We get and for the energy and the susceptibility, respectively. For these two observables the autocorrelation almost vanishes. The integrated autocorrelation times are and , respectively. For the topological susceptibility we get and . These numbers can be compared with , and given in table 6.3 of ref. Flynnetal15 and , and obtained in our simulation with open boundary conditions presented in section IV.2.1 above. Taking into account the reduced number of at higher levels of the update scheme, the numerical cost of this run is by a factor of less than that of our simulation for with open boundary conditions. This means that, looking only at the topological susceptibility, there is a small advantage for the parallel tempering run.
Next we studied . The disadvantage of this choice is that less topological objects can be created or destroyed in a unit of time. On the other hand smaller values of should be sufficient to give reasonable acceptance rates for the swaps of configurations between different . This is in particular important with regard to the application to lattice QCD. In addition to saving memory space, smaller values of should also allow for smaller round trip times. After a few preliminary simulations, where we mainly determined acceptance rates for the swaps of configurations, we performed extended simulations for , and defect lines characterized by , and . The number of replica is in all three cases. The update scheme is characterized by in all three cases and , , and for , , and for , and , and for . In total we performed 25000, 60000, and 42000 update cycles for , , and , respectively. For the acceptance rate is about for the pair and . It drops to for and and goes slightly up again to for and . For the acceptance rate is about for the pair and . It drops to for and and increases again to for and . For the acceptance rate is about for the pair and . It drops to for and and increases again to for and . As expected, for fixed the acceptance rates for the swaps of configurations decrease with increasing length of the defect line. Preliminary runs and the run with open boundary conditions suggest that
[TABLE]
gives an acceptance rate that is roughly constant in . In these simulations we have written the value of for one given configuration to the file when performing the update at level 2. This way translational invariance in Monte Carlo time is lost. In the following analysis we shall ignore this fact when computing autocorrelation times of the position. In units of complete cycles, we get , and for , , and , respectively. This means that within a single cycle configurations move several times from the top to the bottom of the tempering chain. For the topological susceptibility we get , , and , respectively. The integrated autocorrelation times of the topological susceptibility are , , and , respectively. We see no sharp dependence of the performance on . The best performance is achieved for , suggesting that is a good choice. Our run with is clearly outperformed by .
IV.3.2
Here we performed simulations at , , and , where standard simulations fail to equilibrate. The parameters of our simulations and the numerical results for the energy density, the magnetic susceptibility and the topological susceptibility are summarized in table 7. We performed 200000, 200000, 141800, and 50370 update cycles, respectively. Let us discuss the simulation at in more detail. The update cycle is characterized by , , and . The number of overrelaxation updates per cycle is , , , , , and at levels , , , , , and , respectively. The acceptance rates for the swaps of configurations behave similar to the case. We find that the acceptance rate is about for the pair and . It drops to for the pair and . Then it increases again to for the pair and . The integrated autocorrelation time of the position of a selected configuration is . Remember that we always write to the file at level 2 of the update cycle, which means 72 times per cycle in the present case. The simulation took 25 days on a 4 core PC running with 8 threads. This is about the same CPU time that is used for the corresponding run with open boundary conditions. The error bar of the topological susceptibility is smaller by a factor of compared with the simulation with open boundary conditions.
IV.3.3
Finally we performed a simulation for at , which is the largest value of that we simulated with open boundary conditions. We simulated a lattice with and . Performing 200000 update cycles, we get , , and . Also here we find that the parallel tempering simulation is more efficient than the simulation with open boundary conditions by a factor of about when focussing on the topological susceptibility.
V Physics results and comparison with the large -expansion
Finally we try to extract results for the continuum limit from our data and compare these with predictions obtained from the -expansion ML78 ; CaRo91 ; CaRo93 . For the correlation length and the susceptibility we shall use the data obtained from our simulations with open boundary conditions. In the case of the topological susceptibility we use the results obtained from our simulations with parallel tempering when available and the results obtained from our simulations with open boundary conditions otherwise.
Let us first consider the ratio of second moment and the exponential correlation length. Our numerical results are presented in Fig. 5. For all values of that we studied, no clear dependence on can be seen. Our final results are , and for , and , respectively. These were obtained by averaging all results for . The quoted error takes into account the statistical error as well as the systematical two permille error of . Our results are consistent with those given in tables X and XV of ref. campostrini . Following ref. CaRo91
[TABLE]
Our results obtained for , and are still quite far from this asymptotic value. Therefore we abstain from estimating the coefficient of the corrections.
Next we study the relation between the topological susceptibility and the correlation length. The product should have a finite continuum limit. For the exponential correlation length the -expansion gives ML78
[TABLE]
For the second moment correlation length a faster convergence with increasing is obtained CaRo91
[TABLE]
In Fig. 6 we plot as a function of . Looking at the figure, the numerical data seem to converge nicely to the scaling limit. Corrections to scaling seem to be smaller for larger values of . Taking simply the largest values of for each we get , and for , and , respectively. This can be compared with results quoted in the literature. For one finds for example and in refs. Flynnetal15 ; Vicari04 , respectively. For one finds and in refs. Vicari04 ; Vicari92 , respectively. For we find in ref. Vicari92 the results and for and , respectively. Our estimates are essentially consistent with those presented in the literature. In particular for large values of , we improved the accuracy of the estimates. To see the effect of leading corrections, it is useful to multiply by . Using our numbers, we get , , and for , , and , respectively. As already discussed in ref. Vicari04 it is a bit puzzling that the numbers suggest a correction with the opposite sign as that of eq. (44).
In refs. campostrini ; Vicari92 the ratio , which is related to the renormalization of the composite operator , is discussed. Following eq. (8) of the preprint version of ref. Vicari92
[TABLE]
with
[TABLE]
In Fig. 7 we plot as a function of . The estimates seem to converge with increasing . However fitting the data with Ansätze that contain and corrections show that reliable estimates for the limit can hardly be obtained. Note that our data cover only a rather small range of . Fits with only, give large values of d.o.f. . Adding a correction, the quality of the fit improves and the amplitude of the correction becomes negative. As a result, the estimate of obtained from these two Ansätze differ strongly. Hence we refrain from giving a final result. In order to get reliable results, a larger range in has to be covered. To this end, finite size scaling approaches as discussed in refs. running ; CaEdFePeSo95 are needed. In order to get a rough idea how our numerical results compare with those of the expansion, we give in Fig. 7 the estimates of as dashed lines. Given the fact that the extrapolation of our data to is difficult and in the expansion are not known, the numerical data and the results of the expansion seem to be consistent.
The asymptotic scaling behaviour of the correlation length is governed by the -function. In particular
[TABLE]
where the two-loop -function implies
[TABLE]
In Fig. 8 we plot our numerical results for . Also here one expects that corrections vanish with powers of . Therefore it is virtually impossible to extrapolate our numerical results to . To overcome this problem, finite size scaling methods as discussed in refs. running ; CaEdFePeSo95 are needed.
Despite this problem let us compare our estimates with the predictions of the -expansion. Following ref. CaRo92 , for the explicit number of the coefficient see eq. (65) of ref. VicariRossi93 ,
[TABLE]
In Fig. 8 we give the values as dashed lines. Our numerical results seem to be consistent with that of the expansion.
VI Summary and conclusions
We have studied the CPN-1 model on a square lattice for and . The CPN-1 model has served as a toy model of QCD, since it shares fundamental properties with QCD. Here we are concerned with severe slowing related with topological modes that plagues Monte Carlo simulations of the two-dimensional model as well as lattice QCD.
As basic update algorithm we used a hybrid of the local heat-bath algorithm and the overrelaxation algorithm. First we confirmed that standard simulations of systems with periodic boundary conditions in both direction suffer from a severe slowing down. The autocorrelation time of the topological susceptibility seems to increase exponentially with the correlation length. This problem becomes more severe with increasing . The rapid increase of means that for a given CPU budget there is a quite sharp bound for the correlation length that can be reached by simulations. In our case for , , and , respectively.
In order to fight the problem we followed two different strategies. First we tested the proposal of ref. LuSc11 . By using open boundary conditions in temporal direction, the problem of disconnected sectors in configuration space is solved by brute force. A nice feature of this approach is that it should work quite independently on the Monte Carlo algorithm that is used for the simulation. The proposal has been tested before at the example of lattice QCD in ref. LuSc11 ; McGlMa14 and is used now in large scale simulations of lattice QCD. Here we just intend to consolidate the findings. Simulating the two-dimensional toy model, high statistical accuracy can be reached and a larger range of the correlation length can be studied. In the case of it is hard to demonstrate a clear cut advantage for the open boundary conditions, since still with periodic boundary conditions a correlation length of a bit more than 20 can be reached. Going to the situation becomes more clear. In this case we could obtain accurate results for the topological susceptibility by using open boundary conditions for values of , where standard simulations with periodic boundary conditions completely fail. While autocorrelation times are large in this range, slowing down is compatible with , which is typical for the overrelaxation algorithm. Our simulations for affirm the findings for . The results obtained here for open boundary conditions might well serve as benchmark for new algorithmic ideas.
Furthermore we tested parallel tempering using a line defect. To this end we introduced a sequence of systems that interpolate between a system, where the coupling is completely switched off along a line of length and a homogeneous system with periodic boundary conditions. For we recover open boundary conditions. Using it turns out that a quite large number of interpolating systems is needed to get reasonable acceptance rates in the swaps of configurations between adjacent systems. It turns out that is a good choice. We introduced an hierarchical update scheme, where sublattices of varying size that are centred around the defect are updated in between swaps of configurations. Focussing on the statistical error of the topological susceptibility, the parallel tempering simulation with periodic boundary conditions outperforms the standard simulation with open boundary conditions by a small factor. The parallel tempering of the line defect has a number of free parameters. Here we fixed most of them by using simple guiding lines. We expect that by fine tuning the performance could be improved by a small factor. This however would require a considerable effort. The more interesting question that we like to attack next is, whether the parallel tempering in a defect structure is helpful in lattice QCD. In particular going to dynamical fermions, the non-local pseudo-fermion action could be an obstacle. Here the combination of domain decomposition LuescherDD with the multi-boson algorithm LuescherMB , as discussed in ref. Giustietal , could be a solution.
Based on our simulations we obtained accurate estimates for , , and for , , and , respectively. As already pointed out in ref. Vicari04 , these results seem to be at odds with the correction to the large -limit given in ref. CaRo91 .
VII Acknowledgement
I thank Stefan Schaefer for discussions. This work was supported by the Deutsche Forschungsgemeinschaft (DFG) under the grant No HA 3150/4-1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) D. D’Adda, M. Lüscher, and P. Di Vicchia, A 1 / N 1 𝑁 1/N expandable series of non-linear σ 𝜎 \sigma -models with instantons , Nucl. Phys. B 146 , 63 (1978).
- 2(2) E. Witten, Instantons, the quark model, and the 1 / N 1 𝑁 1/N expansion , Nucl. Phys. B 149 , 285 (1979).
- 3(3) M. Campostrini, P. Rossi, and E. Vicari, Monte Carlo Simulations of CP N-1 models , Phys. Rev. D 46 , 2647 (1992).
- 4(4) L. Del Debbio, G. M. Manca, and E. Vicari, Critical slowing down of topological modes , [ar Xiv:hep-lat/0403001], Phys. Lett. B 594 , 315 (2004).
- 5(5) J. Flynn, A. Jüttner, A. Lawson, and F. Sanfilippo, Precision study of critical slowing down in lattice simulations of the CP N-1 model , [ar Xiv:1504.06292].
- 6(6) E. Marinari and G. Parisi, Simulated Tempering: A New Monte Carlo Scheme , [ar Xiv:hep-lat/9205018], Europhys. Lett. 19 , 451 (1992).
- 7(7) E. Vicari, Monte Carlo simulation of lattice CP N-1 models at large N 𝑁 N , [hep-lat/9209025], Phys. Lett. B 309 , 139 (1993).
- 8(8) G. P. Engel and S. Schaefer, Testing trivializing maps in the Hybrid Monte Carlo algorithm , [ar Xiv:1102.1852], Comput. Phys. Commun. 182 , 2107 (2011).
