Name
Abstract | ||
|---|---|---|
Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le 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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.17863/CAM.9500 | Electronic Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Degree (graph theory),Exponential random graph models,Mathematics | Journal | 24 |
Issue | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
5 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eva Czabarka | 1 | 50 | 10.82 |
| Johannes Rauh | 2 | 152 | 16.63 |
| Kayvan Sadeghi | 3 | 0 | 0.34 |
| Taylor Short | 4 | 0 | 0.34 |
| Laszlo Szekely | 5 | 16 | 3.94 |