IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/1382980.html
   My bibliography  Save this article

The Minimum Spectral Radius of an Edge-Removed Network: A Hypercube Perspective

Author

Listed:
  • Yingbo Wu
  • Tianrui Zhang
  • Shan Chen
  • Tianhui Wang

Abstract

The spectral radius minimization problem (SRMP), which aims to minimize the spectral radius of a network by deleting a given number of edges, turns out to be crucial to containing the prevalence of an undesirable object on the network. As the SRMP is NP-hard, it is very unlikely that there is a polynomial-time algorithm for it. As a result, it is proper to focus on the development of effective and efficient heuristic algorithms for the SRMP. For that purpose, it is appropriate to gain insight into the pattern of an optimal solution to the SRMP by means of checking some regular networks. Hypercubes are a celebrated class of regular networks. This paper empirically studies the SRMP for hypercubes with two/three/four missing edges. First, for each of the three subproblems of the SRMP, a candidate for the optimal solution is presented. Second, it is shown that the candidate is optimal for small-sized hypercubes, and it is shown that the proposed candidate is likely to be optimal for medium-sized hypercubes. The edges in each candidate are evenly distributed over the network, which may be a common feature of all symmetric networks and hence is instructive in designing effective heuristic algorithms for the SRMP.

Suggested Citation

  • Yingbo Wu & Tianrui Zhang & Shan Chen & Tianhui Wang, 2017. "The Minimum Spectral Radius of an Edge-Removed Network: A Hypercube Perspective," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-8, April.
    • Handle: RePEc:hin:jnddns:1382980
    DOI: 10.1155/2017/1382980
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2017/1382980.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2017/1382980.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/1382980?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. Tzu-Liang Kung & Cheng-Kuan Lin & Lih-Hsing Hsu, 2014. "On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 328-344, February.
    2. Lu-Xing Yang & Xiaofan Yang, 2015. "A Novel Virus-Patch Dynamic Model," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-16, September.
    3. Xiaofan Yang & Pengdeng Li & Lu-Xing Yang & Yingbo Wu, 2016. "Reducing the Spectral Radius of a Torus Network by Link Removal," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-15, May.
    4. P. Van Mieghem & H. Wang & X. Ge & S. Tang & F. A. Kuipers, 2010. "Influence of assortativity and degree-preserving rewiring on the spectra of networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 76(4), pages 643-652, August.
    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. Kim, Kwang Su & Ibrahim, Malik Muhammad & Jung, Il Hyo & Kim, Sangil, 2020. "Mathematical analysis of the effectiveness of control strategies to prevent the autorun virus transmission propagation," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    2. Li, Yinwei & Jiang, Guo-Ping & Wu, Meng & Song, Yu-Rong & Wang, Haiyan, 2021. "Undirected Congruence Model: Topological characteristics and epidemic spreading," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    3. Hailu Yang & Deyun Chen & Guanglu Sun & Xiaoyu Ding & Yu Xin, 2019. "CC 2 : Defending Hybrid Worm on Mobile Networks with Two-Dimensional Circulation Control," Complexity, Hindawi, vol. 2019, pages 1-19, December.
    4. Wang, Xiangrong & Trajanovski, Stojan & Kooij, Robert E. & Van Mieghem, Piet, 2016. "Degree distribution and assortativity in line graphs of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 445(C), pages 343-356.
    5. Arcagni, Alberto & Cerqueti, Roy & Grassi, Rosanna, 2024. "Higher-order assortativity for directed weighted networks and Markov chains," European Journal of Operational Research, Elsevier, vol. 316(1), pages 215-227.
    6. Arcagni, Alberto & Grassi, Rosanna & Stefani, Silvana & Torriero, Anna, 2021. "Extending assortativity: An application to weighted social networks," Journal of Business Research, Elsevier, vol. 129(C), pages 774-783.
    7. Arcagni, Alberto & Grassi, Rosanna & Stefani, Silvana & Torriero, Anna, 2017. "Higher order assortativity in complex networks," European Journal of Operational Research, Elsevier, vol. 262(2), pages 708-719.
    8. Wang, Dong & Small, Michael & Zhao, Yi, 2021. "Exploring the optimal network topology for spreading dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    9. M. L. Bertotti & G. Modanese, 2019. "The Bass Diffusion Model on Finite Barabasi-Albert Networks," Complexity, Hindawi, vol. 2019, pages 1-12, April.
    10. Yuan, Yelie & Yan, Jun & Zhang, Panpan, 2024. "A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 638(C).
    11. Tomassini, Marco, 2023. "Rewiring or adding links: A real-world case study of network vulnerability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).

    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:hin:jnddns:1382980. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.