Related papers: Weakening and Iterating Laws using String Diagrams
We give sufficient Gordin-type criteria for the iterated (enhanced) weak invariance principle to hold for deterministic dynamical systems. Such an invariance principle is intrinsically related to the interpretation of stochastic integrals.…
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 this work, we leverage the linear algebraic structure of distributed word representations to automatically extend knowledge bases and allow a machine to learn new facts about the world. Our goal is to extract structured facts from…
In this paper, three different proofs to a result of Wang, Peng and Yang (2013) which related to the joint mixability of elliptical distributions with the same characteristic generator are present. Moreover, we generalize this result to any…
An important aspect of improving perturbative predictions in high energy physics is efficiently reducing dimensionally regularised Feynman integrals through integration by parts (IBP) relations. The well-known triangle rule has been used to…
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 present a general theorem for distributed synthesis problems in coordination games with $\omega$-regular objectives of the form: If there exists a winning strategy for the coalition, then there exists an "essential" winning strategy,…
New families of fourth-order composition methods for the numerical integration of initial value problems defined by ordinary differential equations are proposed. They are designed when the problem can be separated into three parts in such a…
We prove a weak iterated invariance principle for a large class of non-uniformly expanding random dynamical systems. In addition, we give a quenched homogenization result for fast-slow systems in the case when the fast component corresponds…
The problem of convergence in law of normed sums of exchangeable random variables is examined. First, the problem is studied w.r.t. arrays of exchangeable random variables, and the special role played by mixtures of products of stable laws…
In the setting of entangled single-sample distributions, the goal is to estimate some common parameter shared by a family of distributions, given one \emph{single} sample from each distribution. We study mean estimation and linear…
We introduce LAM, a subsystem of IMALL2 with restricted additive rules able to manage duplication linearly, called linear additive rules. LAM is presented as the type assignment system for a calculus endowed with copy constructors, which…
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
Linear codes have diverse applications in secret sharing schemes, secure two-party computation, association schemes, strongly regular graphs, authentication codes and communication. There are a large number of linear codes with few weights…
For nonstationary, strongly mixing sequences of random variables taking their values in a finite-dimensional Euclidean space, with the partial sums being normalized via matrix multiplication, with certain standard conditions being met, the…
This paper deals with the binary classification task when the target class has the lower probability of occurrence. In such situation, it is not possible to build a powerful classifier by using standard methods such as logistic regression,…
By considering the situation in which the involved pseudomonads are presented in no-iteration form, we deduce a number of alternative presentations of pseudodistributive laws including a 'decagon' form, a pseudoalgebra form, a no-iteration…
In network theory, a triad census is a method designed to categorize and enumerate the various types of subgraphs with three nodes and their connecting edges within a network. Triads serve as fundamental building blocks for comprehending…
In this paper we derive from arguments of string scattering a set of eight tetrahedron equations, with different index orderings. It is argued that this system of equations is the proper system that represents integrable structures in three…