Related papers: Finite sequences representing expected order stati…
It is shown that, given a point $x\in\mathbbm{R}^d$, $d\ge 2$, and open sets $U_1,...,U_k$ containing $x$, any convex combination of the harmonic measures for $x$ with respect to $U_n$, $1\le n\le k$, is the limit of a sequence of harmonic…
A survey of properties of a sequence of coefficients appearing in the evaluation of a quartic definite integral is presented. These properties are of analytical, combinatorial and number-theoretical nature.
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
Closed queuing networks with finite capacity buffers and skip-over policies are fundamental models in the performance evaluation of computer and communication systems. This technical report presents the details of computational algorithms…
Confidence sequences are collections of confidence regions that simultaneously cover the true parameter for every sample size at a prescribed confidence level. Tightening these sequences is of practical interest and can be achieved by…
We consider several coding discretizations of continuous functions which reflect their variation at some given precision. We study certain statistical and combinatorial properties of the sequence of finite words obtained by coding a typical…
We study the expectation of linear eigenvalue statistics of matrix models with any $\beta>0$, assuming that the potential $V$ is a real analytic function and that the corresponding equilibrium measure has a one-interval support. We obtain…
This is an annotated bibliography on estimation and inference results for queues and related stochastic models. The purpose of this document is to collect and categorise works in the field, allowing for researchers and practitioners to…
We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…
The spectra of a finite group is the set of its element orders. We obtain an arithmetic description of finite symplectic and orthogonal groups. In particular, a description of spectra of all finite simple simplectic and orthogonal groups is…
The determination of the number of mixture components (the order) of a finite mixture model has been an enduring problem in statistical inference. We prove that the closed testing principle leads to a sequential testing procedure (STP) that…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
This paper analyzes the performance of sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. Precise bounds on the number of samples required to yield an accurate estimate are derived.…
If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vec{\lambda}=(\lambda_1,\lambda_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the…
As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, Choquet decompositions and Choquet convex decompositions, as well as their corresponding hull operators…
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…
In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…