随机指数递归树的萨格勒布指数和维纳指数的极限规律

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Foundations of Computer Science Pub Date : 2024-06-08 DOI:10.1142/s0129054124500060
Ali Q. M. Al-Saedi, R. I. Nabiyyi, M. Javanian
{"title":"随机指数递归树的萨格勒布指数和维纳指数的极限规律","authors":"Ali Q. M. Al-Saedi, R. I. Nabiyyi, M. Javanian","doi":"10.1142/s0129054124500060","DOIUrl":null,"url":null,"abstract":"The Wiener index is the sum of distances of all pairs of nodes in a graph; and the Zagreb index is defined as the sum of squares of the degrees of nodes in a rooted tree. In this note, we calculate the first two moments of the Wiener and Zagreb indices of random exponential recursive trees (random ERTs) from two systems of recurrence relations. Then, by an application of the contraction method, we characterize the limit law for a scaled Zagreb index of ERTs. Via the martingale convergence theorem, we also show the almost sure convergence and quadratic mean convergence of an appropriately scaled Wiener index that is indicative of the distance of two randomly chosen nodes.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees\",\"authors\":\"Ali Q. M. Al-Saedi, R. I. Nabiyyi, M. Javanian\",\"doi\":\"10.1142/s0129054124500060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Wiener index is the sum of distances of all pairs of nodes in a graph; and the Zagreb index is defined as the sum of squares of the degrees of nodes in a rooted tree. In this note, we calculate the first two moments of the Wiener and Zagreb indices of random exponential recursive trees (random ERTs) from two systems of recurrence relations. Then, by an application of the contraction method, we characterize the limit law for a scaled Zagreb index of ERTs. Via the martingale convergence theorem, we also show the almost sure convergence and quadratic mean convergence of an appropriately scaled Wiener index that is indicative of the distance of two randomly chosen nodes.\",\"PeriodicalId\":50323,\"journal\":{\"name\":\"International Journal of Foundations of Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Foundations of Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054124500060\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1142/s0129054124500060","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

维纳指数是图中所有节点对的距离之和;而萨格勒布指数的定义是有根树上节点度数的平方和。在本论文中,我们将从两个递推关系系统中计算随机指数递推树(随机 ERT)的维纳指数和萨格勒布指数的前两个矩。然后,通过应用收缩法,我们确定了随机递推树的萨格勒布指数的极限规律。通过马氏收敛定理,我们还证明了适当缩放的维纳指数的几乎确定收敛性和二次平均收敛性,该指数可指示两个随机选择节点的距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees
The Wiener index is the sum of distances of all pairs of nodes in a graph; and the Zagreb index is defined as the sum of squares of the degrees of nodes in a rooted tree. In this note, we calculate the first two moments of the Wiener and Zagreb indices of random exponential recursive trees (random ERTs) from two systems of recurrence relations. Then, by an application of the contraction method, we characterize the limit law for a scaled Zagreb index of ERTs. Via the martingale convergence theorem, we also show the almost sure convergence and quadratic mean convergence of an appropriately scaled Wiener index that is indicative of the distance of two randomly chosen nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science 工程技术-计算机:理论方法
CiteScore
1.60
自引率
12.50%
发文量
63
审稿时长
3 months
期刊介绍: The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing
期刊最新文献
The 4-Set Tree Connectivity of Folded Hypercube An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem State Complexity of Boolean Operations on Graph-Walking Automata Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets
×
引用
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