{"title":"Explanation of Correlation between Adjacent Vertices in Network Formed by Traces of Random Walkers","authors":"N. Ikeda","doi":"10.1063/1.2897891","DOIUrl":null,"url":null,"abstract":"We investigated certain kinds of vertex correlation in networks formed by traces of random walkers. In this paper, the sign of correlation between degree and local clustering on adjacent vertices is interpreted based on the capacity for new creation of links for highly connected vertices. These interpretations are consistent with numerical simulation of network evolution. Other types of correlation can be related with each other. It is interesting that the local rules of network evolution determined by the movement of random walkers naturally provide large clustering coefficients and various finite vertex correlations.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":"982 1","pages":"740-743"},"PeriodicalIF":0.5000,"publicationDate":"2008-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1063/1.2897891","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1063/1.2897891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
We investigated certain kinds of vertex correlation in networks formed by traces of random walkers. In this paper, the sign of correlation between degree and local clustering on adjacent vertices is interpreted based on the capacity for new creation of links for highly connected vertices. These interpretations are consistent with numerical simulation of network evolution. Other types of correlation can be related with each other. It is interesting that the local rules of network evolution determined by the movement of random walkers naturally provide large clustering coefficients and various finite vertex correlations.