The present book offers a detailed treatment of perturbed random walks, perpetuities, and
random processes with immigration. These objects are of major importance in modern …

Limit laws are proven by the contraction method for random vectors of a recursive nature as
they arise as parameters of combinatorial structures such as random trees or recursive …

We present and discuss the many results obtained concerning a famous limit theorem, the
local limit theorem, which has many interfaces, with Number Theory notably, and for which …

We consider the so-called Dickman subordinator, whose Lévy measure has density 1x
restricted to the interval (0,1). The marginal density of this process, known as the Dickman …

We characterize all limit laws of the quicksort-type random variables defined recursively by
\calL(X_n)=\calL(X_I_n+X^*_n-1-I_n+T_n) when the" toll function" Tn varies and satisfies …

In Bhatt and Roy's minimal directed spanning tree construction for n random points in the
unit square, all edges must be in a south-westerly direction and there must be a directed …

In this paper, we propose a general means of estimating the rate at which convergences in
law occur. Our approach, which is an extension of the classical Stein-Tikhomirov method …

Image processing algorithms are essential for clarifying the image and improving the ability
to recognize distinct characteristics of the image. The field of digital image processing is …

For sums $ S_n=\sum_ {k= 1}^ n X_k $, $ n\ge 1$ of independent random variables $ X_k $
taking values in $\Z $ we prove, as a consequence of a more general result, that if (i) For …

QuickSelect (aka Find), introduced by Hoare (1961), is a randomized algorithm for selecting
a specified order statistic from an input sequence of $ n $ objects, or rather their identifying …