Related papers: Maximal percentages in Polya's urn
Take a set of balls in $\mathbb R^d$. We find a subset of pairwise disjoint balls whose combined perimeter controls the perimeter of the union of the original balls. This can be seen as a boundary version of the Vitali covering lemma. We…
We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…
In the present paper we show that in P\'{o}lya's urn model, for an arbitrarily fixed initial distribution of the urn, the corresponding random variables satisfy a convex ordering with respect to the replacement parameter. As an application,…
A classical longstanding open problem in statistics is finding an explicit expression for the probability measure which maximizes entropy with respect to given constraints. In this paper a solution to this problem is found, using…
In this exposition-type note we present detailed proofs of certain assertions concerning several algebraic properties of the cone and cylinder algebras. These include a determination of the maximal ideals, the solution of the B\'ezout…
In this article, we prove that from any sequence of balls whose associated limsup set has full $\mu$-measure, one can extract a well-distributed subsequence of balls. From this, we deduce the optimality of various lower bounds for the…
Motivated by a problem posed by Aldous, our goal is to find the maximal-entropy win-martingale: In a sports game between two teams, the chance the home team wins is initially $x_0 \in (0,1)$ and finally 0 or 1. As an idealization we take a…
We study a class of unbalanced constant-differentials P\'olya processes on white and blue balls. We show that the number of white balls, the number of blue balls, and the total number of balls, when appropriately scaled, all converge in…
We study extreme value statistics of multiple sequences of random variables. For each sequence with N variables, independently drawn from the same distribution, the running maximum is defined as the largest variable to date. We compare the…
We study multiplicities of jumping numbers of multiplier ideals in a smooth variety of arbitrary dimension. We prove that the multiplicity function is a quasi-polynomial, hence proving that the Poincar\'e series is a rational function. We…
Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…
There seems to be an upper limit to predicting the outcome of matches in (semi-)professional sports. Recent work has proposed that this is due to chance and attempts have been made to simulate the distribution of win percentages to identify…
We use sets of assignments, a.k.a. teams, and measures on them to define probabilities of first-order formulas in given data. We then axiomatise first-order properties of such probabilities and prove a completeness theorem for our…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling…
A shape optimization program is developed for the ratio of Riesz capacities $\text{Cap}_q(K)/\text{Cap}_p(K)$, where $K$ ranges over compact sets in $\mathbb{R}^n$. In different regions of the $pq$-parameter plane, maximality is conjectured…
Systems of indirect voting based on the principle of qualified majority can be analysed using the methods of game theory. In particular, this applies to the voting system in the Council of the European Union, which was recently a subject of…
We study probability density functions that are log-concave. Despite the space of all such densities being infinite-dimensional, the maximum likelihood estimate is the exponential of a piecewise linear function determined by finitely many…
This note presents a proof of P\'olya's random walk theorem using classical methods from special function theory and asymptotic analysis.
Consider a bin containing $n$ balls colored with two colors. In a $k$-query, $k$ balls are selected by a questioner and the oracle's reply is related (depending on the computation model being considered) to the distribution of colors of the…