Related papers: Counting Functions for Random Objects in a Categor…

In high-frequency statistics and econometrics sums of functionals of increments of stochastic processes are commonly used and statistical inference is based on the asymptotic behaviour of these sums as the mesh of the observation times…

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

We propose an alternative to $k$-nearest neighbors for functional data whereby the approximating neighboring curves are piecewise functions built from a functional sample. Using a locally defined distance function that satisfies…

We discuss formulas for the asymptotic growth rate of the number of summands in tensor powers in certain (finite or infinite) monoidal categories. Our focus is on monoidal categories with infinitely many indecomposable objects, with our…

This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…

The aim of the paper is to study the limit distributions and the asymptotic behavior of summation arithmetic functions. A probabilistic approach based on the use of the axioms of probability theory is used for these purposes. Sufficient…

In this paper, we study inference for high-dimensional data characterized by small sample sizes relative to the dimension of the data. In particular, we provide an infinite-dimensional framework to study statistical models that involve…

In this article we consider the general setting of conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We deal with two classes of such systems: attracting and parabolic. The latter being…

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…

We study the counting function of cubic function fields. Specifically, we derive an asymptotic formula for this counting function including a secondary term and an error term of order $\mathcal{O}\big(X^{2/3+\epsilon}\big)$, which matches…

We extend a general result showing that the asymptotic behavior of high moments, factorial or standard, of random variables, determines the asymptotically normality, from the one dimensional to the multidimensional setting. This approach…

This paper concerns the estimation of sums of functions of observable and unobservable variables. Lower bounds for the asymptotic variance and a convolution theorem are derived in general finite- and infinite-dimensional models. An explicit…

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

The paper studies the asymptotic behaviour of weighted functionals of long-range dependent data over increasing observation windows. Various important statistics, including sample means, high order moments, occupation measures can be given…

This paper studies the counting problem in random dynamical systems. We noticed that the nature of counting in the random setting is completely different than that of the deterministic systems in the sense that non-exponential growth is…

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…

Sample size criteria are often expressed in terms of the concentration of the posterior density, as controlled by some sort of error bound. Since this is done pre-experimentally, one can regard the posterior density as a function of the…

In this paper, we present the asymptotic theory for integrated functions of increments of Brownian local times in space. Specifically, we determine their first-order limit, along with the asymptotic distribution of the fluctuations. Our key…

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…