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

Optimizing transformations of structural balance in signed networks with potential relationships

Author

Listed:
  • Du, Haifeng
  • He, Xiaochen
  • Wang, Shanfeng
  • Gong, Maoguo
  • Feldman, Marcus W.

Abstract

A signed network includes positive edges, negative edges and “0” edges, the last of which denote potential relationships. However, “0” edges are commonly ignored in transformations of unbalanced networks. In this paper, we take “0” edges into account and solve the optimization problem in a more comprehensive way. We transform the unbalanced network by not only changing signs of edges but also changing edges into potential. The experimental results show that our method can solve this problem efficiently, and that our solutions are cost-saving.

Suggested Citation

  • Du, Haifeng & He, Xiaochen & Wang, Shanfeng & Gong, Maoguo & Feldman, Marcus W., 2017. "Optimizing transformations of structural balance in signed networks with potential relationships," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 414-424.
  • Handle: RePEc:eee:phsmap:v:465:y:2017:i:c:p:414-424
    DOI: 10.1016/j.physa.2016.08.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116305441
    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

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

    References listed on IDEAS

    as
    1. Figueiredo, Rosa & Frota, Yuri, 2014. "The maximum balanced subgraph of a signed graph: Applications and solution approaches," European Journal of Operational Research, Elsevier, vol. 236(2), pages 473-487.
    2. Michael Brusco & Douglas Steinley, 2011. "A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices," Psychometrika, Springer;The Psychometric Society, vol. 76(4), pages 612-633, October.
    3. Sun, Yixiang & Du, Haifeng & Gong, Maoguo & Ma, Lijia & Wang, Shanfeng, 2014. "Fast computing global structural balance in signed networks based on memetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 415(C), pages 261-272.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lin, Geng & Guan, Jian & Feng, Huibin, 2018. "An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 500(C), pages 199-209.
    2. Xiaochen He & Haifeng Du & Marcus W Feldman & Guangyu Li, 2019. "Information diffusion in signed networks," PLOS ONE, Public Library of Science, vol. 14(10), pages 1-21, October.
    3. Sheykhali, Somaye & Darooneh, Amir Hossein & Jafari, Gholam Reza, 2020. "Partial balance in social networks with stubborn links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 548(C).
    4. Du, Haifeng & He, Xiaochen & Wang, Jingjing & Feldman, Marcus W., 2018. "Reversing structural balance in signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 780-792.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lin, Geng & Guan, Jian & Feng, Huibin, 2018. "An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 500(C), pages 199-209.
    2. Mario Levorato & Rosa Figueiredo & Yuri Frota & Lúcia Drummond, 2017. "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. 5(4), pages 467-498, December.
    3. Peng Wu & Li Pan, 2015. "Multi-Objective Community Detection Based on Memetic Algorithm," PLOS ONE, Public Library of Science, vol. 10(5), pages 1-31, May.
    4. Wu, Yue & Gao, Lanlin & Zhang, Yi & Xiong, Xi, 2019. "Structural balance and dynamics over signed BA scale-free network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 866-877.
    5. Du, Haifeng & He, Xiaochen & Wang, Jingjing & Feldman, Marcus W., 2018. "Reversing structural balance in signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 780-792.
    6. Jean-Philippe Berrou & Alain Piveteau & Thibaud Deguilhem & Delpy Léo & Claire Gondard-Delcroix, 2020. "Qui pilote si personne ne gouverne ? La politique publique de protection sociale à Madagascar au prisme de l’analyse des réseaux sociaux," Working Papers hal-02918286, HAL.
    7. 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.

    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:465:y:2017:i:c:p:414-424. 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: (Haili He). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.