相关论文: On the symbol error probability of regular polytop…

We study mesoscopic fluctuations of orthogonal polynomial ensembles on the unit circle. We show that asymptotics of such fluctuations are stable under decaying perturbations of the recurrence coefficients, where the appropriate decay rate…

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

We study the hole probability of Gaussian entire functions. More specifically, we work with entire functions in Taylor series form with i.i.d complex Gaussian random variables and arbitrary non-random coefficients. A hole is the event where…

Generalizing the well-known relations on characteristic functions on a plane to the case of a one-dimensional regular surface (curve) with compact support, we establish implicit equations for these functions. Introducing an approximation,…

We consider the problem of identifying the support of the block signal in a sequence when both the length and the location of the block signal are unknown. The multivariate version of this problem is also considered, in which we try to…

Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide''…

An analysis of the characteristic function of Gaussian quadratic forms is presented in [1] to study the performance of multichannel communication systems. This technical report reviews this analysis, obtaining alternative expressions to…

We estimate the support of a uniform density, when it is assumed to be a convex polytope or, more generally, a convex body in $\R^d$. In the polytopal case, we construct an estimator achieving a rate which does not depend on the dimension…

We describe a construction for d-polytopes generalising the well known stacking operation. The construction is applied to produce 2-simplicial and 2-simple 4-polytopes with g_2=0 on any number of n >= 13 vertices. In particular, this…

Continuous input signals like images and time series that are irregularly sampled or have missing values are challenging for existing deep learning methods. Coherently defined feature representations must depend on the values in unobserved…

We introduce a generic estimator for the false discovery rate of any model selection procedure, in common statistical modeling settings including the Gaussian linear model, Gaussian graphical model, and model-X setting. We prove that our…

We show that the density of quadratic forms in $n$ variables over ${\mathbb Z}_p$ that are isotropic is a rational function in $p$, where the rational function is independent of $p$, and we determine this rational function explicitly. As a…

Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper we interpret and extend…

The random convex hull of a Poisson point process in $\mathbb{R}^d$ whose intensity measure is a multiple of the standard Gaussian measure on $\mathbb{R}^d$ is investigated. The purpose of this paper is to invent a new viewpoint on these…

Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the…

We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L \times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder…

The error exponent of the typical random code is defined as the asymptotic normalized expectation of the logarithm of the probability of error, as opposed to the traditional definition of the random coding exponent as the normalized…

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…