Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Central limit theorems for combinatorial optimization problems on sparse
  Erd\H{o}s-R\'enyi graphs   For random combinatorial optimization problems, there has been much progress
in establishing laws of large numbers and computing limiting constants for the
optimal value of various problems. However, there has not been as much success
in proving central limit theorems. This paper introduces a method for
establishing central limit theorems in the sparse graph setting. It works for
problems which display a key property which has been variously called
"endogeny", "long-range independence", and "replica symmetry" in the
literature. Examples of such problems are maximum weight matching,
$\lambda$-diluted minimum matching, and optimal edge cover.

22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph