Related papers: No-Go Theorems for Distributive Laws

Consensus about the universality of the power law feature in complex networks is experiencing profound challenges. To shine fresh light on this controversy, we propose a generic theoretical framework in order to examine the power law…

Many systems exhibit a digit bias. For example, the first digit base 10 of the Fibonacci numbers, or of $2^n$, equals 1 not 10% or 11% of the time, as one would expect if all digits were equally likely, but about 30% of the time. This…

We investigate dynamically and statistically diffusive motion in a Klein-Gordon particle chain in the presence of disorder. In particular, we examine a low energy (subdiffusive) and a higher energy (self-trapping) case and verify that…

We study the properties of the set of marginal distributions of infinite translation-invariant systems in the 2D square lattice. In cases where the local variables can only take a small number $d$ of possible values, we completely solve the…

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…

We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…

Graphical models are a succinct way to represent the structure in probability distributions. This article analyzes the graphical model of nodal voltages in non-radial power distribution grids. Using algebraic and structural properties of…

We test the modified Newtonian dynamics (MOND) theory with the velocity-dispersion profiles of Galactic globular clusters populating the outermost region of the Milky Way halo, where the Galactic acceleration is lower than the…

Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…

We present the mixture-of-parents maximum entropy Markov model (MoP-MEMM), a class of directed graphical models extending MEMMs. The MoP-MEMM allows tractable incorporation of long-range dependencies between nodes by restricting the…

The monad of convex sets of probability distributions is a well-known tool for modelling the combination of nondeterministic and probabilistic computational effects. In this work we lift this monad from the category of sets to the category…

In this paper, we give a novel abstract description of Szabo's polycategories. We use the theory of double clubs -- a generalisation of Kelly's theory of clubs to `pseudo' (or `weak') double categories -- to construct a pseudo-distributive…

In this paper, we give an alternative proof of the fact that, when compounding a nonnegative probability distribution, convex ordering between the distributions of the number of summands implies convex ordering between the resulting…

That the logarithmic distribution manifests itself in the random as well as in the deterministic (multiplication processes) has long intrigued researchers in Benford's Law. In this article it is argued that it springs from one common…

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…

A key concern in modern distributed systems is to avoid the cost of coordination while maintaining consistent semantics. Until recently, there was no answer to the question of when coordination is actually required. In this paper we present…

While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of computations that are too expensive to run. Since mathematical logic is a powerful tool…

Monod's law is a widely accepted phenomenology for bacterial growth. Since it has the same functional form as the Michaelis--Menten equation for enzyme kinetics, cell growth is often considered to be locally constrained by a single…

We prove the Lukacs-Olkin-Rubin theorem without invariance of the distribution of the "quotient", which was the key assumption in the original proof of [Olkin--Rubin, Ann. Math. Stat. 33 (1962), 1272--1280]. Instead we assume existence of…

Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other secrets. Recently a number of authors studied distributed epistemic gossip protocols. These…