Related papers: Sampling Sets for the Nevanlinna class
Let $X_N$ be an $N$-dimensional subspace of $L_2$ functions on a probability space $(\Omega, \mu)$ spanned by a uniformly bounded Riesz basis $\Phi_N$. Given an integer $1\leq v\leq N$ and an exponent $1\leq q\leq 2$, we obtain universal…
In this paper we present new constructive methods, random and deterministic, for the efficient subsampling of finite frames in $\mathbb C^m$. Based on a suitable random subsampling strategy, we are able to extract from any given frame with…
In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…
We investigate the systematic mechanism for designing fast mixing Markov chain Monte Carlo algorithms to sample from discrete point processes under the Dobrushin uniqueness condition for Gibbs measures. Discrete point processes are defined…
The concept of median/consensus has been widely investigated in order to provide a statistical summary of ranking data, i.e. realizations of a random permutation $\Sigma$ of a finite set, $\{1,\; \ldots,\; n\}$ with $n\geq 1$ say. As it…
Let $\mathbb C$ be the complex plane, $E$ be a measurable subset in a segment $[0, R]$ of the positive semiaxis $\mathbb R^+$, $u\not\equiv -\infty$ be a subharmonic function on $\mathbb C$. The main result of this article is an upper…
We are interested in situations where the Hausdorff measure and Hausdorff content of a set are equal in the critical dimension. Our main result shows that this equality holds for any subset of a self-similar set corresponding to a…
It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…
Samplets are data adapted multiresolution analyses of localized discrete signed measures. They can be constructed on scattered data sites in arbitrary dimension such that they exhibit vanishing moments with respect to any prescribed set of…
Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling…
Sampling is a fundamental aspect of any implementation of compressive sensing. Typically, the choice of sampling method is guided by the reconstruction basis. However, this approach can be problematic with respect to certain hardware…
The notion of supershift generalizes that one of superoscillation and expresses the fact that the sampling of a function in an interval allows to compute the values of the function outside the interval. In a previous paper we discussed the…
We characterize bounded, compact, and Hilbert-Schmidt composition-differentiation operators on weighted Dirichlet spaces. The essential norm is estimated via the asymptotic behavior of a function that involves the generalized Nevanlinna…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
The paper deals with the necessary and sufficient conditions for obtaining reconstruction formulae and sampling theorems for every function belonging to the principal shift invariant subspace of $L^2(\mathbb{H}^n)$, both in the time domain…
Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…
We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…
We show that the maximal Nevanlinna counting function and the Carleson function of analytic self-maps of the unit disk are equivalent, up to constants.
In the last fifteen the subset sampling method has often been used in reliability problems as a tool for calculating small probabilities. This method is extrapolating from an initial Monte Carlo estimate for the probability content of a…
The Sz.-Nagy Foias characteristic function for a contraction has had a rejuvenation in recent times due to a number of authors. Such a classical object relates to an object of very contemporary interest, viz., the complete Nevanlinna-Pick…