Results 11 to 20 of about 820 (100)
Sharp Rosenthal‐type inequalities for mixtures and log‐concave variables
Bulletin of the London Mathematical Society, Volume 55, Issue 3, Page 1222-1239, June 2023., 2023 Abstract We obtain Rosenthal‐type inequalities with sharp constants for moments of sums of independent random variables which are mixtures of a fixed distribution. We also identify extremizers in log‐concave settings when the moments of summands are individually constrained.
Giorgos Chasapis +2 more
wiley +1 more source
Multitime Distribution in Discrete Polynuclear Growth
Communications on Pure and Applied Mathematics, Volume 74, Issue 12, Page 2561-2627, December 2021., 2021 Abstract We study the multitime distribution in a discrete polynuclear growth model or, equivalently, in directed last‐passage percolation with geometric weights. A formula for the joint multitime distribution function is derived in the discrete setting. It takes the form of a multiple contour integral of a block Fredholm determinant.
Kurt Johansson, Mustazee Rahman
wiley +1 more source
The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 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]
Discrete Mathematics & Theoretical Computer Science, 2012 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
On the Number of 2-Protected Nodes in Tries and Suffix Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases.
Jeffrey Gaither +3 more
doaj +1 more source
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source
A complement to Le Cam's theorem [PDF]
, 2007 This paper examines asymptotic equivalence in the sense of Le Cam between density estimation experiments and the accompanying Poisson experiments. The significance of asymptotic equivalence is that all asymptotically optimal statistical procedures can be
Low, Mark G., Zhou, Harrison H.
core +3 more sources
Optimal Online Selection of a Monotone Subsequence: a Central Limit Theorem [PDF]
, 2014 Consider a sequence of $n$ independent random variables with a common continuous distribution $F$, and consider the task of choosing an increasing subsequence where the observations are revealed sequentially and where an observation must be accepted or ...
Arlotto, Alessandro +2 more
core +5 more sources
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's precept, these problems are tackled by complex analysis methods such as generating functions,
Wojciech Szpankowski
doaj +1 more source
Correlation functions for random involutions [PDF]
, 2005 Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points.
Forrester, Peter J. +2 more
core +4 more sources