On the number of non-zero elements of joint degree vectors (Q521382)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6703747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of non-zero elements of joint degree vectors |
scientific article; zbMATH DE number 6703747 |
Statements
On the number of non-zero elements of joint degree vectors (English)
0 references
10 April 2017
0 references
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.
0 references
degree sequence
0 references
joint degree distribution
0 references
joint degree vector
0 references
joint degree matrix
0 references
exponential random graph model
0 references
0 references
0.7466533184051514
0 references
0.7429381608963013
0 references
0.7184877991676331
0 references
0.7165071964263916
0 references
0.7158874273300171
0 references
