Related papers: Probabilistic Zero Bounds of Certain Random Polyno…
We show that the Newton polytope of a polynomial has a strong impact on the distribution of its mass and zeros. The basic theme is that Newton polytopes determine allowed and forbidden regions for these distributions. We equip the space of…
In this paper, we obtain a Schwartz-Zippel type estimate for homogenous finite field polynomials. Specifically, we use a probabilistic recursion technique to find upper and lower bounds for the number of zeros of a homogenous polynomial and…
Addressing a problem posed by W. Li and A. Wei (2009), we investigate the average number of (complex) zeros of a random harmonic polynomial $p(z) + \overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients are independent…
In this paper we deduce a universal result about the asymptotic distribution of roots of random polynomials, which can be seen as a complement to an old and famous result of Erdos and Turan. More precisely, given a sequence of random…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…
Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
PAC-Bayesian bounds are known to be tight and informative when studying the generalization ability of randomized classifiers. However, they require a loose and costly derandomization step when applied to some families of deterministic…
We propose a way to find the asymptotic distribution of zeros of orthogonal polynomials p_n(x) satisfying a difference equation of the form B(x)p_n(x+\delta)-C(x,n)p_n(x)+D(x)p_n(x-\delta)=0. We calculate the asymptotic distribution of…
Aggregated predictors are obtained by making a set of basic predictors vote according to some weights, that is, to some probability distribution. Randomized predictors are obtained by sampling in a set of basic predictors, according to some…
We address the problem of producing a lower bound for the mean of a discrete probability distribution, with known support over a finite set of real numbers, from an iid sample of that distribution. Up to a constant, this is equivalent to…
Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…
We introduce methods to bound the mean of a discrete distribution (or finite population) based on sample data, for random variables with a known set of possible values. In particular, the methods can be applied to categorical data with…
Using coupling techniques based on Stein's method for probability approximation, we revisit classical variance bounding inequalities of Chernoff, Cacoullos, Chen and Klaassen. Taking advantage of modern coupling techniques allows us to…
Effective bounds on the union probability are well known to be beneficial in the analysis of stochastic problems in many areas, including probability theory, information theory, statistical communications, computing and operations research.…
We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…
We establish the asymptotic zero distribution for polynomials generated by a four-term recurrence relation with varying recurrence coefficients having a particular limiting behavior. The proof is based on ratio asymptotics for these…