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 …

We consider the space of complete and separable metric spaces which are equipped with a
probability measure. A notion of convergence is given based on the philosophy that a …

We introduce a minimal generative model for densifying networks in which a new node
attaches to a randomly selected target node and also to each of its neighbors with …

We prove convergence in distribution for the profile (the number of nodes at each level),
normalized by its mean, of random recursive trees when the limit ratio α of the level and the …

We introduce a growing network model, the copying model, in which a new node attaches to
a randomly selected target node and, in addition, independently to each of the neighbors of …

Tries (from re trie val) are one of the most popular data structures on words. They are
pertinent to the (internal) structure of stored words and several splitting procedures used in …

A Pólya urn process is a Markov chain that models the evolution of an urn containing some
coloured balls, the set of possible colours being {1,...,d\} for d∈N. At each time step, a …

We present analytical results for the distribution of shortest cycle lengths (DSCL) in random
networks. The approach is based on the relation between the DSCL and the distribution of …

We derive several limit results for the profile of random plane‐oriented recursive trees.
These include the limit distribution of the normalized profile, asymptotic bimodality of the …

We study the profile X n, k of random search trees including binary search trees and m-ary
search trees. Our main result is a functional limit theorem of the normalized profile …