Related papers: Free Exponential Families as Kernel Families

D. Voiculescu [2] proved that a standard family of independent random unitary k by k matrices and a constant k by k unitary matrix is asymtotically free as k goes to infinity. This result was a key ingredient in Voiculescu's proof [3] that…

There is a large literature on cover-free families of finite sets, because of their many applications in combinatorial group testing, cryptographic and communications. This work studies the generalization of cover-free families from sets to…

On a compact interval, we introduce and study a whole family of wavelets depending on a free parameter that can be suitably modulated to improve performance. Such wavelets arise from de la Vall\'ee Poussin (VP) interpolation at Chebyshev…

We construct six infinite series of families of pairs of curves (X,Y) of arbitrarily high genus, defined over number fields, together with an explicit isogeny from the Jacobian of X to the Jacobian of Y splitting multiplication by 2, 3, or…

In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…

An algebraic interpretation of the one-variable quantum $q$-Krawtchouk polynomials is provided in the framework of the Schwinger realization of $\mathcal{U}_{q}(sl_{2})$ involving two independent $q$-oscillators. The polynomials are shown…

We study asymptotic properties of expectation propagation (EP) -- a method for approximate inference originally developed in the field of machine learning. Applied to generalized linear models, EP iteratively computes a multivariate…

Maximum likelihood learning with exponential families leads to moment-matching of the sufficient statistics, a classic result. This can be generalized to conditional exponential families and/or when there are hidden data. This document…

We develop and compare e-variables for testing whether $k$ samples of data are drawn from the same distribution, the alternative being that they come from different elements of an exponential family. We consider the GRO (growth-rate…

We propose a new class of models for random permutations, which we call log-linear models, by the analogy with log-linear models used in the analysis of contingency tables. As a special case, we study the family of all Luce-decomposable…

For each of the four particle processes given by Dieker and Warren [arXiv:0707.1843], we show the $n$-step transition kernels are given by the (dual) (weak) refined symmetric Grothendieck functions up to a simple overall factor. We do so by…

The Quantum Symmetric Simple Exclusion Process (QSSEP) is a model of quantum particles hopping on a finite interval and satisfying the exclusion principle. Recently Bernard and Jin have studied the fluctuations of the invariant measure for…

The `excised ensemble', a random matrix model for the zeros of quadratic twist families of elliptic curve $L$-functions, was introduced by Due\~nez, Huynh, Keating, Miller and Snaith. The excised model is motivated by a formula for central…

Kernel Estimation provides an unbinned and non-parametric estimate of the probability density function from which a set of data is drawn. In the first section, after a brief discussion on parametric and non-parametric methods, the theory of…

In earlier work, we introduced three families of polynomials where the generating function of each set includes one of the three Jackson $q$-analogs of the Bessel function. This paper gives determinant representation for each family, their…

We establish a one-to-one correspondence between the set of minimal exponential families of dimension n defined on a finite sample space {\Omega} and the affine Grassmannian associated to an appropriate vector space of functions.

A family of sets is called $r$-\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$-cover free family is simply an antichain with respect to set inclusion. Thus, Sperner's…

Using the KKS inequalities, we establish bounds on the numbers of $k$-sets in the increasing families generated by self-dual clutters (i.e., clutters $\mathcal{A}$ that coincide with the blockers $\mathfrak{B}(\mathcal{A})$) on their ground…

We consider a family of determinantal random point processes on the two-dimensional lattice and prove that members of our family can be interpreted as a kind of Gibbs ensembles of nonintersecting paths. Examples include probability measures…

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…