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

Stochastic process rule-based Markov chain method for degree correlation of evolving networks

Author

Listed:
  • Xiao, Yue
  • Zhang, Xiaojun

Abstract

There is yet to be a unified theoretical framework for defining and solving degree correlation in evolving networks, which limits applied research in evolving networks. To address this problem, we proposed a stochastic process-based Markov chain method. The transition rules of network nodes and edges designed in this method ensure that the network topology and statistical characteristics at any time are the same as those in natural evolution. Then, the Markov chain model constructed based on this rule gives the theoretical results of the steady-state joint degree distribution of directed pure growth networks and corresponding undirected networks. Finally, the accuracy of the solution was verified by Monte Carlo simulation, and the probability functions of the joint degree distribution under different parameters were given. This work not only provides a theoretical research framework for the steady-state degree correlation of evolving networks for the first time but is also applicable to the study of many complex network evolution mechanisms and high-order statistical characteristics. In addition, this method can also study the transient degree correlation of networks at any time, providing a new perspective for network dynamics control.

Suggested Citation

  • Xiao, Yue & Zhang, Xiaojun, 2025. "Stochastic process rule-based Markov chain method for degree correlation of evolving networks," Chaos, Solitons & Fractals, Elsevier, vol. 196(C).
    • Handle: RePEc:eee:chsofr:v:196:y:2025:i:c:s0960077925004047
    DOI: 10.1016/j.chaos.2025.116391
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925004047
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2025.116391?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. Yu, Xiaoyao & Liang, Yongqing & Wang, Xiaomeng & Jia, Tao, 2021. "The network asymmetry caused by the degree correlation and its effect on the bimodality in control," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    2. Lotfi, Nastaran & Rodrigues, Francisco A., 2022. "On the effect of memory on the Prisoner’s Dilemma game in correlated networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(C).
    3. Oliver Williams & Charo I Del Genio, 2014. "Degree Correlations in Directed Scale-Free Networks," PLOS ONE, Public Library of Science, vol. 9(10), pages 1-6, October.
    4. Fotouhi, Babak & Rabbat, Michael, 2018. "Temporal evolution of the degree distribution of alters in growing networks," Network Science, Cambridge University Press, vol. 6(1), pages 97-155, March.
    5. Babak Fotouhi & Michael Rabbat, 2013. "Degree correlation in scale-free graphs," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 86(12), pages 1-19, December.
    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. M. L. Bertotti & G. Modanese, 2019. "The Bass Diffusion Model on Finite Barabasi-Albert Networks," Complexity, Hindawi, vol. 2019, pages 1-12, April.
    2. Matthew Eden & Rebecca Castonguay & Buyannemekh Munkhbat & Hari Balasubramanian & Chaitra Gopalappa, 2021. "Agent-based evolving network modeling: a new simulation method for modeling low prevalence infectious diseases," Health Care Management Science, Springer, vol. 24(3), pages 623-639, September.
    3. L. Lucchio & G. Modanese, 2024. "Diffusion on assortative networks: from mean-field to agent-based, via Newman rewiring," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 97(10), pages 1-15, October.
    4. Aloysius Suratin & Suyud Warno Utomo & Dwi Nowo Martono & Kosuke Mizuno, 2023. "Indonesia’s Renewable Natural Resource Management in the Low-Carbon Transition: A Conundrum in Changing Trajectories," Sustainability, MDPI, vol. 15(14), pages 1-17, July.
    5. Qing Cai & Mahardhika Pratama & Sameer Alam, 2019. "Interdependency and Vulnerability of Multipartite Networks under Target Node Attacks," Complexity, Hindawi, vol. 2019, pages 1-16, November.
    6. Yan Li & Carol Alexander & Michael Coulon & Istvan Kiss, 2025. "Trade Dynamics of the Global Dry Bulk Shipping Network," Papers 2502.00877, arXiv.org.
    7. Benoit Mahault & Avadh Saxena & Cristiano Nisoli, 2017. "Emergent inequality and self-organized social classes in a network of power and frustration," PLOS ONE, Public Library of Science, vol. 12(2), pages 1-23, February.
    8. Matteo Smerlak & Brady Stoll & Agam Gupta & James S Magdanz, 2015. "Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-15, July.
    9. Min, Yong & Zhou, Yuying & Liu, Yuhang & Zhang, Jian & Xuan, Qi & Jin, Xiaogang & Cai, He, 2021. "The role of degree correlation in shaping filter bubbles in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    10. Jose L. Salmeron & Marisol B. Correia & Pedro R. Palos-Sanchez, 2019. "Complexity in Forecasting and Predictive Models," Complexity, Hindawi, vol. 2019, pages 1-3, June.
    11. Giovanni Modanese, 2023. "The Network Bass Model with Behavioral Compartments," Stats, MDPI, vol. 6(2), pages 1-13, March.
    12. Takahara, Akihiro & Sakiyama, Tomoko, 2025. "Leveraging surrounding past strategies to maintain cooperation in the perverse prisoner's dilemma," Applied Mathematics and Computation, Elsevier, vol. 493(C).
    13. Laura Di Lucchio & Giovanni Modanese, 2024. "Generation of Scale-Free Assortative Networks via Newman Rewiring for Simulation of Diffusion Phenomena," Stats, MDPI, vol. 7(1), pages 1-15, February.
    14. Liu, Jie & Schonfeld, Paul M. & Shuai, Chunyan & He, Mingwei & Wang, Kelvin C.P., 2022. "The controllability of China’s high-speed rail network in terms of delivering emergency supplies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    15. Tu, Jin-cheng & Lu, Hou-qing & Lu, Tian-ming & Xie, Zong-qiao & Lu, Lei & Wei, Lingxiang, 2024. "A graphical criterion for the controllability in temporal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 646(C).
    16. Xiao Zhou & Lu Huang & Yi Zhang & Miaomiao Yu, 2019. "A hybrid approach to detecting technological recombination based on text mining and patent network analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 121(2), pages 699-737, November.
    17. Duan, Yuxian & Huang, Jian & Zhang, Jiarui, 2023. "Evolutionary public good games based on the long-term payoff mechanism in heterogeneous networks," Chaos, Solitons & Fractals, Elsevier, vol. 174(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:eee:chsofr:v:196:y:2025:i:c:s0960077925004047. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.