Growth principles of natural hypergraphs

Several systems can be represented by hypergraphs, an extension of graphs with associations between any number of vertices. These natural hypergraphs doe not appear at once. They are generated by some dynamical process of hypergraph evolution. Here I investigate what are the minimal growth principles of natural hypergraphs. I postulate edge duplication and vertex addition at edge duplications as the key principles of hypergraph growth. The implementation of these two principles induce the emergence of preferential attachment, power law degree distribution, the small-world property, high clustering coefficient and the founder effect. This work clarifies the distinction between principles, emergent properties and context specific details in the context of hypergraph growth dynamics.