{"title":"熵分裂超图","authors":"G. Simonyi","doi":"10.1109/ISIT.1994.394705","DOIUrl":null,"url":null,"abstract":"Hypergraph entropy is a sub-additive functional on hypergraphs. We characterize those uniform hypergraphs F for which the entropy of F and the entropy of its complement adds up exactly to the entropy of the complete uniform hypergraph. Hypergraph entropy is an information theoretic functional on a hypergraph with a probability distribution on its vertex set. It is a generalisation of graph entropy.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Entropy splitting hypergraphs\",\"authors\":\"G. Simonyi\",\"doi\":\"10.1109/ISIT.1994.394705\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hypergraph entropy is a sub-additive functional on hypergraphs. We characterize those uniform hypergraphs F for which the entropy of F and the entropy of its complement adds up exactly to the entropy of the complete uniform hypergraph. Hypergraph entropy is an information theoretic functional on a hypergraph with a probability distribution on its vertex set. It is a generalisation of graph entropy.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394705\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394705","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hypergraph entropy is a sub-additive functional on hypergraphs. We characterize those uniform hypergraphs F for which the entropy of F and the entropy of its complement adds up exactly to the entropy of the complete uniform hypergraph. Hypergraph entropy is an information theoretic functional on a hypergraph with a probability distribution on its vertex set. It is a generalisation of graph entropy.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
