Related papers: Tsirelson Polytopes and Randomness Generation
We study the supremum of some random Dirichlet polynomials with independent coefficients and obtain sharp upper and lower bounds for supremum expectation thus extending the results from our previous work (see…
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal…
A sharp-threshold theorem is proved for box-crossing probabilities on the square lattice. The models in question are the random-cluster model near the self-dual point $p_{\mathrm {sd}}(q)=\sqrt{q}/(1+\sqrt{q})$, the Ising model with…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
We view sequential design as a model selection problem to determine which new observation is expected to be the most informative, given the existing set of observations. For estimating a probability distribution on a bounded interval, we…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…
For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
We introduce a family of boundary confinements for Coulomb gas ensembles, and study them in the two-dimensional determinantal case of random normal matrices. The family interpolates between the free boundary and hard edge cases, which have…
Any limiting point process for the time normalized exceedances of high levels by a stationary sequence is necessarily compound Poisson under appropriate long range dependence conditions. Typically exceedances appear in clusters. The…
We present a general approach to deriving bounds on the generalization error of randomized learning algorithms. Our approach can be used to obtain bounds on the average generalization error as well as bounds on its tail probabilities, both…
Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these…
We present a violation of the CHSH inequality without the fair sampling assumption with a continuously pumped photon pair source combined with two high efficiency superconducting detectors. Due to the continuous nature of the source, the…
Bell experiments can be used to generate private random numbers. An ideal Bell experiment would involve measuring a state of two maximally entangled qubits, but in practice any state produced is subject to noise. Here we consider how the…
Choose n random, independent points in R^d according to a fixed distribution. The convex hull of these points is a random polytope. In some cases, central limit theorems have been proven for the components of f-vectors of random polytopes…
We consider a totally asymmetric exclusion process on the positive half-line. When particles enter in the system according to a Poisson source, Liggett has computed all the limit distributions when the initial distribution has an asymptotic…
Under suitable hypotheses, we construct a probability measure on the set of closed maximal isotropic subspaces of a locally compact quadratic space over F_p. A random subspace chosen with respect to this measure is discrete with probability…
We present a solution to a problem suggested by Philippe Biane: We prove that a certain Plancherel-type probability distribution on partitions converges, as partitions get large, to a new determinantal random point process on the set…
Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large…