Random Graphs
Volume 2
1st Edition
Published on 7. May 1992
Book
Hardback
304 pages
978-0-471-57292-3 (ISBN)
Description
Presents refereed papers by international experts regarding such diverse areas of interest as: random mappings and permutations, quasirandom graphs, random walks on trees, degree sequences, random matroids, central limit theorems, percolations and random subgraphs of the n-cube. Features an appendix of open problems from the conference.
More details
Language
English
Place of publication
United States
Publishing group
John Wiley & Sons Inc
Target group
College/higher education
Professional and scholarly
Product notice
sewn/stitched
Cloth over boards
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 21 mm
Weight
619 gr
ISBN-13
978-0-471-57292-3 (9780471572923)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
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.
Content
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).
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).