Bollobás, Béla; Duminil-Copin, Hugo; Morris, Robert; Smith, Paul Universality for two-dimensional critical cellular automata. (English) Zbl 07740436 Proc. Lond. Math. Soc. (3) 126, No. 2, 620-703 (2023). MSC: 60K35 60C05 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Proc. Lond. Math. Soc. (3) 126, No. 2, 620--703 (2023; Zbl 07740436) Full Text: DOI arXiv
Balister, Paul; Bollobás, Béla; Morris, Robert The sharp threshold for making squares. (English) Zbl 1430.11165 Ann. Math. (2) 188, No. 1, 49-143 (2018). MSC: 11Y05 60C05 PDFBibTeX XMLCite \textit{P. Balister} et al., Ann. Math. (2) 188, No. 1, 49--143 (2018; Zbl 1430.11165) Full Text: DOI arXiv
Bollobás, Béla; Riordan, Oliver Exploring hypergraphs with martingales. (English) Zbl 1364.05051 Random Struct. Algorithms 50, No. 3, 325-352 (2017). MSC: 05C65 05C80 60C05 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{O. Riordan}, Random Struct. Algorithms 50, No. 3, 325--352 (2017; Zbl 1364.05051) Full Text: DOI arXiv
Bollobás, Béla; Przykucki, Michał; Riordan, Oliver; Sahasrabudhe, Julian On the maximum running time in graph bootstrap percolation. (English) Zbl 1361.05135 Electron. J. Comb. 24, No. 2, Research Paper P2.16, 20 p. (2017). MSC: 05D99 68Q80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Electron. J. Comb. 24, No. 2, Research Paper P2.16, 20 p. (2017; Zbl 1361.05135) Full Text: arXiv Link
Bollobás, Béla; Riordan, Oliver Counting connected hypergraphs via the probabilistic method. (English) Zbl 1371.05257 Comb. Probab. Comput. 25, No. 1, 21-75 (2016). MSC: 05C80 05C65 05C30 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{O. Riordan}, Comb. Probab. Comput. 25, No. 1, 21--75 (2016; Zbl 1371.05257) Full Text: DOI arXiv
Bollobás, Béla; Narayanan, Bhargav P.; Raigorodskii, Andrei M. On the stability of the Erdős-Ko-Rado theorem. (English) Zbl 1325.05145 J. Comb. Theory, Ser. A 137, 64-78 (2016). MSC: 05C80 05C35 PDFBibTeX XMLCite \textit{B. Bollobás} et al., J. Comb. Theory, Ser. A 137, 64--78 (2016; Zbl 1325.05145) Full Text: DOI arXiv
Bollobas, Béla; Smith, Paul; Uzzell, Andrew J. The time of bootstrap percolation with dense initial sets for all thresholds. (English) Zbl 1323.60124 Random Struct. Algorithms 47, No. 1, 1-29 (2015). MSC: 60K35 05C99 PDFBibTeX XMLCite \textit{B. Bollobas} et al., Random Struct. Algorithms 47, No. 1, 1--29 (2015; Zbl 1323.60124) Full Text: DOI arXiv
Bollobás, Béla; Holmgren, Cecilia; Smith, Paul; Uzzell, Andrew J. The time of bootstrap percolation with dense initial sets. (English) Zbl 1311.60113 Ann. Probab. 42, No. 4, 1337-1373 (2014). Reviewer: Boris Granovsky (Haifa) MSC: 60K35 60C05 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Ann. Probab. 42, No. 4, 1337--1373 (2014; Zbl 1311.60113) Full Text: DOI arXiv
Bollobás, Béla; Riordan, Oliver Asymptotic normality of the size of the giant component in a random hypergraph. (English) Zbl 1255.05125 Random Struct. Algorithms 41, No. 4, 441-450 (2012). MSC: 05C65 05C80 05C81 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{O. Riordan}, Random Struct. Algorithms 41, No. 4, 441--450 (2012; Zbl 1255.05125) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Duminil-Copin, Hugo; Morris, Robert The sharp threshold for bootstrap percolation in all dimensions. (English) Zbl 1238.60108 Trans. Am. Math. Soc. 364, No. 5, 2667-2701 (2012). MSC: 60K35 60C05 PDFBibTeX XMLCite \textit{J. Balogh} et al., Trans. Am. Math. Soc. 364, No. 5, 2667--2701 (2012; Zbl 1238.60108) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Morris, Robert Bootstrap percolation in high dimensions. (English) Zbl 1263.60082 Comb. Probab. Comput. 19, No. 5-6, 643-692 (2010). MSC: 60K35 05C80 60C05 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 19, No. 5--6, 643--692 (2010; Zbl 1263.60082) Full Text: DOI arXiv
Bollobás, Béla; Borgs, Christian; Chayes, Jennifer; Riordan, Oliver Percolation on dense graph sequences. (English) Zbl 1190.60090 Ann. Probab. 38, No. 1, 150-183 (2010). Reviewer: Ove Frank (Stockholm) MSC: 60K35 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Ann. Probab. 38, No. 1, 150--183 (2010; Zbl 1190.60090) Full Text: DOI arXiv
Bollobás, Béla; Riordan, Oliver Clique percolation. (English) Zbl 1205.60165 Random Struct. Algorithms 35, No. 3, 294-322 (2009). Reviewer: Ove Frank (Stockholm) MSC: 60K35 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{O. Riordan}, Random Struct. Algorithms 35, No. 3, 294--322 (2009; Zbl 1205.60165) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Morris, Robert Majority bootstrap percolation on the hypercube. (English) Zbl 1198.60041 Comb. Probab. Comput. 18, No. 1-2, 17-51 (2009). Reviewer: Arnaud Le Ny (Orsay) MSC: 60K35 82B43 82C43 60C05 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 18, No. 1--2, 17--51 (2009; Zbl 1198.60041) Full Text: DOI arXiv
Bollobàs, Bela; Janson, Svante; Riordan, Oliver The phase transition in inhomogeneous random graphs. (English) Zbl 1123.05083 Random Struct. Algorithms 31, No. 1, 3-122 (2007). MSC: 05C80 60C05 PDFBibTeX XMLCite \textit{B. Bollobàs} et al., Random Struct. Algorithms 31, No. 1, 3--122 (2007; Zbl 1123.05083) Full Text: DOI arXiv
Bollobás, Béla; Janson, Svante; Riordan, Oliver The phase transition in the uniformly grown random graph has infinite order. (English) Zbl 1063.05121 Random Struct. Algorithms 26, No. 1-2, 1-36 (2005). Reviewer: David B. Penman (Colchester) MSC: 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 26, No. 1--2, 1--36 (2005; Zbl 1063.05121) Full Text: DOI
Bollobás, Béla; Brightwell, Graham R.; Leader, Imre The number of 2-SAT functions. (English) Zbl 1024.68044 Isr. J. Math. 133, 45-60 (2003). MSC: 68Q25 05C15 05C30 06E30 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Isr. J. Math. 133, 45--60 (2003; Zbl 1024.68044) Full Text: DOI
Bollobás, Béla; Borgs, Christian; Chayes, Jennifer T.; Kim, Jeong Han; Wilson, David B. The scaling window of the 2-SAT transition. (English) Zbl 0979.68053 Random Struct. Algorithms 18, No. 3, 201-256 (2001). MSC: 68Q25 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 18, No. 3, 201--256 (2001; Zbl 0979.68053) Full Text: DOI arXiv
Bollobás, B.; Grimmett, G.; Janson, S. The random-cluster model on the complete graph. (English) Zbl 0846.05075 Probab. Theory Relat. Fields 104, No. 3, 283-317 (1996). Reviewer: Ph.Biane (Paris) MSC: 05C80 60K35 82B20 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Probab. Theory Relat. Fields 104, No. 3, 283--317 (1996; Zbl 0846.05075) Full Text: DOI
Bollobás, Béla; Thomason, Andrew Generalized chromatic numbers of random graphs. (English) Zbl 0862.05093 Random Struct. Algorithms 6, No. 2-3, 353-356 (1995). MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. Thomason}, Random Struct. Algorithms 6, No. 2--3, 353--356 (1995; Zbl 0862.05093) Full Text: DOI
Bollobás, B.; Kohayakawa, Y.; Łuczak, T. Connectivity properties of random subgraphs of the cube. (English) Zbl 0827.05053 Random Struct. Algorithms 6, No. 2-3, 221-230 (1995). Reviewer: R.Vohra (Columbus / Ohio) MSC: 05C80 05C40 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 6, No. 2--3, 221--230 (1995; Zbl 0827.05053) Full Text: DOI
Bollobás, Béla; Kohayakawa, Y.; Łuczak, T. On the diameter and radius of random subgraphs of the cube. (English) Zbl 0815.05055 Random Struct. Algorithms 5, No. 5, 627-648 (1994). Reviewer: G.L.McColm (Tampa) MSC: 05C80 60C05 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 5, No. 5, 627--648 (1994; Zbl 0815.05055) Full Text: DOI
Bollobás, Béla; Kohayakawa, Y.; Łuczak, T. The evolution of random subgraphs on the cube. (English) Zbl 0779.05045 Random Struct. Algorithms 3, No. 1, 55-90 (1992). Reviewer: W.Schlee (München) MSC: 05C80 60J80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 3, No. 1, 55--90 (1992; Zbl 0779.05045) Full Text: DOI