A Bayesian model for sparse graphs with flexible degree distribution and overlapping community structure

10/03/2018
by   Juho Lee, et al.
0

We consider a non-projective class of inhomogeneous random graph models with interpretable parameters and a number of interesting asymptotic properties. Using the results of Bollobás et al. [2007], we show that i) the class of models is sparse and ii) depending on the choice of the parameters, the model is either scale-free, with power-law exponent greater than 2, or with an asymptotic degree distribution which is power-law with exponential cut-off. We propose an extension of the model that can accommodate an overlapping community structure. Scalable posterior inference can be performed due to the specific choice of the link probability. We present experiments on five different real-world networks with up to 100,000 nodes and edges, showing that the model can provide a good fit to the degree distribution and recovers well the latent community structure.

READ FULL TEXT
research
02/05/2016

Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities

We propose a novel statistical model for sparse networks with overlappin...
research
06/26/2014

Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results

The classical setting of community detection consists of networks exhibi...
research
07/02/2021

Asymptotic Analysis of Statistical Estimators related to MultiGraphex Processes under Misspecification

This article studies the asymptotic properties of Bayesian or frequentis...
research
03/16/2018

Modelling sparsity, heterogeneity, reciprocity and community structure in temporal interaction data

We propose a novel class of network models for temporal dyadic interacti...
research
07/09/2018

Sampling and Inference for Beta Neutral-to-the-Left Models of Sparse Networks

Empirical evidence suggests that heavy-tailed degree distributions occur...
research
06/15/2021

Asymptotic Behavior of Common Connections in Sparse Random Networks

Random network models generated using sparse exchangeable graphs have pr...
research
05/09/2019

Linear Work Generation of R-MAT Graphs

R-MAT is a simple, widely used recursive model for generating `complex n...

Please sign up or login with your details

Forgot password? Click here to reset