Show simple item record

dc.contributor.authorCzabarka, Éen
dc.contributor.authorSadeghi, Kayvanen
dc.contributor.authorRauh, Jen
dc.contributor.authorShort, Ten
dc.contributor.authorSzékely, Len
dc.date.accessioned2017-05-08T13:45:57Z
dc.date.available2017-05-08T13:45:57Z
dc.date.issued2017-03-31en
dc.identifier.issn1077-8926
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/264143
dc.description.abstractJoint 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.description.sponsorshipAll authors except the second author were supported in part by the U.S. Air Force Office of Scientic Research (AFOSR) and the Defense Advanced Research Projects Agency (DARPA). The last author was supported in part by the NSF DMS contracts no.1300547 and 1600811.
dc.languageengen
dc.language.isoenen
dc.publisherElectronic Journal of Combinatorics
dc.subjectdegree sequenceen
dc.subjectjoint degree distributionen
dc.subjectjoint degree vectoren
dc.subjectjoint degree matrixen
dc.subjectbidegree distributionen
dc.subjectexponential random graph modelen
dc.titleOn the number of non-zero elements of joint degree vectorsen
dc.typeArticle
prism.issueIdentifier1en
prism.number#P1.55en
prism.publicationDate2017en
prism.publicationNameThe Electronic Journal of Combinatoricsen
prism.volume24en
dc.identifier.doi10.17863/CAM.9500
dcterms.dateAccepted2017-02-24en
rioxxterms.versionVoRen
rioxxterms.licenseref.urihttp://www.rioxx.net/licenses/all-rights-reserveden
rioxxterms.licenseref.startdate2017-03-31en
dc.identifier.eissn1077-8926
rioxxterms.typeJournal Article/Reviewen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record