相关论文: Finite random coverings of one-complexes and the E…
We introduce the coverage correlation coefficient, a novel nonparametric measure of statistical association designed to quantifies the extent to which two random variables have a joint distribution concentrated on a singular subset with…
Is the universe finite or infinite, and what shape does it have? These fundamental questions, of which relatively little is known, are typically studied within the context of the standard model of cosmology where the universe is assumed to…
Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…
We characterise high-dimensional topology that arises from a random Cech complex constructed on the circle. Expected Euler characteristic curve is computed, where we observe limiting spikes. The spikes correspond to expected Betti numbers…
The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…
We show that, by sampling a sufficiently large number of random points in a neighborhood of a compact submanifold M of a Riemannian manifold N, one can recover the topology of M with high confidence. This holds under the assumptions on the…
It is well-known that pure quantum states are typically almost maximally entangled, and thus have close to maximally mixed subsystems. We consider whether this is true for probabilistic theories more generally, and not just for quantum…
The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…
A high number of discrete optimization problems, including Vertex Cover, Set Cover or Feedback Vertex Set, can be unified into the class of covering problems. Several of them were shown to be inapproximable by deterministic algorithms. This…
The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…
We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution $P_{Y \mid X}$. Existing methods, such as conformalized quantile regression and…
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…
It is shown that the topologies and nestings of the zero and nodal sets of random (Gaussian) band limited functions have universal laws of distribution. Qualitative features of the supports of these distributions are determined. In…
It is shown that the topologies and nestings of the zero and nodal sets of random (Gaussian) band limited functions have universal laws of distribution. Qualitative features of the supports of these distributions are determined. In…
Topological descriptors, such as the Euler characteristic function and the persistence diagram, have grown increasingly popular for representing complex data. Recent work showed that a carefully chosen set of these descriptors encodes all…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…
This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…
We introduce a simple, efficient and precise polynomial heuristic for a key NP complete problem, minimum vertex cover. Our method is iterative and operates in probability space. Once a stable probability solution is found we find the true…
We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…