Related papers: Partition structure and the A-hypergeometric distr…
Several important families of orthogonal polynomials on the real line are called ``hypergeometric'' since they can be explicitly described in terms of some hypergeometric series $_pF_q$ that uses the degree $n$ of the polynomial as a…
The polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. The class includes the uniform and trapezoidal distributions, and is an alternative to the beta…
In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions are exact, we can identify the distributions of basic…
In this paper a new approach is derived in the context of shape theory. The implemented methodology is motivated in an open problem proposed in \citet{GM93} about the construction of certain shape density involving Euler hypergeometric…
A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…
This paper extends the framework of randomised matrix multiplication to a coarser partition and proposes an algorithm as a complement to the classical algorithm, especially when the optimal probability distribution of the latter one is…
In this paper, we study double structures supported on rational normal curves. After recalling the general construction of double structures supported on a smooth curve described in \cite{fer}, we specialize it to double structures on…
We establish an equidistribution theorem for the zeros of random holomorphic sections of high powers of a positive holomorphic line bundle. The equidistribution is associated with a family of singular moderate measures. We also give a…
Nonparametric detection of existence of an anomalous structure over a network is investigated. Nodes corresponding to the anomalous structure (if one exists) receive samples generated by a distribution q, which is different from a…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
Probability distributions supported on the simplex enjoy a wide range of applications across statistics and machine learning. Recently, a novel family of such distributions has been discovered: the continuous categorical. This family enjoys…
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner (whenever possible) on…
A statistical model M is a family of probability distributions, characterised by a set of continuous parameters known as the parameter space. This possesses natural geometrical properties induced by the embedding of the family of…
The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix vector multiplications as a kernel operation. In many cases…
In this article, we propose a new probabilistic model for the distribution of ranks of elliptic curves in families of fixed Selmer rank, and compare the predictions with previous results, and with the databases of curves over the rationals…
This article derives the distribution of random matrix $\mathbf{X}$ associated with the transformation $\mathbf{Y} = \mathbf{X}^{*}\mathbf{X}$, such that $\mathbf{Y}$ has a Riesz distribution for real normed division algebras. Two versions…
In two recent articles we have examined a generalization of the binomial distribution associated with a sequence of positive numbers, involving asymmetric expressions of probabilities that break the symmetry {\it win-loss}. We present in…
Distributionally robust optimization tackles out-of-sample issues like overfitting and distribution shifts by adopting an adversarial approach over a range of possible data distributions, known as the ambiguity set. To balance conservatism…
Let $C$ be the rational normal curve of degree $e$ in $\mathbb{P}^n$, and let $X\subset \mathbb{P}^n$ be a degree $d\ge 2$ hypersurface containing $C$. In previous work, I. Coskun and E. Riedl showed that the normal bundle $N_{C/X}$ is…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…