Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic connectivity algorithms for Monte Carlo simulations of the
  random-cluster model   We review Sweeny's algorithm for Monte Carlo simulations of the random
cluster model. Straightforward implementations suffer from the problem of
computational critical slowing down, where the computational effort per edge
operation scales with a power of the system size. By using a tailored dynamic
connectivity algorithm we are able to perform all operations with a
poly-logarithmic computational effort. This approach is shown to be efficient
in keeping online connectivity information and is of use for a number of
applications also beyond cluster-update simulations, for instance in monitoring
droplet shape transitions. As the handling of the relevant data structures is
non-trivial, we provide a Python module with a full implementation for future
reference.

0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
17
The categories of this paper are: q-fin
13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex