Show simple item record

dc.contributor.authorYu, Qian
dc.contributor.authorPolyanskiy, Yury
dc.date.accessioned2022-07-19T11:59:32Z
dc.date.available2022-07-19T11:59:32Z
dc.date.issued2021
dc.identifier.urihttps://hdl.handle.net/1721.1/143837
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionof10.1109/ISIT45174.2021.9517800en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleBroadcasting on Trees Near Criticality: Perturbation Theoryen_US
dc.typeArticleen_US
dc.identifier.citationYu, Qian and Polyanskiy, Yury. 2021. "Broadcasting on Trees Near Criticality: Perturbation Theory." 2021 IEEE International Symposium on Information Theory (ISIT).
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systems
dc.contributor.departmentStatistics and Data Science Center (Massachusetts Institute of Technology)
dc.relation.journal2021 IEEE International Symposium on Information Theory (ISIT)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-07-19T11:55:41Z
dspace.orderedauthorsYu, Q; Polyanskiy, Yen_US
dspace.date.submission2022-07-19T11:55:42Z
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record