On the number of non-zero elements of joint degree vectors (Q521382): Difference between revisions

Summary: Joint degree vectors give the number of edges between vertices of degree \(i\) and degree \(j\) for \(1\leq i\leq j\leq n-1\)~in an \(n\)-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector as a function of \(n\). This provides an upper bound on the number of estimable parameters in the exponential random graph model with bidegree-distribution as its sufficient statistics.