IDEAS home Printed from
   My bibliography  Save this article

Two Algorithms for Relaxed Structural Balance Partitioning: Linking Theory, Models, and Data to Understand Social Network Phenomena


  • Michael Brusco

    (Florida State University, Tallassee, FL, USA)

  • Patrick Doreian

    (University of Pittsburgh, PA, USA,, University of Ljubljana, Slovenia)

  • Andrej Mrvar

    (University of Ljubljana, Slovenia)

  • Douglas Steinley

    (University of Missouri-Columbia, MO, USA)


Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partitioning signed networks, informed by these formal results, were developed and applied empirically. More recently, ‘‘structural balance’’ was generalized to ‘‘relaxed structural balance,’’ and a modified partitioning algorithm was proposed. Given the critical interplay of theory, models, and data, it is important that methods for the partitioning of signed networks in terms of relaxed structural balance model are appropriate. The authors consider two algorithms for establishing partitions of signed networks in terms of relaxed structural balance. One is an older heuristic relocation algorithm, and the other is a new exact solution procedure. The former can be used both inductively and deductively. When used deductively, this requires some prespecification incorporating substantive insights. The new branch-and-bound algorithm is used inductively and requires no prespecification of an image matrix in terms of ideal blocks. Both procedures are demonstrated using several examples from the literature, and their contributions are discussed. Together, the two algorithms provide a sound foundation for partitioning signed networks and yield optimal partitions. Issues of network size and density are considered in terms of their consequences for algorithm performance.

Suggested Citation

  • Michael Brusco & Patrick Doreian & Andrej Mrvar & Douglas Steinley, 2011. "Two Algorithms for Relaxed Structural Balance Partitioning: Linking Theory, Models, and Data to Understand Social Network Phenomena," Sociological Methods & Research, , vol. 40(1), pages 57-87, February.
  • Handle: RePEc:sae:somere:v:40:y:2011:i:1:p:57-87

    Download full text from publisher

    File URL:
    Download Restriction: no


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:eurjco:v:5:y:2017:i:4:d:10.1007_s13675-017-0082-6 is not listed on IDEAS
    2. Mario Levorato & Rosa Figueiredo & Yuri Frota & Lúcia Drummond, 0. "Evaluating balancing on social networks through the efficient solution of correlation clustering problems," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 0, pages 1-32.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:somere:v:40:y:2011:i:1:p:57-87. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (SAGE Publications). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.