American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(60C05) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 30 of 70 found      Go to page: 1 2 3

[1] Jim Pitman and Douglas Rizzolo. Schr\"oder's problems and scaling limits of random trees. Trans. Amer. Math. Soc.
Abstract, references, and article information   
View Article: PDF

[2] Richard W. Kenyon and David B. Wilson. Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs. J. Amer. Math. Soc. 28 (2015) 985-1030.
Abstract, references, and article information
View Article: PDF

[3] Zur Izhakian, Svante Janson and John Rhodes. Superboolean rank and the size of the largest triangular submatrix of a random matrix. Proc. Amer. Math. Soc. 143 (2015) 407-418.
Abstract, references, and article information   
View Article: PDF

[4] Rita Giuliano and Claudio Macci. On the asymptotic behavior of a sequence of random variables of interest in the classical occupancy problem. Theor. Probability and Math. Statist. 87 (2013) 31-40.
Abstract, references, and article information   
View Article: PDF

[5] Kathrin Bringmann and Karl Mahlburg. Improved bounds on metastability thresholds and probabilities for generalized bootstrap percolation. Trans. Amer. Math. Soc. 364 (2012) 3829-3859.
Abstract, references, and article information   
View Article: PDF

[6] József Balogh, Béla Bollobás, Hugo Duminil-Copin and Robert Morris. The sharp threshold for bootstrap percolation in all dimensions. Trans. Amer. Math. Soc. 364 (2012) 2667-2701.
Abstract, references, and article information   
View Article: PDF

[7] Roberto Imbuzeiro Oliveira. On the coalescence time of reversible random walks. Trans. Amer. Math. Soc. 364 (2012) 2109-2128. MR 2869200.
Abstract, references, and article information   
View Article: PDF

[8] Richard W. Kenyon and David B. Wilson. Boundary partitions in trees and dimers. Trans. Amer. Math. Soc. 363 (2011) 1325-1364. MR 2737268.
Abstract, references, and article information   
View Article: PDF

[9] József Beck. Threshold clustering and a few bold conjectures. University Lecture Series 49 (2009) 155-162.
Book volume table of contents
View Article: PDF

[10] József Beck. Exact solutions of games: Understanding via the equiprobability postulate. University Lecture Series 49 (2009) 123-134.
Book volume table of contents
View Article: PDF

[11] József Beck. Constraints and threshold clustering. University Lecture Series 49 (2009) 147-154.
Book volume table of contents
View Article: PDF

[12] József Beck. Practice session (I): More on Ramsey games and strategies. University Lecture Series 49 (2009) 89-97.
Book volume table of contents
View Article: PDF

[13] József Beck. Equiprobability postulate with constraints (endgame policy). University Lecture Series 49 (2009) 135-146.
Book volume table of contents
View Article: PDF

[14] József Beck. Collecting data: More randomness in number theory. University Lecture Series 49 (2009) 21-36.
Book volume table of contents
View Article: PDF

[15] József Beck. Complex systems. University Lecture Series 49 (2009) 3-11.
Book volume table of contents
View Article: PDF

[16] József Beck. An attempt to save the variance. University Lecture Series 49 (2009) 203-207.
Book volume table of contents
View Article: PDF

[17] József Beck. Collecting data: Apparent randomness of digit sequences. University Lecture Series 49 (2009) 13-20.
Book volume table of contents
View Article: PDF

[18] József Beck. Conclusion (I): More on theorem 1. University Lecture Series 49 (2009) 227-236.
Book volume table of contents
View Article: PDF

[19] József Beck. Is surplus the right concept? (I). University Lecture Series 49 (2009) 177-184.
Book volume table of contents
View Article: PDF

[20] József Beck. Yet another simplification: Sparse hypergraphs and the surplus. University Lecture Series 49 (2009) 165-176.
Book volume table of contents
View Article: PDF

[21] József Beck. Conclusion (II): Beyond the SLG conjecture. University Lecture Series 49 (2009) 237-243.
Book volume table of contents
View Article: PDF

[22] József Beck. Working with a game-theoretic partition function. University Lecture Series 49 (2009) 193-202.
Book volume table of contents
View Article: PDF

[23] József Beck. Inevitable Randomness in Discrete Mathematics. University Lecture Series 49 (2009) MR MR2543141.
Book volume table of contents   

[24] József Beck. Collecting proofs for the SLG conjecture. University Lecture Series 49 (2009) 49-66.
Book volume table of contents   
View Article: PDF

[25] József Beck. What kind of games?. University Lecture Series 49 (2009) 111-122.
Book volume table of contents   
View Article: PDF

[26] József Beck. Is surplus the right concept? (II). University Lecture Series 49 (2009) 185-191.
Book volume table of contents   
View Article: PDF

[27] József Beck. Proof of theoem 2: The upper bound. University Lecture Series 49 (2009) 219-226.
Book volume table of contents   
View Article: PDF

[28] József Beck. Proof of theorem 1: Combining the variance with an exponential sum. University Lecture Series 49 (2009) 209-217.
Book volume table of contents   
View Article: PDF

[29] József Beck. Laplace and the principle of insufficient reason. University Lecture Series 49 (2009) 37-48.
Book volume table of contents   
View Article: PDF

[30] József Beck. Ramsey theory and games. University Lecture Series 49 (2009) 69-87.
Book volume table of contents   
View Article: PDF


Results: 1 to 30 of 70 found      Go to page: 1 2 3