.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Correlated Bernoulli random graphs
Alignment strength
Graph correlation
Graph matchability
Complexity of graph matching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
ShareSaveCoupling energy metabolism with a mechanism to support brain-derived neurotrophic factor-mediated synaptic plasticity.png)
NeuroscienceOAAI
NeuroscienceIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more