This item is non-discoverable
Loading...
Non-discoverable
Geometric Representations of Random Hypergraphs
Lunagómez, S Mukherjee, S Wolpert, RL Airoldi, EM
Lunagómez, S
Mukherjee, S
Wolpert, RL
Airoldi, EM
Citations
Altmetric:
Genre
Pre-print
Date
2017-01-02
Advisor
Committee member
Group
Department
Permanent link to this record
Collections
Research Projects
Organizational Units
Journal Issue
DOI
10.1080/01621459.2016.1141686
Abstract
© 2017 American Statistical Association. We introduce a novel parameterization of distributions on hypergraphs based on the geometry of points in Rd. The idea is to induce distributions on hypergraphs by placing priors on point configurations via spatial processes. This specification is then used to infer conditional independence models, or Markov structure, for multivariate distributions. This approach results in a broader class of conditional independence models beyond standard graphical models. Factorizations that cannot be retrieved via a graph are possible. Inference of nondecomposable graphical models is possible without requiring decomposability, or the need of Gaussian assumptions. This approach leads to new Metropolis-Hastings Markov chain Monte Carlo algorithms with both local and global moves in graph space, generally offers greater control on the distribution of graph features than currently possible, and naturally extends to hypergraphs. We provide a comparative performance evaluation against state-of-the-art approaches, and illustrate the utility of this approach on simulated and real data.
Description
Citation
Citation to related work
Informa UK Limited
Has part
Journal of the American Statistical Association
ADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu