{"title":"随机图中对称扩展的最大数量","authors":"Stepan Vakhrushev, Maksim Zhukovskii","doi":"10.1137/23m1588706","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2468-2488, September 2024. <br/> Abstract. It is known that after an appropriate rescaling the maximum degree of the binomial random graph converges in distribution to a Gumbel random variable. The same holds true for the maximum number of common neighbors of a [math]-vertex set and for the maximum number of [math]-cliques sharing a single vertex. Can these results be generalized to the maximum number of extensions of a [math]-vertex set for any given way of extending a [math]-vertex set by an [math]-vertex set? In this paper, we generalize the abovementioned results to a class of “symmetric extensions” and show that the limit distribution is not necessarily from the Gumbel family.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"43 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximum Number of Symmetric Extensions in Random Graphs\",\"authors\":\"Stepan Vakhrushev, Maksim Zhukovskii\",\"doi\":\"10.1137/23m1588706\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2468-2488, September 2024. <br/> Abstract. It is known that after an appropriate rescaling the maximum degree of the binomial random graph converges in distribution to a Gumbel random variable. The same holds true for the maximum number of common neighbors of a [math]-vertex set and for the maximum number of [math]-cliques sharing a single vertex. Can these results be generalized to the maximum number of extensions of a [math]-vertex set for any given way of extending a [math]-vertex set by an [math]-vertex set? In this paper, we generalize the abovementioned results to a class of “symmetric extensions” and show that the limit distribution is not necessarily from the Gumbel family.\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":\"43 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1588706\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1588706","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Maximum Number of Symmetric Extensions in Random Graphs
SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2468-2488, September 2024. Abstract. It is known that after an appropriate rescaling the maximum degree of the binomial random graph converges in distribution to a Gumbel random variable. The same holds true for the maximum number of common neighbors of a [math]-vertex set and for the maximum number of [math]-cliques sharing a single vertex. Can these results be generalized to the maximum number of extensions of a [math]-vertex set for any given way of extending a [math]-vertex set by an [math]-vertex set? In this paper, we generalize the abovementioned results to a class of “symmetric extensions” and show that the limit distribution is not necessarily from the Gumbel family.
期刊介绍:
SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution.
Topics include but are not limited to:
properties of and extremal problems for discrete structures
combinatorial optimization, including approximation algorithms
algebraic and enumerative combinatorics
coding and information theory
additive, analytic combinatorics and number theory
combinatorial matrix theory and spectral graph theory
design and analysis of algorithms for discrete structures
discrete problems in computational complexity
discrete and computational geometry
discrete methods in computational biology, and bioinformatics
probabilistic methods and randomized algorithms.