Emergence of scaling in evolving hypernetworks

Abstract Based on hypernetwork theory, we construct a new evolving hypernetwork, which incorporating new nodes and new hyperedges growing, old nodes and old hyperedges disappearing, or rewiring of hyperedges from some nodes to anothers. Besides the growth of hyperedges by adding new nodes, it is also possible that a new hyperedge can be constructed between old nodes in hypernetworks. This evolving hypernetwork model with both increasing and decreasing is more realistic than the evolving model only with increasing. By employing Poisson process theory and continuous method, we obtain stationary average hyperdegree distribution and degree distribution of the hypernetwork. Analytical result shows that the evolving hypernetwork following a generalized power-law distribution, has a phenomenon of “the rich get richer” and a wide range of universality. The theoretical prediction of the stationary average hyperdegree distribution and degree distribution are in good agreement with the real numerical simulation results.

[1]  Guido Caldarelli,et al.  Hypergraph topological quantities for tagged social networks , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Wieslaw A. Dudek,et al.  Intuitionistic fuzzy hypergraphs with applications , 2013, Inf. Sci..

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[5]  Feng Hu,et al.  An evolving hypernetwork model and its properties , 2013 .

[6]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[7]  Chuang Liu,et al.  A hypergraph model of social tagging networks , 2010, ArXiv.

[8]  Jian-Wei Wang,et al.  Evolving hypernetwork model , 2010 .

[9]  Guido Caldarelli,et al.  Random hypergraphs and their applications , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[11]  Sophie Ahrens,et al.  Recommender Systems , 2012 .

[12]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.

[13]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .