On the Number of Non-zero Elements of Joint Degree Vectors
Czabarka, Eva · Rauh, Johannes · Sadeghi, Kayvan · Short, Taylor · Szekely, Laszlo A
Original · EN
Joint degree vectors give the number of edges between vertices of degree i and degree j for 1≤ i≤ j≤ 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.