.png){kind=icon}
返回
Alignment strength and correlation for graphs
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2019.05.008.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of their natural bijection strongly converges to a novel measure of graph correlation. rho(T) that neatly combines intergraph with intragraph distribution parameters. Within broad families of the random graph parameter settings, we illustrate that exact graph matching runtime and also matchability are both functions of. rho(T), with thresholding behavior starkly illustrated in matchability. (C) 2019 The Authors. Published by Elsevier B.V.
Keyword:
Correlated Bernoulli random graphs
Alignment strength
Graph correlation
Graph matchability
Complexity of graph matching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
IL-12 Contributes to the Development of Asthma by Targeting HIF-1α/NLRP3 Pathway through Runx3IL-12通过Runx3靶向HIF-1α/NLRP3通路促进哮喘的发展
PREAI
分享收藏Coupling energy metabolism with a mechanism to support brain-derived neurotrophic factor-mediated synaptic plasticity.png)
NeuroscienceOAAI
NeuroscienceIF0
OAAI分享收藏分享收藏
查看更多内容