Alignment Strength and Correlation for Graphs
Combinatorics
2020-01-22 v4
Abstract
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 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 , with thresholding behavior starkly illustrated in matchability.
Cite
@article{arxiv.1808.08502,
title = {Alignment Strength and Correlation for Graphs},
author = {Donniell E. Fishkind and Lingyao Meng and Ao Sun and Carey E. Priebe and Vince Lyzinski},
journal= {arXiv preprint arXiv:1808.08502},
year = {2020}
}