<s>
In	O
statistical	O
physics	O
,	O
Glauber	B-Algorithm
dynamics	I-Algorithm
is	O
a	O
way	O
to	O
simulate	O
the	O
Ising	O
model	O
(	O
a	O
model	O
of	O
magnetism	O
)	O
on	O
a	O
computer	O
.	O
</s>
<s>
It	O
is	O
a	O
type	O
of	O
Markov	B-General_Concept
Chain	I-General_Concept
Monte	I-General_Concept
Carlo	I-General_Concept
algorithm	O
.	O
</s>
<s>
Metropolis	B-Algorithm
–	I-Algorithm
Hastings	I-Algorithm
algorithm	I-Algorithm
gives	O
identical	O
results	O
as	O
Glauber	O
algorithm	O
does	O
,	O
but	O
it	O
is	O
faster	O
.	O
</s>
<s>
In	O
the	O
Metropolis	B-Algorithm
algorithm	I-Algorithm
,	O
selecting	O
a	O
spin	O
is	O
deterministic	O
.	O
</s>
<s>
In	O
practice	O
,	O
the	O
main	O
difference	O
between	O
the	O
Metropolis	B-Algorithm
–	I-Algorithm
Hastings	I-Algorithm
algorithm	I-Algorithm
and	O
with	O
Glauber	O
algorithm	O
is	O
in	O
choosing	O
the	O
spins	O
and	O
how	O
to	O
flip	O
them	O
(	O
step	O
4	O
)	O
.	O
</s>
<s>
In	O
general	O
,	O
at	O
equilibrium	O
,	O
any	O
MCMC	B-General_Concept
algorithm	O
should	O
produce	O
the	O
same	O
distribution	O
,	O
as	O
long	O
as	O
the	O
algorithm	O
satisfies	O
ergodicity	O
and	O
detailed	O
balance	O
.	O
</s>
<s>
Therefore	O
,	O
both	O
,	O
Glauber	O
and	O
Metropolis	B-Algorithm
–	I-Algorithm
Hastings	I-Algorithm
algorithms	I-Algorithm
exhibit	O
detailed	O
balance	O
.	O
</s>
<s>
Simulation	O
package	O
IsingLenzMC	O
provides	O
simulation	O
of	O
Glauber	B-Algorithm
Dynamics	I-Algorithm
on	O
1D	O
lattices	O
with	O
external	O
field	O
.	O
</s>
