{"title":"临界交叉概率的均匀有界性意味着超尺度","authors":"C. Borgs, J. Chayes, H. Kesten, J. Spencer","doi":"10.1002/(SICI)1098-2418(199910/12)15:3/4%3C368::AID-RSA9%3E3.0.CO;2-B","DOIUrl":null,"url":null,"abstract":"We consider bond percolation on the d-dimensional hypercubic lattice. Assuming the existence of a single critical exponent, the exponent ρ describing the decay rate of point-to-plane crossings at the critical point, we prove that hyperscaling holds whenever critical rectangle crossing probabilities are uniformly bounded away from 1. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 368–413, 1999","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":"{\"title\":\"Uniform boundedness of critical crossing probabilities implies hyperscaling\",\"authors\":\"C. Borgs, J. Chayes, H. Kesten, J. Spencer\",\"doi\":\"10.1002/(SICI)1098-2418(199910/12)15:3/4%3C368::AID-RSA9%3E3.0.CO;2-B\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider bond percolation on the d-dimensional hypercubic lattice. Assuming the existence of a single critical exponent, the exponent ρ describing the decay rate of point-to-plane crossings at the critical point, we prove that hyperscaling holds whenever critical rectangle crossing probabilities are uniformly bounded away from 1. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 368–413, 1999\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4%3C368::AID-RSA9%3E3.0.CO;2-B\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4%3C368::AID-RSA9%3E3.0.CO;2-B","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46