# Graph metrics as summary statistics for Approximate Bayesian Computation with application to network model parameter estimation

This source preferred by Damien Fay

**Authors: **Fay, D., Moore, A.W., Gurman, J., Filosi, M. and Brown, K.

**Editors: **Latora, V.

**Journal:** Journal of Complex Networks

In this paper, we investigate Approximate Bayes Computation as a technique for estimating the parameters of graph generators relative to an observed graph. Specifically, we investigate six spectral graph metrics with a view to evaluating their suitability as summary statistics. The overall findings are that Approximate Bayesian Computation can result in reasonable estimates of the parameter posteriors, if the rank of the metrics is sufficiently high. For some graph metrics, biases can exist in the estimated parameters though these appear, empirically, to be small. We demonstrate that combining metrics to form a new summary statistic provides more robust estimates. Given these results, the authors then create two, somewhat arbitrary, graph generators and show how the parameters for these may be estimated with ease. In addition, we show how to apply model selection to determine which generator best explains the observed graph.

This data was imported from Scopus:

**Authors: **Fay, D., Moore, A.W., Brown, K., Filosi, M. and Jurman, G.

**Journal:** Journal of Complex Networks

**Volume:** 3

**Issue:** 1

**Pages:** 52-83

**eISSN:** 2051-1329

**ISSN:** 2051-1310

**DOI:** 10.1093/comnet/cnu009

In this paper, we investigate Approximate Bayes Computation as a technique for estimating the parameters of graph generators relative to an observed graph. Specifically, we investigate six spectral graph metrics with a view to evaluating their suitability as summary statistics. The overall findings are that Approximate Bayesian Computation can result in reasonable estimates of the parameter posteriors, if the rank of the metrics is sufficiently high. For some graph metrics, biases can exist in the estimated parameters though these appear, empirically, to be small. We demonstrate that combining metrics to form a new summary statistic provides more robust estimates. Given these results, the authors then create two, somewhat arbitrary, graph generators and show how the parameters for these may be estimated with ease. In addition, we show how to apply model selection to determine which generator best explains the observed graph.

This data was imported from Web of Science (Lite):

**Authors: **Fay, D., Moore, A.W., Brown, K., Filosi, M. and Jurman, G.

**Journal:** JOURNAL OF COMPLEX NETWORKS

**Volume:** 3

**Issue:** 1

**Pages:** 52-83

**eISSN:** 2051-1329

**ISSN:** 2051-1310

**DOI:** 10.1093/comnet/cnu009