Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Generating maximally disassortative graphs with given degree
  distribution   In this paper we consider the optimization problem of generating graphs with
a prescribed degree distribution, such that the correlation between the degrees
of connected nodes, as measured by Spearman's rho, is minimal. We provide an
algorithm for solving this problem and obtain a complete characterization of
the joint degree distribution in these maximally disassortative graphs, in
terms of the size-biased degree distribution. As a result we get a lower bound
for Spearman's rho on graphs with an arbitrary given degree distribution. We
use this lower bound to show that for any fixed tail exponent, there exist
scale-free degree sequences with this exponent such that the minimum value of
Spearman's rho for all graphs with such degree sequences is arbitrary close to
zero. This implies that specifying only the tail behavior of the degree
distribution, as is often done in the analysis of complex networks, gives no
guarantees for the minimum value of Spearman's rho.

21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph