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

IF 2.3 3区 数学 Q1 MATHEMATICS Mathematics Pub Date : 2024-09-11 DOI:10.3390/math12182815
Deyun Zhong, Lixue Wen, Lin Bi, Yulong Liu
{"title":"An Efficient and Automatic Simplification Method for Arbitrary Complex Networks in Mine Ventilation","authors":"Deyun Zhong, Lixue Wen, Lin Bi, Yulong Liu","doi":"10.3390/math12182815","DOIUrl":null,"url":null,"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.","PeriodicalId":18303,"journal":{"name":"Mathematics","volume":"37 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3390/math12182815","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
矿井通风中任意复杂网络的高效自动简化方法
复杂网络的简化是一个与离散数学中的图论密切相关的研究领域。现有方法通常仅限于简化串联子网络、并联子网络、对角线子网络和嵌套简单子网络。从目前来看,还没有可用的方法可以处理复杂子网和嵌套复杂子网。在本文中,我们创新性地提出了一种适用于任意复杂通风网络的高效自动等价简化方法。该方法首次实现了嵌套简单子网络和嵌套复杂子网络的最大等价简化。为了避免因搜索可简化子网而导致的 NP-困难问题,有必要分析可简化子网和跨度子网之间的内在拓扑关系,以优化搜索过程。我们的主要贡献之一是提出了一种基于有向树双向遍历过程的任意嵌套可简化子网的高效搜索方法。该方法结合有向树的特点和可简化子网的判断规则,优化了可简化节点对的搜索过程。此外,通过推导复杂子网的等效空气阻力计算公式,我们的另一个主要贡献是提出了一种基于能量守恒原理的任意复杂子网的等效计算和简化方法。该方法的基本思想是利用所构建的虚拟子网络的通风网络分辨率来计算等效空气阻力。我们实现了任意复杂矿井通风网络的简化方法,并通过比较简化前后网络求解法的配风结果,验证了简化方法的可靠性。可以确定,只要根据具体要求进行适当修改,所提出的方法也可适用于其他类型复杂网络的等效简化实例。通过对多个实际矿井通风网络实例的结果分析,进一步验证了所提方法的有效性,能够满足简化复杂网络的要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematics
Mathematics Mathematics-General Mathematics
CiteScore
4.00
自引率
16.70%
发文量
4032
审稿时长
21.9 days
期刊介绍: Mathematics (ISSN 2227-7390) is an international, open access journal which provides an advanced forum for studies related to mathematical sciences. It devotes exclusively to the publication of high-quality reviews, regular research papers and short communications in all areas of pure and applied mathematics. Mathematics also publishes timely and thorough survey articles on current trends, new theoretical techniques, novel ideas and new mathematical tools in different branches of mathematics.
期刊最新文献
A Privacy-Preserving Electromagnetic-Spectrum-Sharing Trading Scheme Based on ABE and Blockchain Three Weak Solutions for a Critical Non-Local Problem with Strong Singularity in High Dimension LMKCDEY Revisited: Speeding Up Blind Rotation with Signed Evaluation Keys A New Instance Segmentation Model for High-Resolution Remote Sensing Images Based on Edge Processing AssocKD: An Association-Aware Knowledge Distillation Method for Document-Level Event Argument Extraction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1