Measuring extremal dependencies in web graphs


Share/Save/Bookmark

Volkovich, Y.V. and Litvak, N. and Zwart, B. (2008) Measuring extremal dependencies in web graphs. In: Proceedings of the 17th International Conference on the World Wide Web (WWW 2008), 21-25 April 2008, Beijing, China.

[img]
Preview
PDF
667Kb
Abstract:We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. The well developed theory of regular variation is widely applied in extreme value theory, telecommunications and mathematical finance, and it provides a natural mathematical formalism for analyzing dependencies between variables with power laws. However, most of the proposed methods have never been used in the Web graph data mining. The present work fills this gap. The new insights this yields are striking: the three above-mentioned data sets are shown to have a totally different dependence structure between different graph parameters, such as in-degree and PageRank.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65087
Official URL:http://doi.acm.org/10.1145/1367497.1367682
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 254906