How Hyper-Network Analysis Helps Understand Human Networks?

Service enterprises are value cocreation networks. From this perspective, we analyze how hyper-network models can lead to new understanding for service science. A hyper-network is an integration of multi-layered (role-based) connections of members in a community, such as the Internet and an ecosystem. Hyper-network analysis provides new results of multi-dimensional understanding of human networks, such as identifying the centers of connections between layers (the hyper-hubs or "value wormholes") and the shortened distance between nodes (or, the centrality of members) due to such value wormholes. This paper shows that the common practices of adding new links to an existing random graph (e.g., merging a Website with other social networking/ecommerce sites) is equivalent to creating a hyper-network; and hyper-network analysis may reveal otherwise hidden social structures and thereby yield more accurate estimates for network performance. Estimation formulae are provided for determining the average vertex-vertex distance and average vertex degree. On this basis, the paper proves that hyper-networks enhance ordinary random graphs in these measures, and hence can probably model real-world social networks better than two-dimensional graphs. The paper suggests that all human networks, including social and economical, may be fundamentally hyper-networks. [ Service Science , ISSN 2164-3962 (print), ISSN 2164-3970 (online), was published by Services Science Global (SSG) from 2009 to 2011 as issues under ISBN 978-1-4276-2090-3.]

[1]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  N H Fefferman,et al.  How disease models in static networks can fail to approximate disease in dynamic networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[5]  Shan Xiuming,et al.  An estimation formula for the average path length of scale-free networks , 2008 .

[6]  Garry Robins,et al.  An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[7]  Cheng Hsu,et al.  Service Scaling on Hyper-Networks , 2009 .

[8]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[9]  G. Caldarelli,et al.  Scale-free Networks without Growth or Preferential Attachment: Good get Richer , 2002 .

[10]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Mark S. Granovetter.  T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

[12]  Shuigeng Zhou,et al.  Evolving Apollonian networks with small-world scale-free topologies. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[14]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[16]  B. Bollobás.  The evolution of random graphs , 1984 .