Related papers: Tournament limits: Degree distributions, score fun…
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…
We extend the fair machine learning literature by considering the problem of proportional centroid clustering in a metric context. For clustering $n$ points with $k$ centers, we define fairness as proportionality to mean that any $n/k$…
We formulate the novel class of contextual games, a type of repeated games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game…
We construct a theory of distributions in the setting of analysis on post-critically finite self-similar fractals, and on fractafolds and products based on such fractals. The results include basic properties of test functions and…
We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…
In spite of recent contributions to the literature, informative cluster size settings are not well known and understood. In this paper, we give a formal definition of the problem and describe it from different viewpoints. Data generating…
A remarkable new definition of a self-delimiting universal Turing machine is presented that is easy to program and runs very quickly. This provides a new foundation for algorithmic information theory. This new universal Turing machine is…
In many competitive settings, from education to politics, rules do not reward effort evenly, and thresholds (e.g., grade cutoffs or electoral majorities) make some moments disproportionately important. Success thus depends on efficiently…
We provide a detailed study of topological and combinatorial properties of sectionable tournaments. This class forms an inductively constructed family of tournaments grounded over simply disconnected tournaments, those tournaments whose…
We study the role of finiteness and fluctuations about average quantities for basic structural properties of growing networks. We first determine the exact degree distribution of finite networks by generating function approaches. The…
A tournament is an orientation of a complete graph. We say that a vertex $x$ in a tournament $\vec T$ controls another vertex $y$ if there exists a directed path of length at most two from $x$ to $y$. A vertex is called a king if it…
The paper considers probability distribution, density, conditional distribution and density and conditional moments as well as their kernel estimators in spaces of generalized functions. This approach does not require restrictions on…
We study, in various special cases, total distributions on the product of a finite collection of finite probability spaces and, in particular, the question of when the probability distribution of each factor space is determined by the total…
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…
Instead of testing for unanimous agreement, I propose learning how broad of a consensus favors one distribution over another (of earnings, productivity, asset returns, test scores, etc.). Specifically, given a sample from each of two…
Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational…
When more than one hadron takes part in a hard process, an extended set of quark distribution and fragmentation functions becomes relevant. In this talk, the derivation of Soffer-like bounds for these functions, in the case of a spin-1/2…
It is introduced the concept of Superiority Degree one competitive decision over another. On the basis of this concept the mathematics theoretic structure is developed, which is part of pairs comparisons branch in modern decision making…
The degree distribution is an important characteristic of complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. On the other hand, we often need to…
We consider a class of maps from integral Hankel operators to Hankel matrices, which we call restriction maps. In the simplest case, such a map is simply a restriction of the integral kernel onto integers. More generally, it is given by an…