Extremal Dependencies and Rank Correlations in Power Law Networks
We analyze dependencies in complex networks characterized by power laws (Web sample, Wikipedia sample and a preferential attachment graph) using statistical techniques from the extreme value theory and the theory of multivariate regular variation. To the best of our knowledge, this is the first attempt to apply this well developed methodology to comprehensive graph data. The new insights this yields are striking: the three above-mentioned data sets are shown to have a totally different dependence structure between graph parameters, such as in-degree and PageRank. Based on the proposed approach, we suggest a new measure for rank correlations. Unlike most known methods, this measure is especially sensitive to rank permutations for top-ranked nodes. Using the new correlation measure, we demonstrate that the PageRank ranking is not sensitive to moderate changes in the damping factor.
KeywordsExtremal dependencies Statistical analysis Power laws PageRank Web Wikipedia Preferential attachment
Unable to display preview. Download preview PDF.
- 3.Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proc. of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595–601 (2004)Google Scholar
- 14.Mikosch, T.: Modelling dependence and tails in financial time series. In: Symposium in Honour of Ole E. Barndorff-Nielsen (Aarhus, 2000). Memoirs, vol. 16, pp. 61–73. Univ. Aarhus, Aarhus (2000)Google Scholar
- 18.Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford Digital Library Technologies Project (1998)Google Scholar
- 21.Volkovich, Y., Litvak, N., Zwart, B.: A framework for evaluating statistical dependencies and rank correlations in power law graphs. Memorandum 1868, University of Twente, Enschede (2008)Google Scholar