IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v29y2018i05ns0129183118400028.html
   My bibliography  Save this article

CS_TOTR: A new vertex centrality method for directed signed networks based on status theory

Author

Listed:
  • Yue Ma

    (School of Mathematics and Statistics, Shandong University (Weihai), Weihai, P. R. China)

  • Min Liu

    (School of Mathematics and Statistics, Shandong University (Weihai), Weihai, P. R. China)

  • Peng Zhang

    (School of Mathematics and Statistics, Shandong University (Weihai), Weihai, P. R. China)

  • Xingqin Qi

    (School of Mathematics and Statistics, Shandong University (Weihai), Weihai, P. R. China)

Abstract

Measuring the importance (or centrality) of vertices in a network is a significant topic in complex network analysis, which has significant applications in diverse domains, for example, disease control, spread of rumors, viral marketing and so on. Existing studies mainly focus on social networks with only positive (or friendship) relations, while signed networks with also negative (or enemy) relations are seldom studied. Various signed networks commonly exist in real world, e.g. a network indicating friendship/enmity, love/hate or trust/mistrust relationships. In this paper, we propose a new centrality method named CS_TOTR to give a ranking of vertices in directed signed networks. To design this new method, we use the “status theory” for signed networks, and also adopt the vertex ranking algorithm for a tournament and the topological sorting algorithm for a general directed graph. We apply this new centrality method on the famous Sampson Monastery dataset and obtain a convincing result which shows its validity.

Suggested Citation

  • Yue Ma & Min Liu & Peng Zhang & Xingqin Qi, 2018. "CS_TOTR: A new vertex centrality method for directed signed networks based on status theory," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 29(05), pages 1-16, May.
    • Handle: RePEc:wsi:ijmpcx:v:29:y:2018:i:05:n:s0129183118400028
    DOI: 10.1142/S0129183118400028
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183118400028
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183118400028?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.

    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:wsi:ijmpcx:v:29:y:2018:i:05:n:s0129183118400028. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.