Related papers: Friedman vs P\'olya

In this article we take a probabilistic look at H\"older's inequality, considering the ratio of terms in the classical H\"older inequality for random vectors in $\mathbb{R}^n$. We prove a central limit theorem for this ratio, which then…

Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined as follows: Throw m balls into n bins i.i.d. according to a…

The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given $n$ balls, each of them colored by one of three colors. A \textit{plurality ball} is one…

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Let $\alpha,\beta,\gamma\in\mathbb{N}$. We prove that given an $r$-colouring of $\mathbb{F}_p$ with $p$ prime, there are more than $c_{r,\alpha,\beta,\gamma} p^2$ solutions to the equation $x^\alpha+y^\beta=z^\gamma$ with all of $x,y,z$ of…

Given a set of n balls each colored with a color, a ball is said to be majority, k-majority, plurality if its color class has size larger than half of the number of balls, has size at least k, has size larger than any other color class;…

For the interacting urn model with polynomial reinforcement, it has been conjectured that almost surely one color monopolizes all the urns if the interaction parameter $p>0$. We disprove the conjecture. For the case $p=1$, we give a…

We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.

We investigate the multiplicity model with m values of some test statistic independently drawn from a mixture of no effect (null) and positive effect (alternative), where we seek to identify, the alternative test results with a controlled…

An extended Polya urn Model with two colors, black and white, is studied with some SLLN and CLT on the proportion of white balls.

Consider a number, finite or not, of urns each with fixed capacity $r$ and balls randomly distributed among them. An overflow is the number of balls that are assigned to urns that already contain $r$ balls. When $r=1$, using analytic…

Sharp, nonasymptotic bounds are obtained for the relative entropy between the distributions of sampling with and without replacement from an urn with balls of $c\geq 2$ colors. Our bounds are asymptotically tight in certain regimes and,…

We propose an elementary but effective approach to studying a general class of Poissonized tenable and balanced urns on two colors. We characterize the asymptotic behavior of the process via a partial differential equation that governs the…

This paper develops an analytic theory for the study of some Polya urns with random rules. The idea is to extend the isomorphism theorem in Flajolet et al. (2006), which connects deterministic balanced urns to a differential system for the…

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,…

We analyse the convergence to equilibrium of the Bernoulli--Laplace urn model: initially, one urn contains $k$ red balls and a second $n-k$ blue balls; in each step, a pair of balls is chosen uniform and their locations are switched. Cutoff…

Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have…

P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…

Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a…

Let $\alpha, \beta \in (0,1)$ such that at least one of them is irrational. We take a random walk on the real line such that the choice of $\alpha$ and $\beta$ has equal probability $1/2$. We prove that almost surely the $\alpha\beta$-orbit…