Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A stopping criterion for Markov chains when generating independent
  random graphs   Markov chains are convenient means of generating realizations of networks
with a given (joint or otherwise) degree distribution, since they simply
require a procedure for rewiring edges. The major challenge is to find the
right number of steps to run such a chain, so that we generate truly
independent samples. Theoretical bounds for mixing times of these Markov chains
are too large to be practically useful. Practitioners have no useful guide for
choosing the length, and tend to pick numbers fairly arbitrarily. We give a
principled mathematical argument showing that it suffices for the length to be
proportional to the number of desired number of edges. We also prescribe a
method for choosing this proportionality constant. We run a series of
experiments showing that the distributions of common graph properties converge
in this time, providing empirical evidence for our claims.

37
The categories of this paper are: supr-con
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
2
The categories of this paper are: math
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex