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

A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity

Author

Listed:
  • Yuan, Yelie
  • Yan, Jun
  • Zhang, Panpan

Abstract

Degree-preserving rewiring is a widely used technique for generating unweighted networks with given assortativity, but for weighted networks, it is unclear how an analog would preserve the strengths and other critical network features such as sparsity level. This study introduces a novel approach for rewiring weighted networks to achieve desired directed assortativity. The method utilizes a mixed integer programming framework to establish a target network with predetermined assortativity coefficients, followed by an efficient rewiring algorithm termed “strength and sparsity preserving rewiring” (SSPR). SSPR retains the node strength distributions and network sparsity after rewiring. It is also possible to accommodate additional properties like edge weight distribution, albeit with extra computational cost. The optimization scheme can be used to determine feasible assortativity ranges for an initial network. The effectiveness of the proposed SSPR algorithm is demonstrated through its application to two classes of popular network models.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:phsmap:v:638:y:2024:i:c:s0378437124001420
    DOI: 10.1016/j.physa.2024.129634
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124001420
    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
    File URL: https://libkey.io/10.1016/j.physa.2024.129634?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. 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. 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.
    2. 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).
    3. M. L. Bertotti & G. Modanese, 2019. "The Bass Diffusion Model on Finite Barabasi-Albert Networks," Complexity, Hindawi, vol. 2019, pages 1-12, April.
    4. 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.
    5. 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).
    6. 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).
    7. 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.
    8. 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.

    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:638:y:2024:i:c:s0378437124001420. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.