Results 1 to 10 of about 820 (100)

Extrapolation of urn models via poissonization: accurate measurements of the microbial unknown. [PDF]

PLoS One, 2011
The availability of high-throughput parallel methods for sequencing microbial communities is increasing our knowledge of the microbial world at an unprecedented rate.
Lladser ME, Gouet R, Reeder J.
europepmc   +4 more sources

Poissonization Principle for a Class of Additive Statistics [PDF]

Mathematics, 2022
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, Maman Jetpisbaev
doaj   +2 more sources

Asymptotic Analysis of the kth Subword Complexity. [PDF]

Entropy (Basel), 2020
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 ...
Ahmadi L, Ward MD.
europepmc   +2 more sources

A probabilistic analysis of a leader election algorithm [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
A leader election algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1.
Hanene Mohamed
doaj   +8 more sources

Poissonization Inequalities for Sums of Independent Random Variables in Banach Spaces with Applications to Empirical Processes

Mathematics
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
doaj   +2 more sources

Distribution of inter-node distances in digital trees [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
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, Nabil Lasmar, Hosam Mahmoud   +2 more
doaj   +1 more source

Protected node profile of Tries [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
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]

Discrete Mathematics & Theoretical Computer Science, 2010
Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas   +2 more
doaj   +1 more source

Integrable equations associated with the finite‐temperature deformation of the discrete Bessel point process

Journal of the London Mathematical Society, Volume 108, Issue 1, Page 273-308, July 2023., 2023
Abstract We study the finite‐temperature deformation of the discrete Bessel point process. We show that its largest particle distribution satisfies a reduction of the 2D Toda equation, as well as a discrete version of the integro‐differential Painlevé II equation of Amir–Corwin–Quastel, and we compute initial conditions for the Poissonization parameter
Mattia Cafasso, Giulio Ruzza
wiley   +1 more source

One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
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