Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups

IF 0.6 3区 数学 Q3 MATHEMATICS Journal of Algebraic Combinatorics Pub Date : 2024-02-25 DOI:10.1007/s10801-024-01302-5
Maksim Vaskouski, Hanna Zadarazhniuk
{"title":"Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups","authors":"Maksim Vaskouski, Hanna Zadarazhniuk","doi":"10.1007/s10801-024-01302-5","DOIUrl":null,"url":null,"abstract":"<p>We consider networks on minimal Cayley graphs of irreducible complex reflection groups <i>G</i>(<i>m</i>, <i>p</i>, <i>n</i>). We show that resistance diameters of these graphs have asymptotic <span>\\(\\Theta (1/n)\\)</span> as <span>\\(n\\rightarrow \\infty \\)</span> under fixed <i>m</i>, <i>p</i>. Non-trivial lower and upper asymptotic bounds for critical probabilities of percolation for there appearing a giant connected component have been obtained.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"26 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01302-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider networks on minimal Cayley graphs of irreducible complex reflection groups G(mpn). We show that resistance diameters of these graphs have asymptotic \(\Theta (1/n)\) as \(n\rightarrow \infty \) under fixed m, p. Non-trivial lower and upper asymptotic bounds for critical probabilities of percolation for there appearing a giant connected component have been obtained.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不可还原复反射群上 Cayley 图的电阻直径和临界概率
我们考虑了不可还原复反射群 G(m,p,n)的最小 Cayley 图上的网络。我们证明,在固定的 m、p 条件下,这些图的阻力直径具有渐近的 \(\Theta (1/n)\) as \(n\rightarrow \infty \)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.50
自引率
12.50%
发文量
94
审稿时长
6-12 weeks
期刊介绍: The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics which, at present, are distributed throughout a number of journals. Within the last decade or so, algebraic combinatorics has evolved into a mature, established and identifiable area of mathematics. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics. The journal publishes papers in which combinatorics and algebra interact in a significant and interesting fashion. This interaction might occur through the study of combinatorial structures using algebraic methods, or the application of combinatorial methods to algebraic problems.
期刊最新文献
On the intersection spectrum of $${\text {PSL}}_2(q)$$ Finite 4-geodesic-transitive graphs with bounded girth Level and pseudo-Gorenstein path polyominoes A second homotopy group for digital images Bipartite determinantal ideals and concurrent vertex maps
×
引用
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