{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:10:18Z","timestamp":1782969018261,"version":"3.54.5"},"reference-count":31,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,8,13]]},"abstract":"<jats:p>Knowledge about the general graph structure of the World Wide Web 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 \u201cdot level\u201d above public suffixes).<\/jats:p>\n                  <jats:p>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 \u201cbow-tie structure\u201d 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.<\/jats:p>\n                  <jats:p>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).<\/jats:p>","DOI":"10.1561\/106.00000003","type":"journal-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T08:47:45Z","timestamp":1439455665000},"page":"33-47","source":"Crossref","is-referenced-by-count":80,"title":["The Graph Structure in the Web \u2212 Analyzed on Different\n                    Aggregation Levels"],"prefix":"10.1561","volume":"1","author":[{"given":"Robert","family":"Meusel","sequence":"first","affiliation":[{"name":"Data and Web Science Group, University of Mannheim ,","place":["Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[{"name":"Laboratory for Web Algorithmics, Universit\u00e0 degli Studi di Milano ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oliver","family":"Lehmberg","sequence":"additional","affiliation":[{"name":"Data and Web Science Group, University of Mannheim ,","place":["Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Bizer","sequence":"additional","affiliation":[{"name":"Data and Web Science Group, University of Mannheim ,","place":["Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"issue":"4","key":"2026040606365637200_ref001","doi-asserted-by":"crossref","first-page":"21:1","DOI":"10.1145\/1538902.1538905","article-title":"On the bias of traceroute sampling:\n                        Or, power-law degree distributions in regular graphs\u201d","volume":"56","author":"Achlioptas","year":"2009","journal-title":"Journal ACM."},{"key":"2026040606365637200_ref002","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0085777","article-title":"powerlaw: A Python Package for\n                        Analysis of Heavy-Tailed Distributions","volume":"9","author":"Alstott","year":"2014","journal-title":"PLoS\n                        ONE"},{"key":"2026040606365637200_ref003","first-page":"45","volume-title":"ACM Web Science 2012:\n                        Conference Proceedings","author":"Backstrom","year":"2012"},{"key":"2026040606365637200_ref004","first-page":"11","volume-title":"Proc. of Latin\n                        American Web Conference 2003","author":"Baeza-Yates","year":"2003"},{"key":"2026040606365637200_ref005","volume-title":"\u201cRFC 1738: Uniform Resource Locators\n                        (URL)\u201d","author":"Berners-Lee","year":"1994"},{"key":"2026040606365637200_ref006","volume-title":"Proc. of the In-Use Track ISWC\u201913","author":"Bizer","year":"2013"},{"key":"2026040606365637200_ref007","volume-title":"Proc. WWW\u201902","author":"Boldi","year":"2002"},{"key":"2026040606365637200_ref008","first-page":"595","volume-title":"Proc.\n                        WWW\u201904","author":"Boldi","year":"2004"},{"key":"2026040606365637200_ref009","first-page":"1222","volume-title":"ASONAM 2012","author":"Boldi","year":"2012"},{"key":"2026040606365637200_ref010","volume-title":"ICDMW\n                        2013","author":"Boldi","year":"2013"},{"key":"2026040606365637200_ref011","volume-title":"Internet Math.","author":"Boldi","year":"2014"},{"issue":"1-6","key":"2026040606365637200_ref012","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","article-title":"\u201cGraph structure in the Web:\n                        experiments and models","volume":"33","author":"Broder","year":"2000","journal-title":"Computer\n                        Networks"},{"issue":"4","key":"2026040606365637200_ref013","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","article-title":"\u201cPowerLaw Distributions in\n                        Empirical Data","volume":"51","author":"Clauset","year":"2009","journal-title":"SIAM Rev."},{"issue":"3","key":"2026040606365637200_ref014","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/572326.572328","article-title":"\u201cSelf-similarity in the\n                        web","volume":"2","author":"Dill","year":"2002","journal-title":"ACM Trans. Internet Technol."},{"key":"2026040606365637200_ref015","first-page":"145","volume-title":"WebDB","author":"Donato","year":"2005"},{"key":"2026040606365637200_ref016","first-page":"1","volume-title":"Proc. WebDB\u201904","author":"Fetterly","year":"2004"},{"issue":"18","key":"2026040606365637200_ref017","doi-asserted-by":"crossref","first-page":"3859","DOI":"10.1016\/j.comnet.2012.10.004","article-title":"\u201cWeb evolution and Web\n                        Science","volume":"56","author":"Hall","year":"2012","journal-title":"Computer Networks"},{"key":"2026040606365637200_ref018","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-78808-9_4","volume-title":"Algorithms and models for the\n                        web-graph","author":"Hirate","year":"2008"},{"key":"2026040606365637200_ref019","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/2615569.2615674","volume-title":"Proceedings of the\n                        2014 ACM conference on Web science","author":"Lehmberg","year":"2014"},{"issue":"4","key":"2026040606365637200_ref020","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1080\/15427951.2005.10129111","article-title":"\u201cTowards a Theory of Scale-Free\n                        Graphs: Definition, Properties, and Implications","volume":"2","author":"Li","year":"2005","journal-title":"Internet Math."},{"issue":"4","key":"2026040606365637200_ref021","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/14697680500151343","article-title":"\u201cEmpirical distributions of stock\n                        returns: between the stretched exponential and the power\n                        law?","volume":"5","author":"Malevergne","year":"2005","journal-title":"Quantitative Finance"},{"key":"2026040606365637200_ref022","first-page":"09","volume-title":"Swiss Finance Institute Research\n                        Paper Series","author":"Malevergne","year":"2009"},{"issue":"3-4","key":"2026040606365637200_ref023","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","article-title":"\u201cHarmony in the\n                        small-world","volume":"285","author":"Marchiori","year":"2000","journal-title":"Physica A: Statistical\n                        Mechanics and its Applications"},{"key":"2026040606365637200_ref024","first-page":"427","volume-title":"Proc. of the companion publication of the WWW\u201914","author":"Meusel","year":"2014"},{"key":"2026040606365637200_ref025","volume-title":"Tech. rep. No.\n                        SIDL-WP-1999-0120","author":"Page","year":"1998"},{"key":"2026040606365637200_ref026","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-45655-4_36","volume-title":"Computing and\n                        Combinatorics","author":"Pandurangan","year":"2002"},{"issue":"2","key":"2026040606365637200_ref027","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1255438.1255442","article-title":"\u201cDecoding the structure of the WWW:\n                        A comparative analysis of Web crawls","volume":"1","author":"Serrano","year":"2007","journal-title":"TWEB"},{"key":"2026040606365637200_ref028","volume-title":"Tech. rep.","author":"Spiegler","year":"2013"},{"key":"2026040606365637200_ref029","volume-title":"CoRR","author":"Vigna","year":"2013"},{"issue":"5","key":"2026040606365637200_ref030","first-page":"586","article-title":"\u201cMathematics and the Internet: A source\n                        of enormous confusion and great potential","volume":"56","author":"Willinger","year":"2009","journal-title":"Notices of the AMS"},{"key":"2026040606365637200_ref031","first-page":"1133","article-title":"\u201cA teapot graph and its hierarchical structure of the\n                        Chinese web","author":"Zhu","year":"2008","journal-title":"Proc. WWW\u201908"}],"container-title":["The Journal of Web Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/jws\/article-pdf\/1\/1\/33\/11141061\/106.00000003en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/jws\/article-pdf\/1\/1\/33\/11141061\/106.00000003en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:32:09Z","timestamp":1777473129000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/jws\/article\/1\/1\/33\/1331648\/The-Graph-Structure-in-the-Web-Analyzed-on"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,13]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,8,13]]}},"URL":"https:\/\/doi.org\/10.1561\/106.00000003","relation":{},"ISSN":["2332-4031"],"issn-type":[{"value":"2332-4031","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,13]]}}}