From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …

Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

The combinatorial theory of species, introduced by Joyal in 1980, provides a unified
understanding of the use of generating functions for both labelled and unlabelled structures …

Page 1 Michael Drmota Random Trees An Interplay between Combinatorics and Probability
SpringerWien NewYork Page 2 SpringerWien NewYork Page 3 Michael Drmota Random Trees …

Incorporating a collection of recent results, Polya Urn Models deals with discrete probability
through the modern and evolving urn theory and its numerous applications. It looks at how …

Recently there has been much interest in studying large-scale real-world networks and
attempting to model their properties using random graphs. Although the study of real-world …

Quantum physics has revealed many interesting formal properties associated with the
algebra of two operators, A and B, satisfying the partial commutation relation AB-BA= 1. This …

A systematic approach to the random generation of labelled combinatorial objects is
presented. It applies to structures that are decomposable, ie, formally specifiable by …

A process of growing a random recursive tree Tn is studied. The sequence {Tn} is shown to
be a sequence of “snapshots” of a Crump–Mode branching process. This connection and a …

Flajolet and Soria established several central limit theorems for the parameter 'number of
components' in a wide class of combinatorial structures. In this paper, we shall prove a …