arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.10838cs.DM
收藏

网络上子图计数的系统关联

A systematic association of subgraph counts over a network

Dimitris Floros, Nikos Pitsianis, Xiaobai Sun

摘要:

我们将所有小的子图计数问题与系统的图形编码/表示系统相关联,该系统连贯地使用graphlet结构。该系统可作为研究和衔接许多重要的图论问题的统一基础。从图编码的角度,用严格的数学语言描述了图元素之间的拓扑关系。我们发现,表征和利用代数和数值关系的graphlet计数/频率。我们提出了一种新的算法,有效地计数小的子图作为我们的理论研究结果的实际产品。

英文摘要:

We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many important graph problems in theory and practice. We describe topological relations among graphlets (graph elements) in rigorous mathematics language and from the perspective of graph encoding. We uncover, characterize and utilize algebraic and numerical relations in graphlet counts/frequencies. We present a novel algorithm for efficiently counting small subgraphs as a practical product of our theoretical findings.

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

↑