IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v461y2016icp647-654.html
   My bibliography  Save this article

Network of likes and dislikes: Conflict and membership

Author

Listed:
  • Park, Hye Jin
  • Yi, Su Do
  • Kim, Dae Joong
  • Kim, Beom Jun

Abstract

We all have friends and foes. In the study of complex networks, such a pairwise interaction is described by a directed link since the relation is not necessarily symmetric. We study a real network constructed from a survey in which each individual chooses five members (s)he wants to work with, and other five (s)he does not like to work together. Although everyone’s outdegrees for such like and dislike links are fixed to five, respectively, it is found that indegree sequence for each type of links exhibits very different behaviors. We also pursue to answer the question of proper divisions of the organization based on the concept of happiness defined for each directed relation. For example, two individuals connected by like (dislike) links in both directions are happy if they belong to the same (different) group(s). We then adopt the framework of the q-state Potts model with long-ranged ferromagnetic and antiferromagnetic interactions and discuss the group structure in the organization that minimizes a suitably defined unhappiness.

Suggested Citation

  • Park, Hye Jin & Yi, Su Do & Kim, Dae Joong & Kim, Beom Jun, 2016. "Network of likes and dislikes: Conflict and membership," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 647-654.
    • Handle: RePEc:eee:phsmap:v:461:y:2016:i:c:p:647-654
    DOI: 10.1016/j.physa.2016.06.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116302989
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2016.06.030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Lee, Kyu-Min & Lee, Sungmin & Min, Byungjoon & Goh, K.-I., 2023. "Threshold cascade dynamics on signed random networks," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).

    More about this item

    Keywords

    Signed network; Partitioning;

    Statistics

    Access and download statistics

    Corrections

    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:eee:phsmap:v:461:y:2016:i:c:p:647-654. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.