Modeling Network Populations via Graph Distances

成果类型:
Article
署名作者:
Lunagomez, Simon; Olhede, Sofia C.; Wolfe, Patrick J.
署名单位:
Lancaster University; Swiss Federal Institutes of Technology Domain; Ecole Polytechnique Federale de Lausanne; University of London; University College London; Purdue University System; Purdue University; Purdue University System; Purdue University; Purdue University System; Purdue University
刊物名称:
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
ISSN/ISSBN:
0162-1459
DOI:
10.1080/01621459.2020.1763803
发表日期:
2021
页码:
2023-2040
关键词:
inference
摘要:
This article introduces a new class of models for multiple networks. The core idea is to parameterize a distribution on labeled graphs in terms of a Frechet mean graph (which depends on a user-specified choice of metric or graph distance) and a parameter that controls the concentration of this distribution about its mean. Entropy is the natural parameter for such control, varying from a point mass concentrated on the Frechet mean itself to a uniform distribution over all graphs on a given vertex set. We provide a hierarchical Bayesian approach for exploiting this construction, along with straightforward strategies for sampling from the resultant posterior distribution. We conclude by demonstrating the efficacy of our approach via simulation studies and two multiple-network data analysis examples: one drawn from systems biology and the other from neuroscience. This article has online.
来源URL: