Statistical inference of assortative community structures

@article{Zhang2020StatisticalIO,
  title={Statistical inference of assortative community structures},
  author={Lizhi Zhang and Tiago P. Peixoto},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.14493}
}
We develop a principled methodology to infer assortative communities in networks based on a nonparametric Bayesian formulation of the planted partition model. We show that this approach succeeds in finding statistically significant assortative modules in networks, unlike alternatives such as modularity maximization, which systematically overfits both in artificial as well as in empirical examples. In addition, we show that our method is not subject to a resolution limit, and can uncover an… 

Figures from this paper

Descriptive vs. inferential community detection

It is argued that inferential methods are more typically aligned with clearer scientific questions, yield more robust results, and should be in many cases preferred.

Descriptive vs. inferential community detection: pitfalls, myths and half-truths

It is argued that inferential methods are more typically aligned with clearer scientific questions, yield more robust results, and should be in many cases preferred.

Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths

It is argued that inferential methods are more typically aligned with clearer scientific questions, yield more robust results, and should be in many cases preferred.

Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection

The results undermine the implications of the “no free lunch” theorem for community detection, both conceptually and in practice, since it is confined to unstructured data instances, unlike relevant community detection problems which are structured by requirement.

Organizing Common Bean (Phaseolus vulgaris) Research: A Model for Information Resources Integration

A model for developing an integrated platform that comprehends various Common bean information is proposed, which shall provide curated information resources about Common Bean, facilitating the single platform access.

Visual Semantics of Memes: (Re)Interpreting Memetic Content and Form for Information Studies

This work proposes a way to empirically study semantics of informational content by collecting images from meme entries on KnowYourMeme, a digital meme repository, and clustering features found in those images using Google Cloud Vision, Google's computer vision project.

Finite-state parameter space maps for pruning partitions in modularity-based community detection

This work combines recent developments into a simple-to-use framework for pruning a set of partitions to a subset that are self-consistent by an equivalence with the objective function for inference of a degree-corrected planted partition stochastic block model (SBM).

Social physics

The future for social physics is bright, by comprehensively (but not exhaustively) reviewing the current state of the art of physics-inspired and physics-like work on societal problems, and paying respect to intellectual mavericks who nurtured the field to its maturity.

References

SHOWING 1-10 OF 59 REFERENCES

Resolution limit in community detection

It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined.

Scalable detection of statistically significant communities and hierarchies, using message passing for modularity

  • Pan ZhangC. Moore
  • Computer Science
    Proceedings of the National Academy of Sciences
  • 2014
By applying the proposed algorithm recursively, subdividing communities until no statistically significant subcommunities can be found, it is shown that the algorithm can detect hierarchical structure in real-world networks more efficiently than previous methods.

Revealing consensus and dissensus between network partitions

This work provides a comprehensive set of methods designed to characterize and summarize complex populations of partitions in a manner that captures not only the existing consensus, but also the dissensus between elements of the population.

Bayesian Stochastic Blockmodeling

  • Tiago P. Peixoto
  • Computer Science
    Advances in Network Clustering and Blockmodeling
  • 2019
This chapter provides a self-contained introduction to the use of Bayesian inference to extract large-scale modular structures from network data, based on the stochastic blockmodel (SBM), as well as

Nonparametric Bayesian inference of the microcanonical stochastic block model.

This work presents a nonparametric Bayesian method to infer the modular structure of empirical networks, including the number of modules and their hierarchical organization, and exposes a direct equivalence between this microcanonical approach and alternative derivations based on the canonical SBM.

KONECT: the Koblenz network collection

KONECT's taxonomy of networks datasets is described, an overview of the datasets included, a review of the supported statistics and plots, and the project's role in the area of web science and network science are discussed.

Stochastic blockmodels and community structure in networks

  • B. KarrerM. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2011
This work demonstrates how the generalization of blockmodels to incorporate this missing element leads to an improved objective function for community detection in complex networks and proposes a heuristic algorithm forcommunity detection using this objective function or its non-degree-corrected counterpart.

Political Books Network

  • unpublished, retrieved from Mark Newman’s website: http:// www-personal.umich.edu/{~}mejn/netdata/.

The national longitudinal study of adolescent to adult health: Research design

  • See http://www. cpc. unc. edu/projects/addhealth/design (accessed 9 April 2015) (2009).
  • 2015

A clarified typology of core-periphery structure in networks

A new typology and corresponding statistical models for characterizing the core-periphery structure of networks are introduced, along with Bayesian stochastic block modeling techniques to classify networks in accordance with this typology.
...