返回
An entropy-based persistence barcode
DOI:10.1016/j.patcog.2014.06.023.png)
摘要
En 中文
In persistent homology, the persistence barcode encodes pairs of simplices meaning birth and death of homology classes. Persistence barcodes depend on the ordering of the simplices (called a filter) of the given simplicial complex. In this paper, we define the notion of minimal barcodes in terms of entropy. Starting from a given filtration of a simplicial complex K, an algorithm for computing a proper filter (a total ordering of the simplices preserving the partial ordering imposed by the filtration as well as achieving a persistence barcode with small entropy) is detailed, by way of computation, and subsequent modification, of maximum matchings on subgraphs of the Hasse diagram associated to K. Examples demonstrating the utility of computing such a proper ordering on the simplices are given. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Persistent homology
Persistence barcodes
Hasse diagram
Simplicial complexes
Entropy
Filtration
Filter
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
6.1W
机构
引用论文
Synthesis, magnetic properties and theoretical calculations of novel nitronyl nitroxide and imino nitroxide diradicals grafted on terpyridine moiety
Polyhedron
IF0
Anomalous diffusion on the servosphere: A potential tool for detecting inherent organismal movement patterns
PLOS ONE
IF0

