On a complete and sufficient statistic for the correlated Bernoulli random graph model. (arXiv:2002.09976v1 [math.ST])

5 years ago

On a complete and sufficient statistic for the correlated Bernoulli random graph model. (arXiv:2002.09976v1 [math.ST])

Donniell E. Fishkind, Avanti Athreya, Lingyao Meng, Vince Lyzinski, Carey E. Priebe

Inference on vertex-aligned graphs is of wide theoretical and practical importance. There are, however, few flexible and tractable statistical models for correlated graphs, and even fewer comprehensive approaches to parametric inference on data arising from such graphs. In this paper, we consider the correlated Bernoulli random graph model (allowing different Bernoulli coefficients and edge correlations for different pairs of vertices), and we introduce a new variance-reducing technique---called \emph{balancing}---that can refine estimators for model parameters. Specifically, we construct a disagreement statistic and show that it is complete and sufficient; balancing can be interpreted as Rao-Blackwellization with this disagreement statistic. We show that for unbiased estimators of functions of model parameters, balancing generates uniformly minimum variance unbiased estimators (UMVUEs). However, even when unbiased estimators for model parameters do {\em not} exist---which, as we prove, is the case with both the heterogeneity correlation and the total correlation parameters---balancing is still useful, and lowers mean squared error. In particular, we demonstrate how balancing can improve the efficiency of the alignment strength estimator for the total correlation, a parameter that plays a critical role in graph matchability and graph matching runtime complexity.

Publisher URL: http://arxiv.org/abs/2002.09976

DOI: arXiv:2002.09976v1