我们提出了首个实现仅拓扑局部图匹配(又称局部网络比对或子图同构)的算法:BLANT,即Basic Local Alignment of Network Topology(网络拓扑基本局部比对)。BLANT首先为单个图构建一个有限的高特异性索引,该索引包含被称为k-graphlets(k-图元)的连通k节点诱导子图,k的取值范围为6到15。该索引以确定性方式构建,若两个网络之间存在显著的公共网络拓扑,它们的索引很可能存在重叠。这是让BLANT能够仅利用拓扑信息发现比对的核心洞见。为比对两个网络,BLANT查询它们各自的索引以形成大规模、高质量的局部比对。BLANT能够发现拓扑相似度极高(S3 ≥ 0.95)、规模达150个节点对的比对,其中多达50%的节点对与其“指定的”全局对应节点对存在差异。这些结果优于基线方法——一种经过改造以支持仅拓扑模式的前沿局部比对算法。与基线方法发现的拓扑相似度相近(S3 ≥ 0.95)的比对相比,这类比对的规模是其3倍,且与全局比对的差异(加性)高出30%。我们希望这类局部相似度高、全局相似度低的区域能够为全局比对算法提供补充性洞见。
英文摘要:
We introduce the first algorithm to perform topology-only local graph matching (a.k.a. local network alignment or subgraph isomorphism): BLANT, for Basic Local Alignment of Network Topology. BLANT first creates a limited, high-specificity index of a single graph containing connected k-node induced subgraphs called k-graphlets, for k=6-15. The index is constructed in a deterministic way such that, if significant common network topology exists between two networks, their indexes are likely to overlap. This is the key insight which allows BLANT to discover alignments using only topological information. To align two networks, BLANT queries their respective indexes to form large, high quality local alignments. BLANT is able to discover highly topologically similar alignments (S3 >= 0.95) of up to 150 node-pairs for which up to 50% of node pairs differ from their "assigned" global counterpart. These results compare favorably against the baseline, a state-of-the-art local alignment algorithm which was adapted to be topology-only. Such alignments are 3x larger and differ 30% more (additive) more from the global alignment than alignments of similar topological similarity (S3 >= 0.95) discovered by the baseline. We hope that such regions of high local similarity and low global similarity may provide complementary insights to global alignment algorithms.
Reconstructing graphs and their connectivity using graphlets
Institute of Computer Science of the Czech Academy of Sciences(捷克科学院计算机研究所);Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Charles University(查理大学数学物理学院计算机科学研究所);Universitat Politècnica de Catalunya - BarcelonaTech (UPC)(加泰罗尼亚理工大学)
Graphlets as structural fingerprints of complex networks
Institute of Computer Science of the Czech Academy of Sciences(捷克科学院计算机科学研究所);National Institute of Mental Health(国家精神卫生研究所);Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Charles University(查理大学数学物理学院计算机科学研究所)
Subgraph Frequency Distribution Estimation using Graph Neural Networks
Stanford University(斯坦福大学);Australian National University(澳大利亚国立大学);The University of Hong Kong(香港大学);Rutgers University(罗格斯大学);Massachusetts Institute of Technology(麻省理工学院)