Related papers: No-Go Theorems for Distributive Laws
Fluctuation theorems specify the non-zero probability to observe negative entropy production, contrary to a naive expectation from the second law of thermodynamics. For closed particle trajectories in a fluid, Stokes theorem can be used to…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a…
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…
For a compact and convex window, Mecke described a process of tessellations which arise from cell divisions in discrete time. At each time step, one of the existing cells is selected according to an equally-likely law. Independently, a line…
We prove normal distribution laws for primes of bad semistable reduction in families of curves. As a consequence, we deduce that when ordered by height, $100\%$ of curves in these families have, in a precise sense, many such primes.
This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating…
We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels…
In probability theory and statistics, the IID model represents a single population, and a large, potentially infinite sample from this population. Main theorems, in particular the central limit theorem and laws of large number (LLN) assure…
We derive two related novel bounds on single-variable marginal probability distributions in factor graphs with discrete variables. The first method propagates bounds over a subtree of the factor graph rooted in the variable, and the second…
A tempered version of the discrete Linnik distribution is introduced in order to obtain integer-valued distribution families connected to stable laws. The proposal constitutes a generalization of the well-known Poisson-Tweedie law, which is…
The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…
Q-conditional symmetries (nonclassical symmetries) for a general class of two-component reaction-diffusion systems with non-constant diffusivities are studied. The work is a natural continuation of our paper (Cherniha and Davydovych, 2012)…
In semantics and in programming practice, algebraic concepts such as monads or, essentially equivalently, (large) Lawvere theories are a well-established tool for modelling generic side-effects. An important issue in this context are…
We investigate the behavior of a simple majority dynamics on networks of agents whose interaction topology exhibits a community structure. By leveraging recent advancements in the analysis of dynamics, we prove that, when the states of the…
A random variable (r.v.) X is said to follow Benford's law if log(X) is uniform mod 1. Many experimental data sets prove to follow an approximate version of it, and so do many mathematical series and continuous random variables. This…
That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…
Maximum entropy principle (MEP) offers an effective and unbiased approach to inferring unknown probability distributions when faced with incomplete information, while neural networks provide the flexibility to learn complex distributions…
We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for…