2 problems

Let $G=(V,E)$ be a simple connected graph with $n=|V|$ vertices, and let $r$ denote its assortativity coefficient, defined by … where $m=|E|$, and $d_u$ is the degree of vertex $u$…

Let $r_n$ be the Pearson assortativity coefficient of the configuration model in the scale-free regime $1<\gamma<2$. Scaling Pearson conjecture. As $n\to\infty$, there exists a ran…