{"title":"具有敏感边缘的独立级联模型的谱界","authors":"E. Lee, Sudeep Kamath, E. Abbe, S. Kulkarni","doi":"10.1109/CISS.2016.7460579","DOIUrl":null,"url":null,"abstract":"This paper studies independent cascade models where influence propagates from seed-nodes along edges with independent probabilities. Upper-bounds for the expected number of influenced nodes were previously proposed using the spectral norm of a Hazard matrix. However, these bounds turn out loose in many cases, in particular with respect to sensitive edges such as bottlenecks, seed adjacent, and high probability edges. This paper proposes a similar bound that improves in such cases by handling sensitives edges more carefully.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Spectral bounds for independent cascade model with sensitive edges\",\"authors\":\"E. Lee, Sudeep Kamath, E. Abbe, S. Kulkarni\",\"doi\":\"10.1109/CISS.2016.7460579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies independent cascade models where influence propagates from seed-nodes along edges with independent probabilities. Upper-bounds for the expected number of influenced nodes were previously proposed using the spectral norm of a Hazard matrix. However, these bounds turn out loose in many cases, in particular with respect to sensitive edges such as bottlenecks, seed adjacent, and high probability edges. This paper proposes a similar bound that improves in such cases by handling sensitives edges more carefully.\",\"PeriodicalId\":346776,\"journal\":{\"name\":\"2016 Annual Conference on Information Science and Systems (CISS)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Annual Conference on Information Science and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2016.7460579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Annual Conference on Information Science and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2016.7460579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spectral bounds for independent cascade model with sensitive edges
This paper studies independent cascade models where influence propagates from seed-nodes along edges with independent probabilities. Upper-bounds for the expected number of influenced nodes were previously proposed using the spectral norm of a Hazard matrix. However, these bounds turn out loose in many cases, in particular with respect to sensitive edges such as bottlenecks, seed adjacent, and high probability edges. This paper proposes a similar bound that improves in such cases by handling sensitives edges more carefully.