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

by   Jiaming Xu, et al.

The classical setting of community detection consists of networks exhibiting a clustered structure. To more accurately model real systems we consider a class of networks (i) whose edges may carry labels and (ii) which may lack a clustered structure. Specifically we assume that nodes possess latent attributes drawn from a general compact space and edges between two nodes are randomly generated and labeled according to some unknown distribution as a function of their latent attributes. Our goal is then to infer the edge label distributions from a partially observed network. We propose a computationally efficient spectral algorithm and show it allows for asymptotically correct inference when the average node degree could be as low as logarithmic in the total number of nodes. Conversely, if the average node degree is below a specific constant threshold, we show that no algorithm can achieve better inference than guessing without using the observations. As a byproduct of our analysis, we show that our model provides a general procedure to construct random graph models with a spectrum asymptotic to a pre-specified eigenvalue distribution such as a power-law distribution.


page 1

page 2

page 3

page 4


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

We consider a non-projective class of inhomogeneous random graph models ...

Asymptotic degree distributions in large homogeneous random networks: A little theory and a counterexample

In random graph models, the degree distribution of an individual node s...

Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks

The focus of this work is on estimation of the in-degree distribution in...

Learning Latent Block Structure in Weighted Networks

Community detection is an important task in network analysis, in which w...

Network Inference by Learned Node-Specific Degree Prior

We propose a novel method for network inference from partially observed ...

Grand canonical ensembles of sparse networks and Bayesian inference

Maximum entropy network ensembles have been very successful in modelling...

Spectral Triadic Decompositions of Real-World Networks

A fundamental problem in mathematics and network analysis is to find con...

Please sign up or login with your details

Forgot password? Click here to reset