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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
|
#include "cluster.h"
v_t flip_cluster_dgm(dgm_state_t *s, v_t v0, h_t rot, gsl_rng *r) {
v_t nv = 0;
ll_t *stack = NULL; // create a new stack
stack_push(&stack, v0); // push the initial vertex to the stack
bool *marks = (bool *)calloc(s->g->nv, sizeof(bool));
while (stack != NULL) {
v_t v = stack_pop(&stack);
if (!marks[v]) {
h_t s_old, s_new;
dihinf_t *R_new;
bool external_flipped;
marks[v] = true;
if (v == s->g->nv - 1) {
R_new = dihinf_compose(rot, s->R);
external_flipped = true;
} else {
s_old = s->spins[v];
s_new = dihinf_act(rot, s_old);
external_flipped = false;
}
v_t nn = s->g->v_i[v + 1] - s->g->v_i[v];
for (v_t i = 0; i < nn; i++) {
h_t sn;
double prob;
bool external_neighbor = false;
v_t vn = s->g->v_adj[s->g->v_i[v] + i];
if (vn == s->g->nv - 1) {
external_neighbor = true;
} else {
sn = s->spins[vn];
}
if (external_flipped || external_neighbor) {
h_t rot_s_old, rot_s_new;
if (external_neighbor) {
rot_s_old = dihinf_inverse_act(s->R, s_old);
rot_s_new = dihinf_inverse_act(s->R, s_new);
} else {
rot_s_old = dihinf_inverse_act(s->R, sn);
rot_s_new = dihinf_inverse_act(R_new, sn);
}
double dE = s->H(s->H_info, rot_s_old) - s->H(s->H_info, rot_s_new);
prob = 1.0 - exp(-dE / s->T);
s->M += rot_s_new - rot_s_old;
s->E += dE;
} else {
double dE = (s->J)(s_old - sn) - (s->J)(s_new - sn);
prob = 1.0 - exp(-dE / s->T);
s->E += dE;
}
if (gsl_rng_uniform(r) < prob) { // and with probability ps[e]...
stack_push(&stack, vn); // push the neighboring vertex to the stack
}
}
if (external_flipped) {
free(s->R);
s->R = R_new;
} else {
s->spins[v] = s_new;
}
if (v != s->g->nv - 1) { // count the number of non-external sites that flip
nv++;
}
}
}
free(marks);
return nv;
}
v_t flip_cluster_vector(vector_state_t *s, v_t v0, double *rot, gsl_rng *r) {
v_t nv = 0;
ll_t *stack = NULL; // create a new stack
stack_push(&stack, v0); // push the initial vertex to the stack
//node_t *T = NULL;
bool *marks = (bool *)calloc(s->g->nv, sizeof(bool));
while (stack != NULL) {
v_t v = stack_pop(&stack);
// if (!tree_contains(T, v)) { // if the vertex hasn't already been flipped
if (!marks[v]) {
bool v_is_external = false;
double *s_old, *s_new, *R_tmp;
if (v == s->g->nv - 1) {
v_is_external = true;
}
//tree_insert(&T, v);
marks[v] = true;
if (v == s->g->nv - 1) {
R_tmp = orthogonal_rotate(s->n, rot, s->R);
} else {
s_old = &(s->spins[s->n * v]); // don't free me! I'm a pointer within array s->spins
s_new = vector_rotate(s->n, rot, s_old); // free me! I'm a new vector
}
v_t nn = s->g->v_i[v + 1] - s->g->v_i[v];
for (v_t i = 0; i < nn; i++) {
v_t vn = s->g->v_adj[s->g->v_i[v] + i];
bool vn_is_external = false;
if (vn == s->g->nv - 1) {
vn_is_external = true;
}
double *sn;
if (!vn_is_external) {
sn = &(s->spins[s->n * vn]);
}
double prob;
if (v_is_external || vn_is_external) {
double *rs_old, *rs_new;
if (vn_is_external) {
rs_old = vector_rotate_inverse(s->n, s->R, s_old);
rs_new = vector_rotate_inverse(s->n, s->R, s_new);
} else {
rs_old = vector_rotate_inverse(s->n, s->R, sn);
rs_new = vector_rotate_inverse(s->n, R_tmp, sn);
}
double dE = s->H(s->n, s->H_info, rs_old) - s->H(s->n, s->H_info, rs_new);
prob = 1.0 - exp(-dE / s->T);
vector_subtract(s->n, s->M, rs_old);
vector_add(s->n, s->M, rs_new);
s->E += dE;
free(rs_old);
free(rs_new);
} else {
double dE = (s->J)(vector_dot(s->n, sn, s_old)) - (s->J)(vector_dot(s->n, sn, s_new));
prob = 1.0 - exp(-dE / s->T);
s->E += dE;
}
if (gsl_rng_uniform(r) < prob) { // and with probability ps[e]...
stack_push(&stack, vn); // push the neighboring vertex to the stack
}
}
if (v == s->g->nv - 1) {
free(s->R);
s->R = R_tmp;
} else {
vector_replace(s->n, s_old, s_new);
free(s_new);
}
if (v != s->g->nv - 1) { // count the number of non-external sites that flip
nv++;
}
}
}
//tree_freeNode(T);
free(marks);
return nv;
}
/*G
template <class R_t, class X_t>
v_t flip_cluster(state_t <R_t, X_t> *state, v_t v0, R_t *r, gsl_rng *rand) {
v_t nv = 0;
ll_t *stack = NULL; // create a new stack
stack_push(&stack, v0); // push the initial vertex to the stack
bool *marks = (bool *)calloc(state->g->nv, sizeof(bool));
while (stack != NULL) {
v_t v = stack_pop(&stack);
if (!marks[v]) {
X_t *si_old, *si_new;
R_t *s0_old, *s0_new;
si_old = state->s[v];
s0_old = state->s0;
marks[v] = true;
if (v == state->g->nv - 1) {
s0_new = act <R_t, R_t> (r, s0_old);
} else {
si_new = act <R_t, X_t> (r, si_old);
}
v_t nn = state->g->v_i[v + 1] - state->g->v_i[v];
for (v_t i = 0; i < nn; i++) {
v_t vn = state->g->v_adj[state->g->v_i[v] + i];
X_t *sj;
if (vn != state->g->nv - 1) {
sj = state->s[vn];
}
double prob;
bool is_ext = (v == state->g->nv - 1 || vn == state->g->nv - 1);
if (is_ext) {
X_t *rs_old, *rs_new;
if (vn == state->g->nv - 1) {
rs_old = inverse_act <class R_t, class X_t> (s0_old, si_old);
rs_new = inverse_act <class R_t, class X_t> (s0_old, si_new);
} else {
rs_old = inverse_act <class R_t, class X_t> (s0_old, sj);
rs_new = inverse_act <class R_t, class X_t> (s0_new, sj);
}
double dE = state->B(rs_old) - state->B(rs_new);
prob = 1.0 - exp(-dE / state->T);
update_magnetization <X_t> (state->M, rs_old, rs_new);
state->E += dE;
free_X <X_t> (rs_old);
free_X <X_t> (rs_new);
} else {
double dE = state->Z(si_old, sj) - state->Z(si_new, sj);
prob = 1.0 - exp(-dE / state->T);
state->E += dE;
}
if (gsl_rng_uniform(rand) < prob) { // and with probability...
stack_push(&stack, vn); // push the neighboring vertex to the stack
}
}
if (v == state->g->nv - 1) {
free_R <R_t> (state->s0);
state->s0 = s0_new;
} else {
free_X <X_t> (state->s[v]);
state->s[v] = si_new;
}
if (v != state->g->nv - 1) { // count the number of non-external sites that flip
nv++;
}
}
}
free(marks);
return nv;
}
*/
|
