The shape of unlabeled rooted random trees
European Journal of Combinatorics
3-connected cores in random planar graphs
Combinatorics, Probability and Computing
Texture and color analysis for the automatic classification of the eye lipid layer
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Depth Properties of scaled attachment random recursive trees
Random Structures & Algorithms
Asymptotic Study of Subcritical Graph Classes
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During the last years research related to (random) trees has been constantly increasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in different settings. The aim of this book is to provide a thorough introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. It should serve as a reference book as well as a basis for future research. One major conceptual aspect is to bridge combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (saddle point techniques, singularity analysis) to various sophisticated techniques in asymptotic probability (martingales, convergence of stochastic processes, concentration inequalities).