首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A new lower bound for the critical probability of site percolation on the square lattice
Authors:J van den Berg  A Ermakov
Abstract:The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Tóth 13]), 0.522 (Zuev 15]), and the best lower bound so far, 0.541 (Menshikov and Pelikh 12]). By a modification of the method of Menshikov and Pelikh we get a significant improvement, namely, 0.556. Apart from a few classical results on percolation and coupling, which are explicitly stated in the Introduction, this paper is self-contained. © 1996 John Wiley & Sons, Inc.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号