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

Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms

Author

Listed:
  • Wentao Wu

    (Department of Industrial and Systems Engineering, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA)

  • Wai Kin Victor Chan

    (Department of Industrial and Systems Engineering, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA)

  • Lei Chi

    (EmblemHealth, 55 Water Street, NY 10041, USA)

  • Zhiguo Gong

    (Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Macao, P. R. China)

Abstract

This paper presents two semi-definite programming (SDP) based methods to solve the Key Player Problem (KPP). The KPP is to identify a set of k nodes (i.e., key players) from a social network of size n such that the number of nodes connected to these k nodes is maximized. The KPP has applications in social diffusion and products adoption as it helps maximizing information diffusion and impact. We first formulate the KPP as an integer program (IP) and then convert it into an SDP formulation, which can be solved efficiently and produce a set of high quality candidate solutions. We develop an IP-based algorithm and a stochastic search (greedy) algorithm to find the final solution for the KPP. We compare our algorithms with existing methods in small and large networks with different network structures, including random graph, scale-free network, and community-based scale-free network (CSN). Computational results show that our algorithms are more efficient in solving the KPP in all networks. In addition, we examine how the network structure influences the nodes coverage. It is found that CSNs allow the highest nodes coverage due to their community and scale-free structure.

Suggested Citation

  • Wentao Wu & Wai Kin Victor Chan & Lei Chi & Zhiguo Gong, 2017. "Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(03), pages 1-22, June.
    • Handle: RePEc:wsi:apjorx:v:34:y:2017:i:03:n:s0217595917500026
    DOI: 10.1142/S0217595917500026
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Hema Yoganarasimhan, 2012. "Impact of social network structure on content propagation: A study using YouTube data," Quantitative Marketing and Economics (QME), Springer, vol. 10(1), pages 111-150, March.
    2. Jie Xu & Edward Huang & Chun-Hung Chen & Loo Hay Lee, 2015. "Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(03), pages 1-34.
    3. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    4. Stephen P. Borgatti, 2006. "Identifying sets of key players in a social network," Computational and Mathematical Organization Theory, Springer, vol. 12(1), pages 21-34, April.
    Full references (including those not matched with items on IDEAS)

    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. Lindquist, Matthew J. & Zenou, Yves, 2019. "Crime and Networks: 10 Policy Lessons," IZA Discussion Papers 12534, Institute of Labor Economics (IZA).
    2. repec:hal:pseose:halshs-00977005 is not listed on IDEAS
    3. Ghulam Muhiuddin & Sovan Samanta & Abdulrahman F. Aljohani & Abeer M. Alkhaibari, 2023. "A Study on Graph Centrality Measures of Different Diseases Due to DNA Sequencing," Mathematics, MDPI, vol. 11(14), pages 1-18, July.
    4. Annamaria Ficara & Francesco Curreri & Giacomo Fiumara & Pasquale De Meo & Antonio Liotta, 2022. "Covert Network Construction, Disruption, and Resilience: A Survey," Mathematics, MDPI, vol. 10(16), pages 1-43, August.
    5. Michel Grabisch & Agnieszka Rusinowska, 2015. "Lattices in Social Networks with Influence," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 17(01), pages 1-18.
    6. Samadi, Mohammadreza & Nikolaev, Alexander & Nagi, Rakesh, 2016. "A subjective evidence model for influence maximization in social networks," Omega, Elsevier, vol. 59(PB), pages 263-278.
    7. Andrea Landherr & Bettina Friedl & Julia Heidemann, 2010. "A Critical Review of Centrality Measures in Social Networks," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 2(6), pages 371-385, December.
    8. Koster, Maurice & Lindner, Ines & Molina, Elisenda, 2010. "Networks and collective action," DES - Working Papers. Statistics and Econometrics. WS ws104830, Universidad Carlos III de Madrid. Departamento de Estadística.
    9. Mark J. O. Bagley, 2019. "Networks, geography and the survival of the firm," Journal of Evolutionary Economics, Springer, vol. 29(4), pages 1173-1209, September.
    10. Liu, Xiaodong & Patacchini, Eleonora & Zenou, Yves & Lee, Lung-Fei, 2011. "Criminal Networks: Who is the Key Player?," Research Papers in Economics 2011:7, Stockholm University, Department of Economics.
    11. Gabrielle Demange, 2018. "Contagion in Financial Networks: A Threat Index," Management Science, INFORMS, vol. 64(2), pages 955-970, February.
    12. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    13. Zhepeng Li & Xiao Fang & Xue Bai & Olivia R. Liu Sheng, 2017. "Utility-Based Link Recommendation for Online Social Networks," Management Science, INFORMS, vol. 63(6), pages 1938-1952, June.
    14. Vineet Kumar & K. Sudhir, 2019. "Can Friends Seed More Buzz and Adoption"," Cowles Foundation Discussion Papers 2178, Cowles Foundation for Research in Economics, Yale University.
    15. Shuang Xiao & Guo Li & Yunjing Jia, 2017. "Estimating the Constant Elasticity of Variance Model with Data-Driven Markov Chain Monte Carlo Methods," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(01), pages 1-23, February.
    16. Dequiedt, Vianney & Zenou, Yves, 2017. "Local and consistent centrality measures in parameterized networks," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 28-36.
    17. Hosseinali Salemi & Austin Buchanan, 2022. "Solving the Distance-Based Critical Node Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1309-1326, May.
    18. ,, 2014. "A ranking method based on handicaps," Theoretical Economics, Econometric Society, vol. 9(3), September.
    19. Ernest Liu & Aleh Tsyvinski, 2021. "Dynamical Structure and Spectral Properties of Input-Output Networks," Working Papers 2021-13, Princeton University. Economics Department..
    20. Raddant, Matthias & Takahashi, Hiroshi, 2019. "The Japanese corporate board network," Kiel Working Papers 2130, Kiel Institute for the World Economy (IfW Kiel).
    21. Bouveret, Géraldine & Mandel, Antoine, 2021. "Social interactions and the prophylaxis of SI epidemics on networks," Journal of Mathematical Economics, Elsevier, vol. 93(C).

    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:apjorx:v:34:y:2017:i:03:n:s0217595917500026. 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.

    If CitEc recognized a bibliographic 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.

    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/apjor/apjor.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.