Alan Frieze's main research interest is Probabilistic Combinatorics and its applications in Theoretical Computer Science and Operations Research. He is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pennsylvania and has authored more than 300 publications in top journals and was invited to be a plenary speaker at the Seoul ICM 2014. In 1991 he received the Fulkerson prize in discrete mathematics. Michal Karonski is a founder of the Discrete Mathematics Research group at Adam Mickiewicz University in Poznan, Poland. He has authored over 50 publications and currently serves as co-Editor-in-Chief of Random Structures and Algorithms.

• Partial table of contents: Probability Distributions Related to the Local Structure of aRandom Mapping (S. Berg & J. Jaworski). Maximum Cuts and Quasirandom Graphs (F. Chung & R.Graham). Inequalities for Random Walks on Trees (L. Devroye & A.Sbihi). Spanning Trees in Random Graphs (P. Dolan). Subgraphs of Large Minimal Degree (P. Erdos, et al.). On Small Subgraphs of Random Graphs (A. Frieze). When Is a Graphical Sequence Stable? (M. Jerrum, et al.). On the Stack Ramification of Binary Trees (R. Kemp). The Number of Permutations with Cycle Lengths from a Fixed Set (V.Kolchin). Sparse Random Graphs with a Given Degree Sequence (T.Luczak). Proving Normality in Combinatorics (A. Rucinski). Remarks on the Stochastic Traveling Salesman (E. Shamir).

Alan Frieze's main research interest is Probabilistic Combinatorics and its applications in Theoretical Computer Science and Operations Research. He is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pennsylvania and has authored more than 300 publications in top journals and was invited to be a plenary speaker at the Seoul ICM 2014. In 1991 he received the Fulkerson prize in discrete mathematics. Michal Karonski is a founder of the Discrete Mathematics Research group at Adam Mickiewicz University in Poznan, Poland. He has authored over 50 publications and currently serves as co-Editor-in-Chief of Random Structures and Algorithms.

• Partial table of contents: Probability Distributions Related to the Local Structure of aRandom Mapping (S. Berg & J. Jaworski). Maximum Cuts and Quasirandom Graphs (F. Chung & R.Graham). Inequalities for Random Walks on Trees (L. Devroye & A.Sbihi). Spanning Trees in Random Graphs (P. Dolan). Subgraphs of Large Minimal Degree (P. Erdos, et al.). On Small Subgraphs of Random Graphs (A. Frieze). When Is a Graphical Sequence Stable? (M. Jerrum, et al.). On the Stack Ramification of Binary Trees (R. Kemp). The Number of Permutations with Cycle Lengths from a Fixed Set (V.Kolchin). Sparse Random Graphs with a Given Degree Sequence (T.Luczak). Proving Normality in Combinatorics (A. Rucinski). Remarks on the Stochastic Traveling Salesman (E. Shamir).

Alan Frieze's main research interest is Probabilistic Combinatorics and its applications in Theoretical Computer Science and Operations Research. He is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pennsylvania and has authored more than 300 publications in top journals and was invited to be a plenary speaker at the Seoul ICM 2014. In 1991 he received the Fulkerson prize in discrete mathematics. Michal Karonski is a founder of the Discrete Mathematics Research group at Adam Mickiewicz University in Poznan, Poland. He has authored over 50 publications and currently serves as co-Editor-in-Chief of Random Structures and Algorithms.

• Partial table of contents: Probability Distributions Related to the Local Structure of aRandom Mapping (S. Berg & J. Jaworski). Maximum Cuts and Quasirandom Graphs (F. Chung & R.Graham). Inequalities for Random Walks on Trees (L. Devroye & A.Sbihi). Spanning Trees in Random Graphs (P. Dolan). Subgraphs of Large Minimal Degree (P. Erdos, et al.). On Small Subgraphs of Random Graphs (A. Frieze). When Is a Graphical Sequence Stable? (M. Jerrum, et al.). On the Stack Ramification of Binary Trees (R. Kemp). The Number of Permutations with Cycle Lengths from a Fixed Set (V.Kolchin). Sparse Random Graphs with a Given Degree Sequence (T.Luczak). Proving Normality in Combinatorics (A. Rucinski). Remarks on the Stochastic Traveling Salesman (E. Shamir).