Sampling perspectives on sparse exchangeable graphs
نویسندگان
چکیده
منابع مشابه
Sampling and Estimation for (Sparse) Exchangeable Graphs
Sparse exchangeable graphs on R+, and the associated graphex framework for sparse graphs, generalize exchangeable graphs on N, and the associated graphon framework for dense graphs. We develop the graphex framework as a tool for statistical network analysis by identifying the sampling scheme that is naturally associated with the models of the framework, and by introducing a general consistent e...
متن کامل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...
متن کامل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...
متن کاملPriors on exchangeable directed graphs
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which extends to the directed case via measurable objects known as digraphons. Using digraphons, we first show how to construct models for exchangeable directed graphs, ...
متن کاملSampling Random Colorings of Sparse Random Graphs
We study the mixing properties of the single-site Markov chain known as the Glauber dynam-ics for sampling k-colorings of a sparse random graph G(n, d/n) for constant d. The best knownrapid mixing results for general graphs are in terms of the maximum degree ∆ of the input graphG and hold when k > 11∆/6 for all G. Improved results hold when k > α∆ for graphs withgirth ≥ 5 and ∆ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2019
ISSN: 0091-1798
DOI: 10.1214/18-aop1320