相关论文: A mean identity for longest increasing subsequence…

We define a type of generalized asymptotic series called $v$-asymptotic. We show that every function with moderate growth at infinity has a $v$-asymptotic expansion. We also describe the set of $v$-asymptotic series, where a given function…

We study the distribution of the length of longest increasing subsequences in random permutations of $n$ integers as $n$ grows large and establish an asymptotic expansion in powers of $n^{-1/3}$. Whilst the limit law was already shown by…

Length generalization is the ability of a learning algorithm to learn a hypothesis which generalizes to longer inputs than the inputs in the training set. In this paper, we provide provable guarantees of length generalization for various…

We establish asymptotic estimates of Mathieu-type series defined by sequences with power-logarithmic or factorial behavior. By taking the Mellin transform, the problem is mapped to the singular behavior of certain Dirichlet series, which is…

This paper studies properties of binary runlength-limited sequences with additional constraints on their Hamming weight and/or their number of runs of identical symbols. An algebraic and a probabilistic (entropic) characterization of the…

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…

Generalized power asymptotic expansions of solutions to differential equations that depend on parameters are investigated. The changing nature of these expansions as the parameters of the model cross critical values is discussed. An…

We present an abstract framework for asymptotic analysis of convergence based on the notions of eventual families of sets that we define. A family of subsets of a given set is called here an "eventual family" if it is upper hereditary with…

The problem of sequential anomaly detection is considered, where multiple data sources are monitored in real time and the goal is to identify the "anomalous" ones among them, when it is not possible to sample all sources at all times. A…

We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion with uniform error terms. We obtain the expansion from a local central limit theorem and we state all coefficients explicitly as…

We study asymptotic behavior of one-step $M$-estimators based on samples from arrays of not necessarily identically distributed random variables and representing explicit approximations to the corresponding consistent $M$-estimators. These…

Applying the approach based on the equation for the derivative, we construct several expansions of the solutions of the general Heun equation in terms of the incomplete Beta functions. Several expansions in terms of the Appell generalized…

For long-memory time series, inference based on resampling is of crucial importance, since the asymptotic distribution can often be non-Gaussian and is difficult to determine statistically. However due to the strong dependence, establishing…

In this paper we consider the initial value problem for a family of shallow water equations on the line $\R$ with various asymptotic conditions at infinity. In particular we construct solutions with prescribed asymptotic expansion as…

An asymptotic expansion with respect to a small parameter of the solution of the Cauchy problem is constructed for a system of three transfer equations, two of which are singularly perturbed by the degeneracy of the entire senior part of…

We present a general method to obtain asymptotic power series for three kinds of sequences. And we give recurrence relations for determining the coefficients of asymptotic power series for these sequences. As applications, we show how these…

Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patterns are promising candidates, as frequency is a natural…

A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen…

The longest increasing subsequence of a random walk with mean zero and finite variance is known to be $n^{1/2 + o(1)}$. We show that this is not universal for symmetric random walks. In particular, the symmetric Ultra-fat tailed random walk…

The asymptotic behaviour is studied of exponentially bounded sequences of codimensions of identities of algebras with unity. A series of algebras is constructed for which the base of the exponential increases by exactly one when an outer…