Filling algorithm for “holes” in network topology based on cohomology and the maximum entropy principle

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...

Full description

Saved in:
Bibliographic Details
Main Author Guan, Yuheng
Format Conference Proceeding
LanguageEnglish
Published SPIE 28.07.2023
Online AccessGet full text
ISBN9781510667600
1510667601
ISSN0277-786X
DOI10.1117/12.2685974

Cover

More Information
Summary: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.
Bibliography:Conference Location: Tangshan, China
Conference Date: 2023-03-24|2023-03-26
ISBN:9781510667600
1510667601
ISSN:0277-786X
DOI:10.1117/12.2685974