{"title":"有向无标度图中的随机边删除","authors":"Yunzhi Yan, Han-Xing Wang","doi":"10.1109/NSWCTC.2009.309","DOIUrl":null,"url":null,"abstract":"This paper investigates a random edge deletion model for directed scale-free graphs that grow with preferential attachment depending on the in- and out-degrees, we show that the resulting in- and out-degree distributions are power laws with correlated exponents, reproducing observed properties of the world-wide web.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Random Edge Deletion in Directed Scale-Free Graphs\",\"authors\":\"Yunzhi Yan, Han-Xing Wang\",\"doi\":\"10.1109/NSWCTC.2009.309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates a random edge deletion model for directed scale-free graphs that grow with preferential attachment depending on the in- and out-degrees, we show that the resulting in- and out-degree distributions are power laws with correlated exponents, reproducing observed properties of the world-wide web.\",\"PeriodicalId\":433291,\"journal\":{\"name\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSWCTC.2009.309\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSWCTC.2009.309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Random Edge Deletion in Directed Scale-Free Graphs
This paper investigates a random edge deletion model for directed scale-free graphs that grow with preferential attachment depending on the in- and out-degrees, we show that the resulting in- and out-degree distributions are power laws with correlated exponents, reproducing observed properties of the world-wide web.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
