Related papers: An identification problem in an urn and ball model…
We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, $n$ players are fitted with randomly assigned colored hats. Individual players can…
The exact expression for the probability density $p_{_N}(x)$ for sums of a finite number $N$ of random independent terms is obtained. It is shown that the very tail of $p_{_N}(x)$ has a Gaussian form if and only if all the random terms are…
Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…
Consider $n$ players whose "scores" are independent and identically distributed values $\{X_i\}_{i=1}^n$ from some discrete distribution $F$. We pay special attention to the cases where (i) $F$ is geometric with parameter $p\to0$ and (ii)…
We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…
In this article, we look at a hat-guessing game, in which each player must guess the color of their own hat while only seeing the hats of the other players. We focus on the case of two hat colors and a countably infinite number of players.…
We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $\mathbb{P}_R$ and $\mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and…
A vertex colouring of a given graph $G$ can be considered as a random experiment. A discrete random variable $X$, corresponding to this random experiment, can be defined as the colour of a randomly chosen vertex of $G$ and a probability…
In this work, we revisit the problem of uniformity testing of discrete probability distributions. A fundamental problem in distribution testing, testing uniformity over a known domain has been addressed over a significant line of works, and…
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…
Models based on assumptions of multivariate regular variation and hidden regular variation provide ways to describe a broad range of extremal dependence structures when marginal distributions are heavy tailed. Multivariate regular variation…
Analyzing football score data with statistical techniques, we investigate how the highly co-operative nature of the game is reflected in averaged properties such as the distributions of scored goals for the home and away teams. It turns out…
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color…
We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where…
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set.…
The broadcasting models on a d-ary tree T arise in many contexts such as biology, information theory, statistical physics and computer science. We consider the k-colouring model, i.e. the root of T is assigned an arbitrary colour and,…
Let $N_n=\{1,2,...,n\}$. Elements are drawn from the set $N_n$ with replacement, assuming that each element has probability $1/n$ of being drawn. We determine the limiting distributions for the waiting time until the given portion of pairs…
We obtain concentration and large deviation for the sums of independent and identically distributed random variables with heavy-tailed distributions. Our concentration results are concerned with random variables whose distributions satisfy…
We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…