Biclique communities

Sune Lehmann Jørgensen, Martin Hansen-Schwartz, Lars Kai Hansen

    Research output: Contribution to journalJournal articleResearchpeer-review

    582 Downloads (Pure)


    We present a method for detecting communities in bipartite networks. Based on an extension of the k-clique community detection algorithm, we demonstrate how modular structure in bipartite networks presents itself as overlapping bicliques. If bipartite information is available, the biclique community detection algorithm retains all of the advantages of the k-clique algorithm, but avoids discarding important structural information when performing a one-mode projection of the network. Further, the biclique community detection algorithm provides a level of flexibility by incorporating independent clique thresholds for each of the nonoverlapping node sets in the bipartite network
    Original languageEnglish
    JournalPhysical Review E
    Issue number1
    Pages (from-to)016108
    Publication statusPublished - 2008

    Bibliographical note

    Copyright 2008 American Physical Society


    • networks
    • evolution


    Dive into the research topics of 'Biclique communities'. Together they form a unique fingerprint.

    Cite this