Related papers: No-Go Theorems for Distributive Laws
Inspired by distributed resource allocation problems in dynamic topology networks, we initiate the study of distributed consensus with finite messaging passing. We first find a sufficient condition on the network graph for which no…
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…
Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a…
We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where variables are set in blocks (both due to Hastad [Hastad 86]); and for a distribution appropriate for the…
We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with…
We generalize the definition of Proof Labeling Schemes to reactive systems, that is, systems where the configuration is supposed to keep changing forever. As an example, we address the main classical test case of reactive tasks, namely, the…
The probability that a number in many naturally occurring tables of numerical data has first significant digit $d$ is predicted by Benford's Law ${\rm Prob} (d) = \log_{10} (1 + {\displaystyle{1\over d}}), d = 1, 2 >..., 9$. Illustrations…
We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…
The no-broadcasting theorem is a fundamental result in quantum information theory. It guarantees that a class of attacks on quantum protocols, based on eavesdropping and indiscriminate copying of quantum information, are impossible. Due to…
The celebrated Bell-Kochen-Specker no-go theorem asserts that quantum mechanics does not present the property of realism, the essence of the theorem is the lack of a joint probability distributions for some experiment settings. In this…
Distributive laws are important for algebraic reasoning in arithmetic and logic. They are equally important for algebraic reasoning about concurrent programs. In existing theories such as Concurrent Kleene Algebra, only partial correctness…
Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model continuous-time transition systems. We develop the theory of…
The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…
Normalization, $D(X + 1) \to D(X) + 1$, is almost a distributive law; but because one of the distributive law axioms only holds up-to-idempotent, it yields a non-associative composition of normalized kernels. We introduce the Markov magmoid…
We consider the problem of searching for proofs in sequential presentations of logics with multiplicative (or intensional) connectives. Specifically, we start with the multiplicative fragment of linear logic and extend, on the one hand, to…
In nature or societies, the power-law is present ubiquitously, and then it is important to investigate the mathematical characteristics of power-laws in the recent era of big data. In this paper we prove the superposition of non-identical…
The ways in which an innovation (e.g., new behaviour, idea, technology, product) diffuses among people can determine its success or failure. In this paper, we address the problem of diffusion of innovations over multiplex social networks…
Being able to successfully determine whether the testing samples has similar distribution as the training samples is a fundamental question to address before we can safely deploy most of the machine learning models into practice. In this…
A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…
We consider a nearest-neighbor, one dimensional random walk $\{X_n\}_{n\geq0}$ in a random i.i.d. environment, in the regime where the walk is transient but with zero speed, so that $X_n$ is of order $n^s$ for some $s<1$. Under the quenched…