IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1005591.html
   My bibliography  Save this article

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle

Author

Listed:
  • David L Gibbs
  • Ilya Shmulevich

Abstract

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.Author summary: The Influence Maximization Problem (IMP) has been applied in fields such as epidemiology and social network analysis. Here, we apply the method to biological networks, aiming to discover the set of regulatory genes with the greatest influence on network dynamics. Fundamentally, since gene regulation is linked to the flow of information, we framed the IMP as an information theoretic problem. Dynamics were encoded as edge weights using time lagged transfer entropy, a quantity that attempts to quantify information transfer across variables. The influential nodes act as critical sources of information flow, potentially affecting the global network state. Biological events that impact the influential nodes and thereby affecting normal information flow could have a strong effect on the network, potentially leading to disease.

Suggested Citation

  • David L Gibbs & Ilya Shmulevich, 2017. "Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle," PLOS Computational Biology, Public Library of Science, vol. 13(6), pages 1-19, June.
    • Handle: RePEc:plo:pcbi00:1005591
    DOI: 10.1371/journal.pcbi.1005591
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1005591
    Download Restriction: no
    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1005591&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pcbi.1005591?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
    ---><---

    References listed on IDEAS

    as
    1. Noah J Cowan & Erick J Chastain & Daril A Vilhena & James S Freudenberg & Carl T Bergstrom, 2012. "Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-5, June.
    2. Michael Wibral & Nicolae Pampu & Viola Priesemann & Felix Siebenhühner & Hannes Seiwert & Michael Lindner & Joseph T Lizier & Raul Vicente, 2013. "Measuring Information-Transfer Delays," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-19, February.
    3. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    4. Dawson, D. A., 1975. "Information flow in graphs," Stochastic Processes and their Applications, Elsevier, vol. 3(2), pages 137-151, April.
    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. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.

    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. Chen, Dandan & Zheng, Muhua & Zhao, Ming & Zhang, Yu, 2018. "A dynamic vaccination strategy to suppress the recurrent epidemic outbreaks," Chaos, Solitons & Fractals, Elsevier, vol. 113(C), pages 108-114.
    2. Fink, Christian G. & Fullin, Kelly & Gutierrez, Guillermo & Omodt, Nathan & Zinnecker, Sydney & Sprint, Gina & McCulloch, Sean, 2023. "A centrality measure for quantifying spread on weighted, directed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    3. Yin, Haofei & Cui, Xiaohua & Zeng, An, 2024. "An innovative defense strategy against targeted spreading in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 654(C).
    4. Kyu-Min Lee & Kwang-Il Goh, 2016. "Strength of weak layers in cascading failures on multiplex networks: case of the international trade network," Papers 1603.05181, arXiv.org, revised May 2016.
    5. Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2018. "Group based centrality for immunization of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 35-47.
    6. Gangwal, Utkarsh & Singh, Mayank & Pandey, Pradumn Kumar & Kamboj, Deepak & Chatterjee, Samrat & Bhatia, Udit, 2022. "Identifying early-warning indicators of onset of sudden collapse in networked infrastructure systems against sequential disruptions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    7. Wenguo Yang & Shengminjie Chen & Suixiang Gao & Ruidong Yan, 2020. "Boosting node activity by recommendations in social networks," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 825-847, October.
    8. Chen, Shi-Ming & Xu, Yun-Fei & Nie, Sen, 2017. "Robustness of network controllability in cascading failure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 536-539.
    9. Xiaodong Liu & Xiangke Liao & Shanshan Li & Si Zheng & Bin Lin & Jingying Zhang & Lisong Shao & Chenlin Huang & Liquan Xiao, 2017. "On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks," Complexity, Hindawi, vol. 2017, pages 1-14, September.
    10. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    11. Zhang, Jun-li & Fu, Yan-jun & Cheng, Lan & Yang, Yun-yun, 2021. "Identifying multiple influential spreaders based on maximum connected component decomposition method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    12. Wandelt, Sebastian & Sun, Xiaoqian & Zhang, Anming, 2023. "Towards analyzing the robustness of the Integrated Global Transportation Network Abstraction (IGTNA)," Transportation Research Part A: Policy and Practice, Elsevier, vol. 178(C).
    13. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    14. Feng, Xiangnan & Wei, Wei & Zhang, Renquan & Wang, Jiannan & Shi, Ying & Zheng, Zhiming, 2019. "Exploring the heterogeneity for node importance byvon Neumann entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 517(C), pages 53-65.
    15. Li, Sheng & Liu, Wenwen & Wu, Ruizi & Li, Junli, 2023. "An adaptive attack model to network controllability," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    16. Deng, Ye & Wang, Zhigang & Xiao, Yu & Shen, Xiaoda & Kurths, Jürgen & Wu, Jun, 2025. "Spatial network disintegration based on spatial coverage," Reliability Engineering and System Safety, Elsevier, vol. 253(C).
    17. Coulibaly, Saliya & Bessin, Florent & Clerc, Marcel G. & Mussot, Arnaud, 2022. "Precursors-driven machine learning prediction of chaotic extreme pulses in Kerr resonators," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    18. James Flamino & Alessandro Galeazzi & Stuart Feldman & Michael W. Macy & Brendan Cross & Zhenkun Zhou & Matteo Serafino & Alexandre Bovet & Hernán A. Makse & Boleslaw K. Szymanski, 2023. "Political polarization of news media and influencers on Twitter in the 2016 and 2020 US presidential elections," Nature Human Behaviour, Nature, vol. 7(6), pages 904-916, June.
    19. Li Zeng & Changjun Fan & Chao Chen, 2023. "Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward Shaping," Mathematics, MDPI, vol. 11(17), pages 1-13, August.
    20. Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan & Medo, Matúš, 2020. "Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data," Journal of Informetrics, Elsevier, vol. 14(1).

    More about this item

    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:plo:pcbi00:1005591. 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: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    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.