相关论文: Statistical auditing and randomness test of lotto …

A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting in each round, as well as the final score of the…

Predicting the outcome of sports events is a hard task. We quantify this difficulty with a coefficient that measures the distance between the observed final results of sports leagues and idealized perfectly balanced competitions in terms of…

Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors. Each player can see the hat colors of his neighbors, but…

The following problem is considered. Two players are each required to allocate a quota of~$n$ counters among~$k$ boxes labelled~$1,2,\ldots,k$. At times $t=1,2,3,\ldots$ a random box is identified; the probability of choosing box~$i$…

We will discuss the generalization of entropic uncertainty principles in terms of a game. The game involves k-players, each measuring one of k possible observables. The question is, what is the maximum number of players that can play such…

The classic likelihood ratio test for testing the equality of two covariance matrices breakdowns due to the singularity of the sample covariance matrices when the data dimension $p$ is larger than the sample size $n$. In this paper, we…

Consider the square random matrix $A_n=(a_{ij})_{n,n}$, where $\{a_{ij}:=a_{ij}^{(n)},i,j=1,\ldots,n\}$ is a collection of independent real random variables with means zero and variances one. Under the additional moment condition…

In this paper, we settle the randomized $k$-sever conjecture for the following metric spaces: line, circle, Hierarchically well-separated tree (HST). Specially, we show that there are $O(\log k)$-competitive randomized $k$-sever algorithms…

Consider $n$ independent random numbers with a uniform distribution on $[0,1]$. The number of them that exceed their mean is shown to have an Eulerian distribution, i.e., it is described by the Eulerian numbers. This is related to, but…

Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the…

Democratic societies are built around the principle of free and fair elections, that each citizen's vote should count equal. National elections can be regarded as large-scale social experiments, where people are grouped into usually large…

The distribution function of a random distance in three dimensions is given and some new three-dimensional d2-tests of randomness are suggested. We show that our test statistics are not correlated with the usual test statistics and are…

Online gambling sites offer many different gambling games. In this work we analyse the gambling logs of numerous solely probability-based gambling games and extract the wager and odds distributions. We find that the log-normal distribution…

Monte Carlo simulations are based on the manipulation of random numbers to evaluate probable outcomes, with applicability in a variety of different fields. By assigning probabilities, which can be determined a priori, to various events, it…

Consider $2k-1$ voters, each of which has a preference ranking between $n$ given alternatives. An alternative $A$ is called a Condorcet winner, if it wins against every other alternative $B$ in majority voting (meaning that for every other…

Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…

Randomized mechanisms can have good normative properties compared to their deterministic counterparts. However, randomized mechanisms are problematic in several ways such as in their verifiability. We propose here to derandomize such…

This work studies the problem of separate random number generation from correlated general sources with side information at the tester under the criterion of statistical distance. Tight one-shot lower and upper performance bounds are…

We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has…

We consider a random knockout tournament among players $1, \ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round…