Exchangeable random measures for sparse and modular graphs with overlapping communities
نویسندگان
چکیده
منابع مشابه
Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
Abstract: We propose a novel statistical model for sparse networks with overlapping community structure. The model is based on representing the graph as an exchangeable point process, and naturally generalizes existing probabilistic models with overlapping block-structure to the sparse regime. Our construction builds on vectors of completely random measures, and has interpretable parameters, ea...
متن کاملSparse graphs using exchangeable random measures
Statistical network modelling has focused on representing the graph as a discrete structure, namely the adjacency matrix. When assuming exchangeability of this array-which can aid in modelling, computations and theoretical analysis-the Aldous-Hoover theorem informs us that the graph is necessarily either dense or empty. We instead consider representing the graph as an exchangeable random measur...
متن کاملApproximating Sparse Graphs: The Random Overlapping Communities Model
How can we approximate sparse graphs and sequences of sparse graphs (with average degree unbounded and o(n))? We consider convergence in the first k moments of the graph spectrum (equivalent to the numbers of closed k-walks) appropriately normalized. We introduce a simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence...
متن کاملThe Class of Random Graphs Arising from Exchangeable Random Measures
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a probabilistic symmetry: invariance of the distribution of each graph to an arbitrary relabelings of its vertices. In particular, following Caron and Fox, we interpret ...
متن کاملBayesian nonparametric models of sparse and exchangeable random graphs
Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous, 1981; Hoover, 1979) applies and informs us that the graph is necessarily either dense or empty. In this paper, we instead consider representing the graph as a m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Royal Statistical Society: Series B (Statistical Methodology)
سال: 2020
ISSN: 1369-7412
DOI: 10.1111/rssb.12363