1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
#pragma once
#include <gsl/gsl_randist.h>
#include <gsl/gsl_rng.h>
#include <cmath>
#include <vector>
#include <stack>
#include "types.h"
#include "state.h"
#include "graph.h"
template <class R_t, class X_t>
void flip_cluster(state_t <R_t, X_t> *state, v_t v0, R_t r, gsl_rng *rand) {
v_t nv = 0;
std::stack<v_t> stack;
stack.push(v0);
std::vector<bool> marks(state->g.nv, false);
while (!stack.empty()) {
v_t v = stack.top();
stack.pop();
if (!marks[v]) {
X_t si_old, si_new;
R_t R_old, R_new;
R_old = state->R;
marks[v] = true;
bool v_is_ghost = (v == state->nv);
if (v_is_ghost) {
R_new = r.act(R_old);
} else {
si_old = state->spins[v];
si_new = r.act(si_old);
}
for (const v_t &vn : state->g.v_adj[v]) {
X_t sj;
bool vn_is_ghost = (vn == state->nv);
if (!vn_is_ghost) {
sj = state->spins[vn];
}
double prob;
if (v_is_ghost || vn_is_ghost) {
X_t rs_old, rs_new;
v_t non_ghost;
if (vn_is_ghost) {
rs_old = R_old.act_inverse(si_old);
rs_new = R_old.act_inverse(si_new);
non_ghost = v;
} else {
rs_old = R_old.act_inverse(sj);
rs_new = R_new.act_inverse(sj);
non_ghost = vn;
}
double dE = state->H(rs_old) - state->H(rs_new);
#ifdef FINITE_STATES
prob = H_probs[state_to_ind(rs_old)][state_to_ind(rs_new)];
#else
prob = 1.0 - exp(-dE / state->T);
#endif
state->M -= rs_old;
state->M += rs_new;
state->E += dE;
for (D_t i = 0; i < state->D; i++) {
L_t x = (non_ghost / (v_t)pow(state->L, state->D - i - 1)) % state->L;
state->ReF[i] -= rs_old * state->precomputed_cos[x];
state->ReF[i] += rs_new * state->precomputed_cos[x];
state->ImF[i] -= rs_old * state->precomputed_sin[x];
state->ImF[i] += rs_new * state->precomputed_sin[x];
}
} else {
double dE = state->J(si_old, sj) - state->J(si_new, sj);
#ifdef FINITE_STATES
prob = J_probs[state_to_ind(si_old)][state_to_ind(si_new)][state_to_ind(sj)];
#else
prob = 1.0 - exp(-dE / state->T);
#endif
state->E += dE;
}
if (gsl_rng_uniform(rand) < prob) { // and with probability...
stack.push(vn); // push the neighboring vertex to the stack
}
}
if (v_is_ghost) {
state->R = R_new;
} else {
state->spins[v] = si_new;
nv++;
}
}
}
state->last_cluster_size = nv;
}
|
