Oriented and Degree-generated Block Models: Generating and Inferring Communities with Inhomogeneous Degree Distributions

by   Yaojia Zhu, et al.

The stochastic block model is a powerful tool for inferring community structure from network topology. However, it predicts a Poisson degree distribution within each community, while most real-world networks have a heavy-tailed degree distribution. The degree-corrected block model can accommodate arbitrary degree distributions within communities. But since it takes the vertex degrees as parameters rather than generating them, it cannot use them to help it classify the vertices, and its natural generalization to directed graphs cannot even use the orientations of the edges. In this paper, we present variants of the block model with the best of both worlds: they can use vertex degrees and edge orientations in the classification process, while tolerating heavy-tailed degree distributions within communities. We show that for some networks, including synthetic networks and networks of word adjacencies in English text, these new block models achieve a higher accuracy than either standard or degree-corrected block models.


page 1

page 2

page 3

page 4


A spectral method for community detection in moderately-sparse degree-corrected stochastic block models

We consider community detection in Degree-Corrected Stochastic Block Mod...

Analytical Formulation of the Block-Constrained Configuration Model

We provide a novel family of generative block-models for random graphs t...

Nondiagonal Mixture of Dirichlet Network Distributions for Analyzing a Stock Ownership Network

Block modeling is widely used in studies on complex networks. The corner...

Inferring community characteristics in labelled networks

Labelled networks form a very common and important class of data, natura...

Preferential Attachment Graphs with Planted Communities

A variation of the preferential attachment random graph model of Barabás...

Tractably Modelling Dependence in Networks Beyond Exchangeability

We propose a general framework for modelling network data that is design...

Representation Learning for Scale-free Networks

Network embedding aims to learn the low-dimensional representations of v...