Related papers: Football Group Draw Probabilities and Corrections

Besides of complexities concerning to football championships, it is identified some regularities in them. These regularities refer to goal distributions by goal-players and by games. In particular, the goal distribution by goal-players it…

Methods for generating new distributions from old can be thought of as techniques for simplifying integrals used in reverse. Hence integrating a probability density function (pdf) by parts provides a new way of modifying distributions; the…

This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise probability distributions and a reformulation is introduced…

We want to select the best systems out of a given set of systems (or rank them) with respect to their expected performance. The systems allow random observations only and we assume that the joint observation of the systems has a…

We propose a simple stochastic model describing the position-dependent ball-passing network in football games. In this network, a player on a certain area in the divided fields is a node, and a pass between two nodes corresponds to an edge.…

The purpose of this work is to pose and solve the problem to guide a collection of weakly interacting dynamical systems (agents, particles, etc.) to a specified terminal distribution. The framework is that of mean-field and of cooperative…

In this paper, we introduce and develop the theory of the Collatz process and the method of dynamical balls. We leverage this theory to study the Collatz conjecture. This theory also has a subtle connection with the infamous problem of the…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give a new approach for generating a graphic approximation of…

We first review existing sequential methods for estimating a binomial proportion. Afterward, we propose a new family of group sequential sampling schemes for estimating a binomial proportion with prescribed margin of error and confidence…

One of the main shortcomings of event data in football, which has been extensively used for analytics in the recent years, is that it still requires manual collection, thus limiting its availability to a reduced number of tournaments. In…

An algorithm is presented which, with optimal efficiency, solves the problem of uniform random generation of distribution functions for an n-valued random variable.

The uniform distribution on matrices with specified row and column sums is often a natural choice of null model when testing for structure in two-way tables (binary or nonnegative integer). Due to the difficulty of sampling from this…

In the game of Scrabble, letter tiles are drawn uniformly at random from a bag. The variability of possible draws as the game progresses is a source of variation that makes it more likely for an inferior player to win a head-to-head match…

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…

In classical urn models, one usually draws one ball with replacement at each time unit and then adds one ball of the same colour. Given a weight sequence $(w_k)_{k\in\N}$, the probability of drawing a ball of a certain colour is…

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…

In this paper a new heuristic optimization algorithm has been introduced based on the performance of the major football leagues within each season in EU countries. The algorithm starts with an initial population including three different…

Collective decision-making is vital for recent information and communications technologies. In our previous research, we mathematically derived conflict-free joint decision-making that optimally satisfies players' probabilistic preference…

We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of…