不可还原复反射群上 Cayley 图的电阻直径和临界概率

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":"不可还原复反射群上 Cayley 图的电阻直径和临界概率","authors":"Maksim Vaskouski, Hanna Zadarazhniuk","doi":"10.1007/s10801-024-01302-5","DOIUrl":null,"url":null,"abstract":"We consider networks on minimal Cayley graphs of irreducible complex reflection groups G(m, p, n). 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.","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":"{\"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\":\"We consider networks on minimal Cayley graphs of irreducible complex reflection groups G(m, p, n). 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.\",\"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}","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

摘要

我们考虑了不可还原复反射群 G(m,p,n)的最小 Cayley 图上的网络。我们证明，在固定的 m、p 条件下，这些图的阻力直径具有渐近的 $\Theta (1/n)$ as $n\rightarrow \infty $。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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

We consider networks on minimal Cayley graphs of irreducible complex reflection groups G(m, p, n). 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Algebraic Combinatorics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

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