Skip to content

Graph partitioning engine for the degree-corrected bipartite Stochastic Block Model, using the Kernighan-Lin algorithm.

Notifications You must be signed in to change notification settings

junipertcy/bipartiteSBM-KL

Repository files navigation

bipartiteSBM-KL

bipartiteSBM-KL is a graph partitioning engine for degree-corrected bipartite Stochastic Block Models, using the Kernighan-Lin algorithm. It is used as a submodule for det_k_bisbm.

References

The code was originally hosted in this page for a paper describing the bipartite SBM. It is written and maintained by the authors.

Efficiently inferring community structure in bipartite networks

[1] Daniel B. Larremore, Aaron Clauset, and Abigail Z. Jacobs, Physical Review E 90(1), 012805 (2014). [PRE] [PDF]

@article{Larremore:2014kba,
author = {Larremore, Daniel B and Clauset, Aaron and Jacobs, Abigail Z},
title = {{Efficiently inferring community structure in bipartite networks}},
journal = {Physical Review E},
year = {2014},
volume = {90},
number = {1},
pages = {1981--12},
month = jul
}

About

Graph partitioning engine for the degree-corrected bipartite Stochastic Block Model, using the Kernighan-Lin algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published