Filling algorithm for “holes” in network topology based on cohomology and the maximum entropy principle
Yuheng Guan · 2023
In this paper, the probability density function space of a simplicial complex is used as its dual complex to establish a persistent cohomology model. Combining the construction of the Markov probability matrix and the maximum entropy principle and based on the strategy minimum of covering redundant areas, we propose a searching and filling algorithm of “holes” in the cluster network topology. The rationality and feasibility of the algorithm are verified and show that this algorithm is a natural algorithm with the evolution from nonequilibrium to equilibrium.