Related papers: Asymptotics of the Charlier polynomials via differ…
We study solutions of three-term recurrence relations whose $N$-step transfer matrices belong to the uniform Stolz class. In particular, we derive the first order of their uniform asymptotics. For orthonormal polynomials we show more.…
We obtain an asymptotic normality result that reveals the precise asymptotic behavior of the maximum likelihood estimators of parameters for a very general class of linear mixed models containing cross random effects. In achieving the…
We determine an asymptotic formula for the number of integral points of bounded height on a certain toric variety, which is incompatible with part of a preprint by Chambert-Loir and Tschinkel. We provide an alternative interpretation of the…
In this paper, we are interested in matrix valued orthogonal polynomials on the real line with respect to exponential weights. We obtain strong asymptotics as the degree tends to infinity in different regions of the complex plane, as well…
A new equivalence notion between non-stationary subdivision schemes, termed asymptotical similarity, which is weaker than asymptotical equivalence, is introduced and studied. It is known that asymptotical equivalence between a…
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings,…
We investigate asymptotic polynomial approximation for a class of weighted Bloch functions in the unit disc. Our main result is a structural theorem on asymptotic polynomial approximation in the unit disc, in the flavor of the classical…
We present expressions for the coefficients which arise in asymptotic expansions of multiple integrals of Laplace type (the first term of which is known as Laplace's approximation) in terms of asymptotic series of the functions in the…
In this paper, ordinary and exponential dichotomies are defined in differential equations with equations with piecewise constant argument of general type. We prove the asymptotic equivalence between the bounded solutions of a linear system…
We develop a unified construction of matrix-valued orthogonal polynomials associated with discrete weights, yielding bispectral sequences as eigenfunctions of second-order difference operators. This general framework extends the discrete…
Approximate Bayesian computation allows for statistical analysis in models with intractable likelihoods. In this paper we consider the asymptotic behaviour of the posterior distribution obtained by this method. We give general results on…
The non-asymptotic tail bounds of random variables play crucial roles in probability, statistics, and machine learning. Despite much success in developing upper bounds on tail probability in literature, the lower bounds on tail…
In this paper, we develop a non-asymptotic local normal approximation for multinomial probabilities. First, we use it to find non-asymptotic total variation bounds between the measures induced by uniformly jittered multinomials and the…
In the present paper we consider the varying coefficient model which represents a useful tool for exploring dynamic patterns in many applications. Existing methods typically provide asymptotic evaluation of precision of estimation…
We explore the asymptotic behavior of the centroids of random polygons constructed from regular polygons with vertices on the unit circle by extending the rays so that their lengths form a random permutation of the first (n) integers.…
In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold, and the probability of success in sequences of optimal stopping problems. This method, based on the resolution of a first-order…
We provide a complete asymptotic distribution theory for clustered data with a large number of independent groups, generalizing the classic laws of large numbers, uniform laws, central limit theory, and clustered covariance matrix…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
Asymptotic formulas are derived for the Stieltjes-Wigert polynomials $S_n(z;q)$ in the complex plane as the degree $n$ grows to infinity. One formula holds in any disc centered at the origin, and the other holds outside any smaller disc…
This paper deals with the asymptotic study of the so-called canard solutions, which arise in the study of real singularly perturbed ODEs. Starting near an attracting branch of the "slow curve", those solutions are crossing a turning point…