Local bow-tie structure of the web

Social networks often has the graph structure of giant strongly connected component (GSCC) and its upstream and downstream portions (IN and OUT), known as a bow-tie structure since a pioneering study on the World Wide Web (WWW). GSCC, on the other hand, has community structure, namely tightly knitted clusters, reflecting how the networks developed in time. By using our visualization of enhanced multidimensional scaling (MDS) and force-directed graph drawing for large and directed graphs, we discovered that a bow-tie in the WWW usually has clusters, which are locally-located mini bow-ties that are loosely connected to each other, resulting in a formation of GSCC as a whole. To quantify the mutual connectivity among such local bow-tie, we define a quantity to measure how a local bow-tie connects to others in comparison with random graphs. We found that there are striking difference between the WWW and other social and artificial networks including a million firms’ nationwide supply chain network in Japan and thousands of symbols’ dependency in the programming language of Emacs LISP, in which a global bow-tie exits. Presumably the difference comes from a self-similar structure and development of the WWW speculated by others.

[1]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[2]  Yoshi Fujiwara,et al.  Hierarchical communities in the walnut structure of the Japanese production network , 2018, PloS one.

[3]  Sebastiano Vigna,et al.  Graph structure in the web — Revisited, or a trick of the heavy tail. In WWW'14 Companion, pages 427−432 , 2014, WWW 2014.

[4]  Samik Ghosh,et al.  Network analyses based on comprehensive molecular interaction maps reveal robust control structures in yeast stress response pathways , 2016, npj Systems Biology and Applications.

[5]  J. Doyle,et al.  Bow Ties, Metabolism and Disease , 2022 .

[6]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[7]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[8]  Yoshi Fujiwara,et al.  Large directed-graph layout and its application to a million-firms economic network , 2016 .

[9]  Debora Donato,et al.  Mining the inner structure of the Web graph , 2008, WebDB.

[10]  Geng Li,et al.  A teapot graph and its hierarchical structure of the chinese web , 2008, WWW.

[11]  Ravi Kumar,et al.  Self-similarity in the web , 2001, TOIT.

[12]  Martin Rosvall,et al.  Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems , 2010, PloS one.

[13]  Jing Zhao,et al.  Hierarchical modularity of nested bow-ties in metabolic networks , 2006, BMC Bioinformatics.

[14]  Kozo Sugiyama,et al.  Graph Drawing by the Magnetic Spring Model , 1995, J. Vis. Lang. Comput..

[15]  Hiroaki Kitano,et al.  Biological robustness , 2008, Nature Reviews Genetics.

[16]  Sebastiano Vigna,et al.  Graph structure in the web --- revisited: a trick of the heavy tail , 2014, WWW.

[17]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[18]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[19]  Ulrik Brandes,et al.  Eigensolver Methods for Progressive Multidimensional Scaling of Large Data , 2006, GD.

[20]  Ataru Tanikawa,et al.  Phantom-GRAPE: Numerical software library to accelerate collisionless N-body simulation with SIMD instruction set on x86 architecture , 2012, 1203.4037.

[21]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[22]  Sebastiano Vigna,et al.  The Graph Structure in the Web - Analyzed on Different Aggregation Levels , 2015, J. Web Sci..