Some empirical and theoretical attributes of random multi-hooking networks

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-11-02 DOI:10.1080/23799927.2023.2278098
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud, Achuna Ofonedu
{"title":"Some empirical and theoretical attributes of random multi-hooking networks","authors":"Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud, Achuna Ofonedu","doi":"10.1080/23799927.2023.2278098","DOIUrl":null,"url":null,"abstract":"AbstractMulti-hooking networks are a broad class of random hooking networks introduced in [8] wherein multiple copies of a seed are hooked at each step, and the number of copies follows a predetermined building sequence of numbers. For motivation, we provide two examples: one from chemistry and one from electrical engineering. We explore the empirical and theoretical local degree distribution of a specific node during its temporal evolution. We ask what will happen to the degree of a specific node at step n that first appeared in the network at step j. We conducted an experimental study to identify some cases with Gaussian asymptotic distributions, which we then proved. Additionally, we investigate the distance in the network through the lens of the average Wiener index for which we obtain a theoretical result for any building sequence and explore its empirical distribution for certain classes of building sequences that have systematic growth.Keywords: Networksrandom graphsdegree profileWiener indexrecurrenceasymptotic analysisAMS subject classifications:: Primary: 05C82Secondary: 05C1260C0560F0590B15DisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgmentsThe authors would like to thank Dominic Abela for developing and designing the initial prototype of an interactive application.Data availability statementThe data that support the findings of this study are available from the corresponding author upon reasonable request.Notes1 MapleTM is a trademark of Waterloo Maple Inc.2 Note that this theorem does not require the regularity conditions needed in theorem 1; the building sequence is entirely arbitrary.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2023.2278098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

AbstractMulti-hooking networks are a broad class of random hooking networks introduced in [8] wherein multiple copies of a seed are hooked at each step, and the number of copies follows a predetermined building sequence of numbers. For motivation, we provide two examples: one from chemistry and one from electrical engineering. We explore the empirical and theoretical local degree distribution of a specific node during its temporal evolution. We ask what will happen to the degree of a specific node at step n that first appeared in the network at step j. We conducted an experimental study to identify some cases with Gaussian asymptotic distributions, which we then proved. Additionally, we investigate the distance in the network through the lens of the average Wiener index for which we obtain a theoretical result for any building sequence and explore its empirical distribution for certain classes of building sequences that have systematic growth.Keywords: Networksrandom graphsdegree profileWiener indexrecurrenceasymptotic analysisAMS subject classifications:: Primary: 05C82Secondary: 05C1260C0560F0590B15DisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgmentsThe authors would like to thank Dominic Abela for developing and designing the initial prototype of an interactive application.Data availability statementThe data that support the findings of this study are available from the corresponding author upon reasonable request.Notes1 MapleTM is a trademark of Waterloo Maple Inc.2 Note that this theorem does not require the regularity conditions needed in theorem 1; the building sequence is entirely arbitrary.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随机多钩网络的一些经验和理论属性
【摘要】多钩子网络是[8]中引入的一类广泛的随机钩子网络,其中在每一步都钩住一个种子的多个副本,并且副本的数量遵循预定的构建序列。为了激励,我们提供两个例子:一个来自化学,一个来自电气工程。我们探索了特定节点在时间演化过程中的经验和理论局部度分布。我们的问题是,在步骤n的特定节点在步骤j的网络中首次出现的程度会发生什么。我们进行了一项实验研究,以确定高斯渐近分布的一些情况,然后我们证明了这一点。此外,我们通过平均维纳指数的透镜来研究网络中的距离,我们获得了任何建筑序列的理论结果,并探索了具有系统增长的某些类别的建筑序列的经验分布。关键词:网络随机图度谱wiener索引递归性分析ams主题分类:初级:0582次级:051260c0560f0590b15免责声明作为对作者和研究人员的服务,我们提供此版本的接受稿件(AM)。在最终出版版本记录(VoR)之前,将对该手稿进行编辑、排版和审查。在制作和印前,可能会发现可能影响内容的错误,所有适用于期刊的法律免责声明也与这些版本有关。作者要感谢Dominic Abela开发和设计了交互式应用程序的初始原型。数据可得性声明支持本研究结果的数据可根据通讯作者的合理要求获得。注1 MapleTM是Waterloo Maple inc .的商标。注:此定理不需要定理1所需要的正则性条件;建筑顺序完全是任意的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
期刊最新文献
On Hendecagonal Circular Ladder and its Metric Dimension Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Line Segment Arrangements Improved Approximate Dispersion Relation Analysis Using Deep Neural Network A key exchange protocol and a cryptosystem based on the generalized decomposition problem Real iterative algorithms for solving a complex matrix equation with two unknowns
×
引用
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