Generating Maximally Disassortative Graphs with Given Degree Distribution
Published Online:31 Jan 2018https://doi.org/10.1287/stsy.2017.0006
Abstract
We present an algorithm that solves the problem of generating graphs, with a given degree distribution, that are maximally disassortative (with respect to Spearman’s rank correlation). As a result, we obtain a general lower bound for Spearman’s rho on graphs, which depends on the distribution of the probability mass between the head and tail of the size-biased degree distribution.
