The Graph Structure in the Web - Analyzed on Different Aggregation Levels


Meusel, Robert ; Vigna, Sebastiano ; Lehmberg, Oliver ; Bizer, Christian


DOI: https://doi.org/10.1561/106.00000003
URL: http://www.nowpublishers.com/article/Details/JWS-0...
Additional URL: http://www.nowpublishers.com/article/Download/JWS-...
Document Type: Article
Year of publication: 2015
The title of a journal, publication series: The Journal of Web Science
Volume: 1
Issue number: 1
Page range: 33-47
Place of publication: Hanover, Md.
Publishing house: Now Publishers
ISSN: 2332-4031
Publication language: English
Institution: School of Business Informatics and Mathematics > Wirtschaftsinformatik V (Bizer)
Subject: 004 Computer science, internet
Keywords (English): World Wide Web ; Web Graph ; Network Analysis ; Web Mining
Abstract: Knowledge about the general graph structure of theWorldWideWeb is important for understanding the social mechanisms that govern its growth, for designing ranking methods, for devising better crawling algorithms, and for creating accurate models of its structure. In this paper, we analyze a large web graph. The graph was extracted from a large publicly accessible web crawl that was gathered by the Common Crawl Foundation in 2012. The graph covers over 3:5 billion web pages and 128:7 billion hyperlinks. We analyze and compare, among other features, degree distributions, connectivity, average distances, and the structure of weakly/strongly connected components. We conduct our analysis on three different levels of aggregation: page, host, and pay-level domain (PLD) (one “dot level” above public suffixes). Our analysis shows that, as evidenced by previous research (Serrano et al., 2007), some of the features previously observed by Broder et al., 2000 are very dependent on artifacts of the crawling process, whereas other appear to be more structural. We confirm the existence of a giant strongly connected component; we however find, as observed by other researchers (Donato et al., 2005; Boldi et al., 2002; Baeza-Yates and Poblete, 2003), very different proportions of nodes that can reach or that can be reached from the giant component, suggesting that the “bow-tie structure” as described by Broder et al. is strongly dependent on the crawling process, and to the best of our current knowledge is not a structural property of the Web. More importantly, statistical testing and visual inspection of size-rank plots show that the distributions of indegree, outdegree and sizes of strongly connected components of the page and host graph are not power laws, contrarily to what was previously reported for much smaller crawls, although they might be heavy tailed. If we aggregate at pay-level domain, however, a power law emerges. We also provide for the first time accurate measurement of distance-based features, using recently introduced algorithms that scale to the size of our crawl (Boldi and Vigna, 2013).
Additional information: Online-Ressource

Dieser Eintrag ist Teil der Universitätsbibliographie.




+ Citation Example and Export

Meusel, Robert ; Vigna, Sebastiano ; Lehmberg, Oliver ; Bizer, Christian ORCID: 0000-0003-2367-0237 (2015) The Graph Structure in the Web - Analyzed on Different Aggregation Levels. The Journal of Web Science Hanover, Md. 1 1 33-47 [Article]


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item