This book explains similarities in asymptotic behavior as the result of two basic properties
shared by the structures: the conditioning relation and the logarithmic condition. The …

The work of Harper and subsequent authors has shown that finite sequences (a0,…, an)
arising from combinatorial problems are often such that the polynomialA (z):=∑ nk …

Given a multivariate generating function F (z1,…, zd)=∑ ar1,…, rdzr11… zrdd, we determine
asymptotics for the coefficients. Our approach is to use Cauchy's integral formula near …

Citation networks represent the flow of information between agents. They are constrained in
time and so form directed acyclic graphs which have a causal structure. Here we provide …

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 …

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 …

In this paper, two new series for the logarithm of the Γ-function are presented and studied.
Their polygamma analogs are also obtained and discussed. These series involve the …

Martingales and Profile of Binary Search Trees Page 1 E lectroni c J o u rnal o f P r oba bility
Vol. 10 (2005), Paper no. 12, pages 420-435. Journal URL http://www.math.washington.edu/~ejpecp …

In this work, two new series expansions for generalized Euler's constants (Stieltjes
constants) γ m are obtained. The first expansion involves Stirling numbers of the first kind …

This paper introduces a novel parameter estimation method for the probability tables of
Bayesian network classifiers (BNCs), using hierarchical Dirichlet processes (HDPs). The …