arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.11214cs.HCcs.CGmath.AT
收藏

超图的拓扑化简

Topological Simplifications of Hypergraphs

Youjia Zhou, Archit Rathore, Emilie Purvine, Bei Wang

摘要:

通过对超图的拓扑简化,研究超图的可视化。我们利用拓扑数据分析的工具,探讨超图的顶点简化和超边简化。特别是,我们将超图转换为它的图形表示,称为线图和团扩展。这种图表示的拓扑简化导致超图的简化。在简化超图时,如果顶点属于几乎相同的超边集,则允许它们合并;如果顶点共享几乎相同的顶点集,则允许它们合并。我们提出的方法是通用的,数学上是合理的,他们把顶点简化和超边简化在一个统一的框架。

英文摘要:

We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to its graph representations known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general, mathematically justifiable, and they put vertex simplification and hyperedge simplification in a unifying framework.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑