{"title":"多参数简单复合体中子复合体计数和贝蒂数的大偏差","authors":"G. Samorodnitsky, Takashi Owada","doi":"10.1002/rsa.21146","DOIUrl":null,"url":null,"abstract":"We consider the multiparameter random simplicial complex as a higher dimensional extension of the classical Erdős–Rényi graph. We investigate appearance of “unusual” topological structures in the complex from the point of view of large deviations. We first study upper tail large deviation probabilities for subcomplex counts, deriving the order of magnitude of such probabilities at the logarithmic scale precision. The obtained results are then applied to analyze large deviations for the number of simplices of the multiparameter simplicial complexes. Finally, these results are also used to deduce large deviation estimates for Betti numbers of the complex in the critical dimension.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"2 1","pages":"533 - 556"},"PeriodicalIF":0.9000,"publicationDate":"2022-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes\",\"authors\":\"G. Samorodnitsky, Takashi Owada\",\"doi\":\"10.1002/rsa.21146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the multiparameter random simplicial complex as a higher dimensional extension of the classical Erdős–Rényi graph. We investigate appearance of “unusual” topological structures in the complex from the point of view of large deviations. We first study upper tail large deviation probabilities for subcomplex counts, deriving the order of magnitude of such probabilities at the logarithmic scale precision. The obtained results are then applied to analyze large deviations for the number of simplices of the multiparameter simplicial complexes. Finally, these results are also used to deduce large deviation estimates for Betti numbers of the complex in the critical dimension.\",\"PeriodicalId\":54523,\"journal\":{\"name\":\"Random Structures & Algorithms\",\"volume\":\"2 1\",\"pages\":\"533 - 556\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Structures & Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21146\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/rsa.21146","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes
We consider the multiparameter random simplicial complex as a higher dimensional extension of the classical Erdős–Rényi graph. We investigate appearance of “unusual” topological structures in the complex from the point of view of large deviations. We first study upper tail large deviation probabilities for subcomplex counts, deriving the order of magnitude of such probabilities at the logarithmic scale precision. The obtained results are then applied to analyze large deviations for the number of simplices of the multiparameter simplicial complexes. Finally, these results are also used to deduce large deviation estimates for Betti numbers of the complex in the critical dimension.
期刊介绍:
It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness.
Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.