Optimal strategies for targeted influence in signed networks

Basak Guler, Burak Varan, Kaya Tutuncuoglu, Mohamed Nafea, Ahmed A. Zewail, Aylin Yener, Damien Octeau

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Citations (Scopus)

    Abstract

    Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Network applications can benefit from accompanying these structural differences in propagation schemes. In this paper, we study the optimal influence propagation policies for networks with positive and negative relationship types. We tackle the problem of minimizing the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as frequency of interaction, the strength of friendship and foe ties, propagation delay or the impact factor of the propagating idea. We extend this problem by incorporating the impact of message deterioration and ignorance. We demonstrate our results in both a controlled environment and the Epinions dataset. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of influence propagation compared to naïve myopic algorithms.

    Original languageEnglish (US)
    Title of host publicationASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages906-911
    Number of pages6
    ISBN (Electronic)9781479958771
    DOIs
    StatePublished - Oct 10 2014
    Event2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2014 - Beijing, China
    Duration: Aug 17 2014Aug 20 2014

    Other

    Other2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2014
    CountryChina
    CityBeijing
    Period8/17/148/20/14

    Fingerprint

    Costs
    Deterioration

    All Science Journal Classification (ASJC) codes

    • Computer Networks and Communications
    • Computer Science Applications

    Cite this

    Guler, B., Varan, B., Tutuncuoglu, K., Nafea, M., Zewail, A. A., Yener, A., & Octeau, D. (2014). Optimal strategies for targeted influence in signed networks. In ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (pp. 906-911). [6921693] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASONAM.2014.6921693
    Guler, Basak ; Varan, Burak ; Tutuncuoglu, Kaya ; Nafea, Mohamed ; Zewail, Ahmed A. ; Yener, Aylin ; Octeau, Damien. / Optimal strategies for targeted influence in signed networks. ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 906-911
    @inproceedings{b2c537c07452470b86d24ab9c3ee5614,
    title = "Optimal strategies for targeted influence in signed networks",
    abstract = "Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Network applications can benefit from accompanying these structural differences in propagation schemes. In this paper, we study the optimal influence propagation policies for networks with positive and negative relationship types. We tackle the problem of minimizing the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as frequency of interaction, the strength of friendship and foe ties, propagation delay or the impact factor of the propagating idea. We extend this problem by incorporating the impact of message deterioration and ignorance. We demonstrate our results in both a controlled environment and the Epinions dataset. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of influence propagation compared to na{\"i}ve myopic algorithms.",
    author = "Basak Guler and Burak Varan and Kaya Tutuncuoglu and Mohamed Nafea and Zewail, {Ahmed A.} and Aylin Yener and Damien Octeau",
    year = "2014",
    month = "10",
    day = "10",
    doi = "10.1109/ASONAM.2014.6921693",
    language = "English (US)",
    pages = "906--911",
    booktitle = "ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    Guler, B, Varan, B, Tutuncuoglu, K, Nafea, M, Zewail, AA, Yener, A & Octeau, D 2014, Optimal strategies for targeted influence in signed networks. in ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining., 6921693, Institute of Electrical and Electronics Engineers Inc., pp. 906-911, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2014, Beijing, China, 8/17/14. https://doi.org/10.1109/ASONAM.2014.6921693

    Optimal strategies for targeted influence in signed networks. / Guler, Basak; Varan, Burak; Tutuncuoglu, Kaya; Nafea, Mohamed; Zewail, Ahmed A.; Yener, Aylin; Octeau, Damien.

    ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. Institute of Electrical and Electronics Engineers Inc., 2014. p. 906-911 6921693.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Optimal strategies for targeted influence in signed networks

    AU - Guler, Basak

    AU - Varan, Burak

    AU - Tutuncuoglu, Kaya

    AU - Nafea, Mohamed

    AU - Zewail, Ahmed A.

    AU - Yener, Aylin

    AU - Octeau, Damien

    PY - 2014/10/10

    Y1 - 2014/10/10

    N2 - Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Network applications can benefit from accompanying these structural differences in propagation schemes. In this paper, we study the optimal influence propagation policies for networks with positive and negative relationship types. We tackle the problem of minimizing the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as frequency of interaction, the strength of friendship and foe ties, propagation delay or the impact factor of the propagating idea. We extend this problem by incorporating the impact of message deterioration and ignorance. We demonstrate our results in both a controlled environment and the Epinions dataset. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of influence propagation compared to naïve myopic algorithms.

    AB - Online social communities often exhibit complex relationship structures, ranging from close friends to political rivals. As a result, persons are influenced by their friends and foes differently. Network applications can benefit from accompanying these structural differences in propagation schemes. In this paper, we study the optimal influence propagation policies for networks with positive and negative relationship types. We tackle the problem of minimizing the end-to-end propagation cost of influencing a target person in favor of an idea by utilizing the relationship types in the underlying social graph. The propagation cost is incurred by social and physical network dynamics such as frequency of interaction, the strength of friendship and foe ties, propagation delay or the impact factor of the propagating idea. We extend this problem by incorporating the impact of message deterioration and ignorance. We demonstrate our results in both a controlled environment and the Epinions dataset. Our results show that judicious propagation schemes lead to a significant reduction in the average cost and complexity of influence propagation compared to naïve myopic algorithms.

    UR - http://www.scopus.com/inward/record.url?scp=84911127018&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84911127018&partnerID=8YFLogxK

    U2 - 10.1109/ASONAM.2014.6921693

    DO - 10.1109/ASONAM.2014.6921693

    M3 - Conference contribution

    AN - SCOPUS:84911127018

    SP - 906

    EP - 911

    BT - ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -

    Guler B, Varan B, Tutuncuoglu K, Nafea M, Zewail AA, Yener A et al. Optimal strategies for targeted influence in signed networks. In ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. Institute of Electrical and Electronics Engineers Inc. 2014. p. 906-911. 6921693 https://doi.org/10.1109/ASONAM.2014.6921693