On the number of non-zero elements of joint degree vectors
dc.creator | Czabarka, É | |
dc.creator | Sadeghi, Kayvan | |
dc.creator | Rauh, J | |
dc.creator | Short, T | |
dc.creator | Székely, L | |
dc.date.accessioned | 2017-02-24 | |
dc.date.accessioned | 2018-11-24T23:27:10Z | |
dc.date.available | 2017-05-08T13:45:57Z | |
dc.date.available | 2018-11-24T23:27:10Z | |
dc.date.issued | 2017-03-31 | |
dc.identifier | https://www.repository.cam.ac.uk/handle/1810/264143 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/3959 | |
dc.description.abstract | 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. | |
dc.language | en | |
dc.publisher | Electronic Journal of Combinatorics | |
dc.publisher | The Electronic Journal of Combinatorics | |
dc.subject | degree sequence | |
dc.subject | joint degree distribution | |
dc.subject | joint degree vector | |
dc.subject | joint degree matrix | |
dc.subject | bidegree distribution | |
dc.subject | exponential random graph model | |
dc.title | On the number of non-zero elements of joint degree vectors | |
dc.type | Article |
Files in this item
Files | Size | Format | View |
---|---|---|---|
6385-20335-2-PB.pdf | 310.4Kb | application/pdf | View/ |