Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs

Jin-Li Guo

doi:10.1038/srep36648

Return

Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs

2016-11-15

郭进利 (Jin-Li Guo) *

Xin-Yun Zhu

Jeffrey Yi‐Lin Forrest

DOI：10.1038/srep36648

Original

Save

View PDF

Abstract

En 中文

Firstly, this paper proposes a non-uniform evolving hypergraph model with nonlinear preferential attachment and an attractiveness. This model allows nodes to arrive in batches according to a Poisson process and to form hyperedges with existing batches of nodes. Both the number of arriving nodes and that of chosen existing nodes are random variables so that the size of each hyperedge is non-uniform. This paper establishes the characteristic equation of hyperdegrees, calculates changes in the hyperdegree of each node, and obtains the stationary average hyperdegree distribution of the model by employing the Poisson process theory and the characteristic equation. Secondly, this paper constructs a model for weighted evolving hypergraphs that couples the establishment of new hyperedges, nodes and the dynamical evolution of the weights. Furthermore, what is obtained are respectively the stationary average hyperdegree and hyperstrength distributions by using the hyperdegree distribution of the established unweighted model above so that the weighted evolving hypergraph exhibits a scale-free behavior for both hyperdegree and hyperstrength distributions.

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.