2,679 research outputs found
On Exchangeability in Network Models
We derive representation theorems for exchangeable distributions on finite
and infinite graphs using elementary arguments based on geometric and
graph-theoretic concepts. Our results elucidate some of the key differences,
and their implications, between statistical network models that are finitely
exchangeable and models that define a consistent sequence of probability
distributions on graphs of increasing size.Comment: Dedicated to the memory of Steve Fienber
On sparsity, power-law and clustering properties of graphex processes
This paper investigates properties of the class of graphs based on
exchangeable point processes. We provide asymptotic expressions for the number
of edges, number of nodes and degree distributions, identifying four regimes:
(i) a dense regime, (ii) a sparse almost dense regime, (iii) a sparse regime
with power-law behaviour, and (iv) an almost extremely sparse regime. We show
that under mild assumptions, both the global and local clustering coefficients
converge to constants which may or may not be the same. We also derive a
central limit theorem for the number of nodes. Finally, we propose a class of
models within this framework where one can separately control the latent
structure and the global sparsity/power-law properties of the graph
Sampling and Inference for Beta Neutral-to-the-Left Models of Sparse Networks
Empirical evidence suggests that heavy-tailed degree distributions occurring
in many real networks are well-approximated by power laws with exponents
that may take values either less than and greater than two. Models based on
various forms of exchangeability are able to capture power laws with , and admit tractable inference algorithms; we draw on previous results to
show that cannot be generated by the forms of exchangeability used
in existing random graph models. Preferential attachment models generate power
law exponents greater than two, but have been of limited use as statistical
models due to the inherent difficulty of performing inference in
non-exchangeable models. Motivated by this gap, we design and implement
inference algorithms for a recently proposed class of models that generates
of all possible values. We show that although they are not exchangeable,
these models have probabilistic structure amenable to inference. Our methods
make a large class of previously intractable models useful for statistical
inference.Comment: Accepted for publication in the proceedings of Conference on
Uncertainty in Artificial Intelligence (UAI) 201
- …