Abstract
The explosive growth of Web and social networks has revealed the need to (re-)analyze the connection structure of the underlying graphs. Kleinberg et al. in 1999 has defined Web-Graph as the graph induced by the (directed) hyperlinks between the (static) Web pages. Since then, the Web-graph model has been the basis for representing the Web connection structure. In the early ‘90s, many authors conjectured that Web-graph was a scale-free network containing very few huge-degree nodes and many small-degree nodes. Over the years, this conjecture has established itself, although with some minor limitations. Our paper aims to contribute to a deeper understanding of some Web dynamics such as the spreading of information and viruses, the measurement of the real attractiveness of a site or the estimation of a potential power of influence in the propagating of ideas or in the promotion of products. Our working hypothesis was that Web’s spreading dynamics are better analyzable considering the actual contact between nodes in a time interval, since the physical link has some drawbacks: (a) it is quite static, (b) it may remain inactive, (c) many accesses to Web resources are performed online, typing something in an address-bar. We show that Web is still a scale-free network, with three main classes of nodes: very few huge nodes, the hubs, a significant number of intermediate nodes, an huge number of small nodes. Note that mini-hubs meet regularly in the real world: many sites present millions of daily contacts; however, they do not reach the size of an hub, but they are not so small that they can be ignored, like small-degree nodes. We suspect that they may be responsible for the local spread of viruses or information on the Web. To extract the data presented in this paper, we analyzed 19 categories of coherent sites, sub-divided into 309 sub-categories, for a total of 56,450 different sites, and we considered the contacts for the entire month of July 2017, where the average number of unique visitors were 257,022, who visited an average of 4,050,957 pages.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
These statistics are drawn from http://www.internetlivestats.com/.
References
Albert R, Jeong H, Barabási AL (1999) Internet: diameter of the world-wide web. Nature 401(6749):130–131
Borodin A, Braverman M, Lucier B, Oren J (2017) Strategyproof mechanisms for competitive influence in networks. Algorithmica 78(2):425–452
Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the web. Comput Netw 33(1–6):309–320
Chen W, Lakshmanan LVS, Castillo C (2013) Information and influence propagation in social networks. Synthesis lectures on data management. Morgan & Claypool Publishers, San Rafael
Clauset A, Shalizi CR, Newman MEJ (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661–703
Diestel R (2017) Graph theory. Graduate texts in mathematics, 5th edn. Springer, New York
Dill S, Kumar R, Mccurley KS, Rajagopalan S, Sivakumar D, Tomkins A (2002) Self-similarity in the web. ACM Trans Internet Technol 2(3):205–223
Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, ACM, KDD ’01, pp 57–66
Donato D, Laura L, Leonardi S, Millozzi S (2007) The web as a graph: how far we are. ACM Trans Internet Technol 7:1
Harary F (1999) Graph theory. Perseus Books, Reading
Italiano GF, Parotsidis N, Perekhodko E (2017) What’s inside a bow-tie: analyzing the core of the web and of social networks. In: Proceedings of the 2017 international conference on information system and data mining, ACM, New York, NY, USA, ICISDM ’17, pp 39–43
Kempe D, Kleinberg J, Tardos E (2015) Maximizing the spread of influence through a social network. Theory Comput 11(4):105–147
Kleinberg JM, Kumar R, Raghavan P, Rajagopalan S, Tomkins AS (1999) The web as a graph: measurements, models, and methods. In: Proceedings of the 5th annual international conference on computing and combinatorics, Springer-Verlag, Berlin, Heidelberg, COCOON’99, pp 1–17
Meusel R, Vigna S, Lehmberg O, Bizer C (2015) The graph structure in the web analyzed on different aggregation levels. J Web Sci 1(1):33–47
Mossel E, Roch S (2010) Submodularity of influence in social networks: from local to global. SIAM J Comput 39(6):2176–2188
Narayanan L, Wu K (2018) How to choose friends strategically. Theor Comput Sci. https://doi.org/10.1016/j.tcs.2018.07.013
Newman M (2005) Power laws, pareto distributions and Zipf’s law. Contemp Phys 46(5):323–351
Newman M (2010) Networks: an introduction. Oxford University Press Inc, New York
Seeman L, Singer Y (2013) Adaptive seeding in social networks. In: Proceedings of the 2013 IEEE 54th annual symposium on foundations of computer science, IEEE Computer Society, Washington, DC, USA, FOCS ’13, pp 459–468
Serrano MA, Maguitman A, Boguñá M, Fortunato S, Vespignani A (2007) Decoding the structure of the www: a comparative analysis of web crawls. ACM Trans Web 1:2
Singer Y (2012) How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In: Proceedings of the fifth ACM international conference on web search and data mining, ACM, New York, NY, USA, WSDM ’12, pp 733–742
Tan S, Lu J, Lin Z (2016) Emerging behavioral consensus of evolutionary dynamics on complex networks. SIAM J Control Optim 54:3258–3272
van den Bosch A, Bogers T, de Kunder M (2016) Estimating search engine index size variability: a 9-year longitudinal study. Scientometrics 107(2):839–856
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix: Graphics
Appendix: Graphics
Rights and permissions
About this article
Cite this article
Postiglione, A., De Bueriis, G. On Web’s contact structure. J Ambient Intell Human Comput 10, 2829–2841 (2019). https://doi.org/10.1007/s12652-018-1002-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-018-1002-1