Measuring extremal dependencies in Web graphs
|Measuring extremal dependencies in Web graphs|
|Author(s)||Volkovich Y., Litvak N., Zwart B.|
|Published in||Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08|
|Keyword(s)||Page rank, Preferential attachment, Regular variation, Web, Wikipedia (Extra: Page rank, Preferential attachment, Regular variation, Web, Wikipedia, Decision support systems, Information management, Internet, World Wide Web)|
|Article||BASE, CiteSeerX, Google Scholar|
|Web||Ask, Bing, Google (PDF), Yahoo!|
|Download and mirrors|
|Local copy||Not available|
|Remote mirror(s)||Not available|
|Export and share|
|BibTeX, CSV, RDF, JSON|
|Browse properties · List of conference papers|
Measuring extremal dependencies in Web graphs is a 2008 conference paper written in English by Volkovich Y., Litvak N., Zwart B. and published in Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08.
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 Page Rank.
- This section requires expansion. Please, help!
Probably, this publication is cited by others, but there are no articles available for them in WikiPapers. Cited 1 time(s)