Rank-Size Form and Size-Frequency Form of Zipfs Law and Preferential Attachment Graph Processes

摘要：

From a multiplicative process, we develop a new probability model, which says the probability of a link being pointed to node t, the ith most advantageous node, is a power function of i. By using a conditional expectation derived from the new model and considering a continuous approximation to the expectation, we show that the new model leads to the size-frequency form of Zipfs law. By using a class of stochastic difference equations, we take a different and direct approach to derive the sizefrequency form of Zipfs law, which says the probability of a node having k links (in-links or out-links) is a power function of k.

关键词： Zipfs law statistical methods random graph dynamics scientific computing

作者: SHAN Shi SUNJinwei ZHANG Yifei

作者单位: Center for Information Studies, Shanghai University, Shanghai 200444, China School of Management and Administration, Shanghai University of Economics and Finance, Shanghai 2004

会议类型: 国际会议

会议名称: 第六届科学计量学与大学评价国际研讨会

会议地点: 武汉

会议语种:英文

页码: 44-48

在线出版日期: 2010-11-05（万方平台首次上网日期，不代表论文的发表时间）