Related papers: On the identifiability of Dirichlet mixture models
We show that under minimal assumptions, the intrinsic metric induced by a strongly local Dirichlet form induces a length space. A main input is a dual characterization of length spaces in terms of the property that the 1-Lipschitz functions…
In microbiome studies, it is often of great interest to identify clusters or partitions of microbiome profiles within a study population and to characterize the distinctive attributes of each resulting microbial community. While raw counts…
In this paper, we discuss to the nonuniform sampling problem in principal shift-invariant subspaces of mixed Lebesgue spaces. We proposed a fast reconstruction algorithm which allows to exactly reconstruct the functions in the principal…
We study identifiability of the parameters in autoregressions defined on a network. Most identification conditions that are available for these models either rely on the network being observed repeatedly, are only sufficient, or require…
We introduce a novel prior distribution for modelling the weights in mixture models based on a generalisation of the Dirichlet distribution, the Selberg Dirichlet distribution. This distribution contains a repulsive term, which naturally…
We use a diffuse interface method for solving Poisson's equation with a Dirichlet condition on an embedded curved interface. The resulting diffuse interface problem is identified as a standard Dirichlet problem on approximating regular…
Dirichlet process mixture models (DPMM) play a central role in Bayesian nonparametrics, with applications throughout statistics and machine learning. DPMMs are generally used in clustering problems where the number of clusters is not known…
We derive necessary density conditions for sampling and for interpolation in general reproducing kernel Hilbert spaces satisfying some natural conditions on the geometry of the space and the reproducing kernel. If the volume of shells is…
On the space $\mathcal{L}_{n+1}$ of unimodular lattices in $\mathbb{R}^{n+1}$, we consider the standard action of $a(t)=\mathrm{diag}(t^n,t^{-1},\ldots,t^{-1})\in \mathrm{SL}(n+1,\mathbb{R})$ for $t>1$. Let $M$ be a nondegenerate…
We study the Dirichlet problem for fully nonlinear, degenerate elliptic equations of the form f(Hess, u)=0 on a smoothly bounded domain D in R^n. In our approach the equation is replaced by a subset F of the space of symmetric nxn-matrices,…
This work provides an extension of parts of the classical finite dimensional sub-elliptic theory in the context of infinite dimensional compact connected metrizable groups. Given a well understood and well behaved bi-invariant Laplacian,…
Mixture distributions are a workhorse model for multimodal data in information theory, signal processing, and machine learning. Yet even when each component density is simple, the differential entropy of the mixture is notoriously hard to…
We develop a density based topology optimization method for linear elasticity based on the cut finite element method. More precisely, the design domain is discretized using cut finite elements which allow complicated geometry to be…
We prove bounds on statistical distances between high-dimensional exchangeable mixture distributions (which we call \emph{permutation mixtures}) and their i.i.d. counterparts. Our results are based on a novel method for controlling $\chi^2$…
Finite volume methods for problems involving second order operators with full diffusion matrix can be used thanks to the definition of a discrete gradient for piecewise constant functions on unstructured meshes satisfying an orthogonality…
We review basic design principles underpinning the construction of mimetic finite difference and a few finite volume and finite element schemes for mixed formulations of elliptic problems. For a class of low-order mixed-hybrid schemes, we…
Statistical latent class models are widely used in social and psychological researches, yet it is often difficult to establish the identifiability of the model parameters. In this paper we consider the identifiability issue of a family of…
Conditions are presented for different types of identifiability of discrete variable models generated over an undirected graph in which one node represents a binary hidden variable. These models can be seen as extensions of the latent class…
Disjointly strictly singular inclusions between variable Lebesgue spaces $L^{p(\cdot)}(\mu)$ on finite measure are characterized. Suitable criteria in terms of the (bounded or unbounded) exponents are given. It is proved the equivalence of…
Distribution matching is the process of invertibly mapping a uniformly distributed input sequence onto sequences that approximate the output of a desired discrete memoryless source. The special case of a binary output alphabet and…