Related papers: Tsirelson Polytopes and Randomness Generation
A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…
Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…
We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…
We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…
Maximal violation of the CHSH-Bell inequality is usually said to be a feature of anticommuting observables. In this work we show that even random observables exhibit near-maximal violations of the CHSH-Bell inequality. To do this, we use…
We use tools from random matrix theory to study the multi-spiked tensor model, i.e., a rank-$r$ deformation of a symmetric random Gaussian tensor. In particular, thanks to the nature of local optimization methods used to find the maximum…
The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…
We study concentration properties of vertex degrees of $n$-dimensional Erdos-R\'enyi random graphs with the edge probability $\rho/n$ by means of high moments of these random variables in the limit when $n$ and $\rho$ tend to infinity.…
We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…
We treat a random number generation from an i.i.d. probability distribution of $P$ to that of $Q$. When $Q$ or $P$ is a uniform distribution, the problems have been well-known as the uniform random number generation and the resolvability…
Ensembles of random stochastic and bistochastic matrices are investigated. While all columns of a random stochastic matrix can be chosen independently, the rows and columns of a bistochastic matrix have to be correlated. We evaluate the…
A comprehensive treatment of the quantification of randomness certified device-independently by using the Hardy and Cabello-Liang-Li (CLL) nonlocality relations is provided in the two parties - two measurements per party - two outcomes per…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the…
Bipartite and tripartite EPR-Bell type systems are examined via joint quasi-probability distributions where elementary probabilities are permitted to be negative. It is shown that such distributions exist only when the no-signalling…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
We examine rules for predicting whether a point in $\mathbb{R}$ generated from a 50-50 mixture of two different probability distributions came from one distribution or the other, given limited (or no) information on the two distributions,…
New non-asymptotic random coding theorems (with error probability $\epsilon$ and finite block length $n$) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
In probability theory, the Chernoff bound gives exponentially decreasing bounds on tail distributions for sums of independent random variables and such bound is applied at different fields in science and engineering. In this work, we…