Achlioptas, D. (2000) Setting 2 variables at a time yields a new lower bound for random 3-SAT. In Proc. 32nd Annual ACM Symposium on Theory of Computing: STOC'00, ACM, pp. 28–37.
Alon, N., Kim, J. H. and Spencer, J. (1997) Nearly perfect matchings in regular simple hypergraphs. Israel J. Math.
Azuma, K. (1967) Weighted sums of certain dependent random variables. Tôhoku Math. J.
Bapst, V., Coja-Oghlan, A., Hetterich, S., Rassmann, F. and Vilenchik, D. The condensation phase transition in random graph coloring. Comm. Math. Phys., to appear (Proceedings version appeared in RANDOM 2014). arXiv:1404.5513.
Bohman, T. (2009) The triangle-free process. Adv. Math.
Bohman, T., Frieze, A. and Lubetzky, E. (2015) Random triangle removal. Adv. Math.
Bohman, T. and Keevash, P. (2010) The early evolution of the H-free process. Invent. Math.
Bollobás, B. (1988) The chromatic number of random graphs. Combinatorica
Bollobás, B. (2012) Personal communication.
Bollobás, B. and Riordan, O. (2015) An old approach to the giant component problem. J. Combin. Theory Ser. B
Bollobás, B. and Brightwell, G. (1992) The height of a random partial order: Concentration of measure. Ann. Appl. Probab.
Bollobás, B. and Riordan, O. (2009) Random graphs and branching processes. In Handbook of Large-Scale Random Networks, Vol. 18 of Bolyai Society Mathematical Studies, pp. 15–115.
Borgs, C., Chayes, J. T., Mertens, S. and Pittel, B. (2004) Phase diagram for the constrained integer partitioning problem. Random Struct. Alg.
Bushaw, N., Collares Neto, M., Morris, R. and Smith, P. (2015) The sharp threshold for maximum-size sum-free subsets in even-order abelian groups. Combin. Probab. Comput.
Chalker, T. K., Godbole, A. P., Hitczenko, P., Radcliff, J. and Ruehr, O. G. (1999) On the size of a random sphere of influence graph. Adv. Appl. Probab.
Chung, F. and Lu, L. (2006) Concentration inequalities and martingale inequalities: A survey. Internet Math.
Dembo, A. and Zeitouni, O. (1998) Large Deviations Techniques and Applications, Springer.
Dubhashi, D. P. and Panconesi, A. (2009) Concentration of Measure for the Analysis of Randomized Algorithms, Cambridge University Press.
Erdős, P., Suen, S. and Winkler, P. (1995) On the size of a random maximal graph. Random Struct. Alg.
Freedman, D. A. (1975) On tail probabilities for martingales. Ann. Probab.
de Graaf, M. and Manthey, B. (2014) Probabilistic analysis of power assignments. In Mathematical Foundations of Computer Science 2014, Vol. 8635 of Lecture Notes in Computer Science, Springer, pp. 201–212.
Grable, D. A. (1998) A large deviation inequality for functions of independent, multi-way choices. Combin. Probab. Comput.
Harris, T. E. (1960) A lower bound for the critical probability in a certain percolation process. Proc. Cambridge Philos. Soc.
Hoeffding, W. (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc.
Janson, S. (1990) Poisson approximation for large deviations. Random Struct. Alg.
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience.
Janson, S. and Ruciński, A. (2004) The deletion method for upper tail estimates. Combinatorica
Janson, S. and Warnke, L. The lower tail: Poisson approximation revisited. Random Struct. Alg., to appear. arXiv:1406.1248.
Kim, J. H. (1995) On Brooks' theorem for sparse graphs. Combin. Probab. Comput.
Kim, J. H. and Vu, V. H. (2000) Concentration of multivariate polynomials and its applications. Combinatorica
Kim, J. H. and Vu, V. H. (2004) Divide and conquer martingales and the number of triangles in a random graph. Random Struct. Alg.
Krivelevich, M., Lubetzky, E. and Sudakov, B. (2013) Longest cycles in sparse random digraphs. Random Struct. Alg.
Makai, T. (2015) The reverse H-free process for strictly 2-balanced graphs. J. Graph Theory
McDiarmid, C. (1989) On the method of bounded differences. In Surveys in Combinatorics, Vol. 141 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 48–188.
McDiarmid, C. (1998) Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, Vol. 16 of Algorithms and Combinatorics, Springer, pp. 195–248.
McKay, B. and Skerman, F. (2013) Degree sequences of random digraphs and bipartite graphs. arXiv:1302.2446.
Milman, V. D. and Schechtman, G. (1986) Asymptotic Theory of Finite-Dimensional Normed Spaces, Vol. 1200 of Lecture Notes in Mathematics, Springer.
Osthus, D. and Taraz, A. (2001) Random maximal H-free graphs. Random Struct. Alg.
Riordan, O. and Warnke, L. (2015) The Janson inequalities for general up-sets. Random Struct. Alg.
Riordan, O. and Warnke, L. (2015) The evolution of subcritical Achlioptas processes. Random Struct. Alg.
Rödl, V. and Thoma, L. (1996) Asymptotic packing and the random greedy algorithm. Random Struct. Alg.
Schudy, W. and Sviridenko, M. (2011) Bernstein-like concentration and moment inequalities for polynomials of independent random variables: Multilinear case. arXiv:1109.5193.
Schudy, W. and Sviridenko, M. (2012) Concentration and moment inequalities for polynomials of independent random variables. In Proc. 23rd Annual ACM–SIAM Symposium on Discrete Algorithms: SODA'12, SIAM, pp. 437–446.
Shamir, E. and Spencer, J. (1987) Sharp concentration of the chromatic number on random graphs Gn,p
Spencer, J. (1990) Counting extensions. J. Combin. Theory Ser. A
Spencer, J. (1995) Asymptotic packing via a branching process. Random Struct. Alg.
Steiger, W. L. (1969) A best possible Kolmogoroff-type inequality for martingales and a characteristic property. Ann. Math. Statist.
Talagrand, M. (1996) A new look at independence. Ann. Probab.
Vu, V. H. (2000) On the concentration of multivariate polynomials with small expectation. Random Struct. Alg.
Vu, V. H. (2002) Concentration of non-Lipschitz functions and applications. Random Struct. Alg.
Warnke, L. (2014) The Cℓ
-free process. Random Struct. Alg.
Warnke, L. (2014) When does the K
4-free process stop?
Random Struct. Alg.
Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics, Vol. 267 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 239–298.