相关论文: Coverage of space in Boolean models
Completion problems, of recovering a point from a set of observed coordinates, are abundant in applications to image reconstruction, phylogenetics, and data science. We consider a completion problem coming from algebraic statistics: to…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
Let A={a_s(mod n_s)}_{s=1}^k and B={b_t(mod m_t)}_{t=1}^l be two systems of residue classes. If |{1\le s\le k: x=a_s (mod n_s)}| and |{1\le t\le l: x=b_t (mod m_t)}| are equal for all integers x, then A and B are said to be covering…
Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…
This paper focuses on the problem of determining as large a region as possible where a function exceeds a given threshold with high probability. We assume that we only have access to a noise-corrupted version of the function and that…
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…
Due to the corresponding fact concerning Hilbert spaces, it is natural to ask if the linearity and the orthogonality structure of a Hilbert $C^*$-module determine its $C^*$-algebra-valued inner product. We verify this in the case when the…
We consider the Poisson Boolean model of continuum percolation on a homogeneous Riemannian manifold $M$. Let $lambda$ be intensity of the Poisson process in the model and let $lambda_u$ be the infimum of the set of intensities that a.s.…
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…
An encoder observes a point pattern---a finite number of points in the interval $[0,T]$---which is to be described to a reconstructor using bits. Based on these bits, the reconstructor wishes to select a subset of $[0,T]$ that contains all…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm…
This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
We show that for every $d\ge 1$, if $L_1,\ldots, L_d$ are linearly ordered compact spaces and there is a continuous surjection \[ L_1\times L_2\times \dots\times L_d\to K_1\times K_2\times\ldots\times K_{d}\times K_{d+1},\] where all the…
Ensuring that predictions of machine learning (ML) classification models are accompanied by uncertainty estimates is one of the main pillars of trustworthy AI. Current research in uncertainty quantification focuses mainly on epistemic…
We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length be rank-one, as it was shown in [6][L. Shue, B.D.O.…
This article proves the well posedness of the boundary value problemthat arises when PML algorithms are applied to Pauli's equationswith a three dimensional rectangle as computational domain. The absorptionsare positive near the boundary…
A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…
We investigate geometric properties of indecomposable but non-irreducible Lorentzian manifolds, which are total spaces of circle bundles. We investigate under which conditions these manifolds are complete and give examples which fulfill the…