Journal or Book Title
Pattern Recognition Letters
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 ϱ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 ϱT, with thresholding behavior starkly illustrated in matchability.
UMass Amherst Open Access Policy
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Fishkind, Donniell E.; Meng, Lingyao; Sun, Ao; Priebe, Carey E.; and Lyzinski, Vince, "Alignment strength and correlation for graphs" (2019). Pattern Recognition Letters. 1295.