Related papers: Normal limiting distributions for systems of linea…
In this paper we show that the continuous version of the self normalised process $Y_{n,p}(t)= S_n(t)/V_{n,p}+(nt-[nt])X_{[nt]+1}/V_{n,p}$ where $S_n(t)=\sum_{i=1}^{[nt]} X_i$ and $V_{(n,p)}= \sum_{i=1}^{n}|X_i|^p)^{\frac{1}{p}}$ and $X_i$…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
We discuss a method of the asymptotic computation of moments of the normalized eigenvalue counting measure of random matrices of large order. The method is based on the resolvent identity and on some formulas relating expectations of…
We introduce three models of fragmentation in which the largest fragment in the system can be broken at each time step with a fixed probability, p. We solve these models exactly in the long time limit to reveal stable time invariant…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…
This paper deals with the polynomial linear system solving with errors (PLSwE) problem. Specifically, we focus on the evaluation-interpolation technique for solving polynomial linear systems and we assume that errors can occur in the…
A linear extension of a poset $P$ is a permutation of the elements of the set that respects the partial order. Let $L(P)$ denote the number of linear extensions. It is a #P complete problem to determine $L(P)$ exactly for an arbitrary…
In this paper, we study the limiting distribution of the eigenvalues for random tridiagonal matrix models. The limiting distribution is well described by its moments. Here, an analytical approach allows us, as in the case of Wigner…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…
Sequential estimation of the success probability $p$ in inverse binomial sampling is considered in this paper. For any estimator $\hat p$, its quality is measured by the risk associated with normalized loss functions of linear-linear or…
In this paper, we analyse singular values of a large $p\times n$ data matrix $\mathbf{X}_n= (\mathbf{x}_{n1},\ldots,\mathbf{x}_{nn})$ where the column $\mathbf{x}_{nj}$'s are independent $p$-dimensional vectors, possibly with different…
Statistical system models provide the basis for the examination of various sorts of distributions. Classification distributions are a very common and versatile form of statistics in e.g. real economic, social, and IT systems. The…
A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…
This paper deals with a distributed Mixed-Integer Linear Programming (MILP) set-up arising in several control applications. Agents of a network aim to minimize the sum of local linear cost functions subject to both individual constraints…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…
A standard method for designing randomized algorithms to approximately count the number of solutions of a problem in $\#$P, is by constructing a rapidly mixing Markov chain converging to the uniform distribution over this set of solutions.…
Let ${X}_{k}=(x_{k1}, \cdots, x_{kp})', k=1,\cdots,n$, be a random sample of size $n$ coming from a $p$-dimensional population. For a fixed integer $m\geq 2$, consider a hypercubic random tensor $\mathbf{{T}}$ of $m$-th order and rank $n$…