Results 1 to 10 of about 66 (62)
Asymptotic Analysis of the kth Subword Complexity [PDF]
Patterns within strings enable us to extract vital information regarding a string’s randomness. Understanding whether a string is random (Showing no to little repetition in patterns) or periodic (showing repetitions in patterns) are described by a ...
Lida Ahmadi, Mark Daniel Ward
doaj +2 more sources
Extrapolation of urn models via poissonization: accurate measurements of the microbial unknown. [PDF]
The availability of high-throughput parallel methods for sequencing microbial communities is increasing our knowledge of the microbial world at an unprecedented rate.
Manuel E Lladser +2 more
doaj +2 more sources
Poissonization Principle for a Class of Additive Statistics
In this paper, we consider a class of additive functionals of a finite or countable collection of the group frequencies of an empirical point process that corresponds to, at most, a countable partition of the sample space.
Igor Borisov
exaly +3 more sources
Inequalities are obtained which connect the probability tails and moments of functions of the nth partial sums of independent random variables taking values in a separable Banach space and those for the accompanying infinitely divisible laws.
Igor Borisov
exaly +3 more sources
Distribution of inter-node distances in digital trees [PDF]
We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances.
Rafik Aguech +2 more
doaj +1 more source
Protected node profile of Tries [PDF]
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models.
Mehri Javanian
doaj +1 more source
Asymptotic variance of random symmetric digital search trees [PDF]
Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang +2 more
doaj +1 more source
One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling [PDF]
One-sided variations on path length in a trie (a sort of digital trees) are investigated: They include imbalance factors, climbing under different strategies, and key sampling.
Costas A. Christophi, Hosam M. Mahmoud
doaj +1 more source
The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis [PDF]
Random compositions of integers are used as theoretical models for many applications. The degree of distinctness of a composition is a natural and important parameter. A possible measure of distinctness is the number $X$ of distinct parts (or components).
Guy Louchard
doaj +1 more source
A New Binomial Recurrence Arising in a Graphical Compression Algorithm [PDF]
In a recently proposed graphical compression algorithm by Choi and Szpankowski (2009), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In
Yongwook Choi +2 more
doaj +1 more source

