相关论文: The correlation measures of finite sequences: limi…

This article develops a method to construct the optimal sequential test for monitoring the changes in the distribution of finite observation sequences with a general dependence structure. This method allows us to prove that different…

We consider two independent binary i.i.d. random strings $X$ and $Y$ of equal length $n$ and the optimal alignments according to a symmetric scoring functions only. We decompose the space of scoring functions into five components. Two of…

Multivariate distributions are explored using the joint distributions of marginal sample quantiles. Limit theory for the mean of a function of order statistics is presented. The results include a multivariate central limit theorem and a…

We study the distribution modulo one of linear recurrent sequences of real numbers. We prove criteria for the finiteness of the set of limit values of the fractional parts of such a sequence and give lower bounds for the maximal distance…

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

The authors transpose a discrete notion of indetermination coupling in the case of continuous probabilities. They show that this coupling, expressed on densities, cannot be captured by a specific copula which acts on cumulative distribution…

We investigate the minimal error in approximating a general probability measure $\mu$ on $\mathbb{R}^d$ by the uniform measure on a finite set with prescribed cardinality $n$. The error is measured in the $p$-Wasserstein distance. In…

In 1976, Rauzy studied two complexity functions, $\underline{\beta}$ and $\overline{\beta}$, for infinite sequences over a finite alphabet. The function $\underline{\beta}$ achieves its maximum precisely for Borel normal sequences, while…

Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the…

We study extremal statistics and return intervals in stationary long-range correlated sequences for which the underlying probability density function is bounded and uniform. The extremal statistics we consider e.g., maximum relative to…

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…

Ratios of central order statistics seem to be very useful for estimating the tail of the distributions and therefore, quantiles outside the range of the data. In 1995 Isabel Fraga Alves investigated the rate of convergence of three…

Let $(x_n)_{n=1}^{\infty}$ be a sequence on the torus $\mathbb{T}$ (normalized to length 1). A sequence $(x_n)$ is said to have Poissonian pair correlation if, for all $s>0$, $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \# \left\{ 1 \leq m…

Investigations of complexity of sequences lead to important applications such as effective data compression, testing of randomness, discriminating between information sources and many others. In this paper we establish formulas describing…

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

Let $S= (s_1<s_2<\dots)$ be a strictly increasing sequence of positive integers and denote $\mathbf{e}(\beta)=\mathrm{e}^{2\pi i \beta}$. We say $S$ is good if for every real $\alpha$ the limit $\lim_N \frac1N\sum_{n\le N}…

This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…

Correlations play a pivotal role in various fields of science, particularly in quantum mechanics, yet their proper quantification remains a subject of debate. In this work, we aim to discuss the challenge of defining a reliable measure of…

The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…

We introduce a correlation coefficient that is designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., unknown) preferences. The correlation coefficient is designed to…