Hierarchical reduction and partition of hypergraph

In this paper, a hierarchical reduction method of hypergraphs is proposed. A macro-vertex in a reduced hypergraph corresponds to an edge of the original hypergraph, and thus a reduced hypergraph can provide a partition of a system. The reduction is realized by the iterations and the sequence of hierarchical reduction gives a sequence of hierarchical partitions. The proposed method allows to reduce and decompose the complexity of the system represented by hypergraphs.