IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i18p2815-d1475941.html
   My bibliography  Save this article

An Efficient and Automatic Simplification Method for Arbitrary Complex Networks in Mine Ventilation

Author

Listed:
  • Deyun Zhong

    (School of Resources and Safety Engineering, Central South University, Changsha 410083, China
    State Key Laboratory for Fine Exploration and Intelligent Development of Coal Resources, China University of Mining and Technology, No. 1 University Road, Xuzhou 221116, China
    Changsha DIMINE Co., Ltd., Changsha 410221, China)

  • Lixue Wen

    (School of Resources and Safety Engineering, Central South University, Changsha 410083, China)

  • Lin Bi

    (School of Resources and Safety Engineering, Central South University, Changsha 410083, China
    State Key Laboratory for Fine Exploration and Intelligent Development of Coal Resources, China University of Mining and Technology, No. 1 University Road, Xuzhou 221116, China
    Changsha DIMINE Co., Ltd., Changsha 410221, China)

  • Yulong Liu

    (School of Resources and Safety Engineering, Central South University, Changsha 410083, China)

Abstract

The simplification of complex networks is a research field closely related to graph theory in discrete mathematics. The existing methods are typically limited to simplifying the series sub-networks, parallel sub-networks, diagonal sub-networks, and nested simple sub-networks. From the current perspective, there are no available methods that can handle complex sub-networks and nested complex sub-networks. In this paper, we innovatively propose an efficient and automatic equivalence simplification method for arbitrary complex ventilation networks. The method enables, for the first time, the maximum possible equivalence simplification of nested simple sub-networks and nested complex sub-networks. In order to avoid the NP-hard problem caused by the searching of simplifiable sub-networks, it is necessary to analyze the intrinsic topology relationship between simplifiable sub-networks and spanning sub-graphs to optimize the searching process. One of our main contributions is that we present an efficient searching method for arbitrarily nested reducible sub-networks based on the bidirectional traversal process of a directed tree. The method optimizes the searching process for simplifiable node pairs by combining the characteristics of a directed tree with the judgment rules of simplifiable sub-networks. Moreover, by deriving the formula of an equivalent air resistance calculation for complex sub-networks, another one of our main contributions is that we present an equivalent calculation and simplification method for arbitrarily complex sub-networks based on the principle of energy conservation. The basic idea of the method is to calculate the equivalent air resistance using the ventilation network resolution of the constructed virtual sub-networks. We realize the simplification method of arbitrarily complex mine ventilation networks, and we validate the reliability of the simplification method by comparing the air distribution results using the network solution method before and after simplification. It can be determined that, with appropriate modifications to meet specific requirements, the proposed method can also be applicable to equivalent simplification instances of other types of complex networks. Based on the results analysis of several real-world mine ventilation network examples, the effectiveness of the proposed method is further verified, which can satisfactorily meet the requirements for simplifying complex networks.

Suggested Citation

  • Deyun Zhong & Lixue Wen & Lin Bi & Yulong Liu, 2024. "An Efficient and Automatic Simplification Method for Arbitrary Complex Networks in Mine Ventilation," Mathematics, MDPI, vol. 12(18), pages 1-17, September.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2815-:d:1475941
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2815/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/18/2815/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Caldarelli, Guido, 2007. "Scale-Free Networks: Complex Webs in Nature and Technology," OUP Catalogue, Oxford University Press, number 9780199211517.
    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. Diego Garlaschelli & Maria I. Loffredo, 2007. "Effects of network topology on wealth distributions," Papers 0711.4710, arXiv.org, revised Jan 2008.
    2. Ya-Chun Gao & Zong-Wen Wei & Bing-Hong Wang, 2013. "Dynamic Evolution Of Financial Network And Its Relation To Economic Crises," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 1-10.
    3. Hutzler, S. & Sommer, C. & Richmond, P., 2016. "On the relationship between income, fertility rates and the state of democracy in society," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 9-18.
    4. Andreas Koulouris & Ioannis Katerelos & Theodore Tsekeris, 2013. "Multi-Equilibria Regulation Agent-Based Model of Opinion Dynamics in Social Networks," Interdisciplinary Description of Complex Systems - scientific journal, Croatian Interdisciplinary Society Provider Homepage: http://indecs.eu, vol. 11(1), pages 51-70.
    5. Macon, Kevin T. & Mucha, Peter J. & Porter, Mason A., 2012. "Community structure in the United Nations General Assembly," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 343-361.
    6. Tsekeris, Theodore, 2016. "Interregional trade network analysis for road freight transport in Greece," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 132-148.
    7. F. Daolio & M. Tomassini & K. Bitkov, 2011. "The Swiss board directors network in 2009," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 82(3), pages 349-359, August.
    8. Cui, Yaozu & Wang, Xingyuan & Eustace, Justine, 2014. "Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 198-207.
    9. Shekhtman, Louis M. & Danziger, Michael M. & Havlin, Shlomo, 2016. "Recent advances on failure and recovery in networks of networks," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 28-36.
    10. Gabriele Ranco & Ilaria Bordino & Giacomo Bormetti & Guido Caldarelli & Fabrizio Lillo & Michele Treccani, 2014. "Coupling news sentiment with web browsing data improves prediction of intra-day price dynamics," Papers 1412.3948, arXiv.org, revised Dec 2015.
    11. Wang, Zhenggang & Szeto, K.Y., 2010. "Structure profile of complex networks by a model of precipitation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(11), pages 2318-2324.
    12. Mohammad Ariapour & Ehsan Nedaaee Oskoee, 2013. "Constructing Scale-Free Networks With A Given Cluster Coefficient," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 1-14.
    13. Roy Cerqueti & Giulia Rotundo & Marcel Ausloos, 2021. "Tsallis entropy for cross-shareholding network configurations," Papers 2109.04214, arXiv.org.
    14. Danilo Delpini & Stefano Battiston & Guido Caldarelli & Massimo Riccaboni, 2019. "Systemic risk from investment similarities," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-15, May.
    15. Roberto Antonietti & Giulia De Masi & Giorgio Ricchiuti, 2020. "Linking FDI Network Topology with the Covid-19 Pandemic," Papers in Evolutionary Economic Geography (PEEG) 2054, Utrecht University, Department of Human Geography and Spatial Planning, Group Economic Geography, revised Nov 2020.
    16. Brancaccio, Emiliano & Giammetti, Raffaele & Lopreite, Milena & Puliga, Michelangelo, 2019. "Monetary policy, crisis and capital centralization in corporate ownership and control networks: A B-Var analysis," Structural Change and Economic Dynamics, Elsevier, vol. 51(C), pages 55-66.
    17. Alessandro Chessa & Pierpaolo D’Urso & Livia Giovanni & Vincenzina Vitale & Alfonso Gebbia, 2023. "Complex networks for community detection of basketball players," Annals of Operations Research, Springer, vol. 325(1), pages 363-389, June.
    18. Giorgio Fagiolo & Tiziano Squartini & Diego Garlaschelli, 2013. "Null models of economic networks: the case of the world trade web," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 8(1), pages 75-107, April.
    19. Andrey Sokolov & Rachel Webster & Andrew Melatos & Tien Kieu, 2012. "Loan and nonloan flows in the Australian interbank network," Papers 1202.3182, arXiv.org.
    20. Ding, Jie & Wen, Changyun & Li, Guoqi, 2017. "Key node selection in minimum-cost control of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 251-261.

    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:gam:jmathe:v:12:y:2024:i:18:p:2815-:d:1475941. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.