DeepAI AI Chat
Log In Sign Up

Information-theoretic Limits for Community Detection in Network Models

by   Chuyang Ke, et al.
Purdue University

We analyze the information-theoretic limits for the recovery of node labels in several network models, including the stochastic block model, as well as the latent space model. For the stochastic block model, the non-recoverability condition depends on the probabilities of having edges inside a community, and between different communities. For the latent space model, the non-recoverability condition depends on the dimension of the latent space, and how far and spread are the communities in the latent space. We also extend our analysis to dynamic models in which edges not only depend on their endpoints, but also on previously generated edges.


page 1

page 2

page 3

page 4


Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection

In this paper, we study the information theoretic bounds for exact recov...

Spectral goodness-of-fit tests for complete and partial network data

Networks describe the, often complex, relationships between individual a...

The Geometry of Community Detection via the MMSE Matrix

The information-theoretic limits of community detection have been studie...

Latent Space Approaches to Community Detection in Dynamic Networks

Embedding dyadic data into a latent space has long been a popular approa...

Contextual Stochastic Block Models

We provide the first information theoretic tight analysis for inference ...

Relative Density and Exact Recovery in Heterogeneous Stochastic Block Models

The Stochastic Block Model (SBM) is a widely used random graph model for...

Investigating the 'old boy network' using latent space models

This paper investigates the nature of institutional ties between a group...