{"title":"优先附着随机图的解析和数值校正方法","authors":"V. Zadorozhnyi, E. B. Yudin, M. N. Yudina","doi":"10.1109/SIBCON.2017.7998461","DOIUrl":null,"url":null,"abstract":"Methods of random graphs growing with nonlinear preferential attachment rule, which have the required distributions of vertices and edges attachment degrees are developed. Application of these methods allows us to generate random graphs, which adequately simulate growing stochastic networks — social, information, transport and many others. Examples of application for the developed methods are given.","PeriodicalId":190182,"journal":{"name":"2017 International Siberian Conference on Control and Communications (SIBCON)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Analytical and numerical methods of calibration for preferential attachment randon graphs\",\"authors\":\"V. Zadorozhnyi, E. B. Yudin, M. N. Yudina\",\"doi\":\"10.1109/SIBCON.2017.7998461\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Methods of random graphs growing with nonlinear preferential attachment rule, which have the required distributions of vertices and edges attachment degrees are developed. Application of these methods allows us to generate random graphs, which adequately simulate growing stochastic networks — social, information, transport and many others. Examples of application for the developed methods are given.\",\"PeriodicalId\":190182,\"journal\":{\"name\":\"2017 International Siberian Conference on Control and Communications (SIBCON)\",\"volume\":\"2015 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Siberian Conference on Control and Communications (SIBCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBCON.2017.7998461\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Siberian Conference on Control and Communications (SIBCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBCON.2017.7998461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analytical and numerical methods of calibration for preferential attachment randon graphs
Methods of random graphs growing with nonlinear preferential attachment rule, which have the required distributions of vertices and edges attachment degrees are developed. Application of these methods allows us to generate random graphs, which adequately simulate growing stochastic networks — social, information, transport and many others. Examples of application for the developed methods are given.