Related papers: Relational exchangeability
Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…
Third-order ordinary differential equations with Lie symmetry algebras isomorphic to the nonsolvable algebra $\mathfrak{sl}(2,\mathbb{R})$ admit solvable structures. These solvable structures can be constructed by using the basis elements…
Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…
A general model for geometric structures on differentiable manifolds is obtained by deforming infinitesimal symmetries. Specifically, this model consists of a Lie algebroid, equipped with an affine connection compatible with the Lie…
An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…
We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques, so is capable of encoding some interesting structure. We prove the…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic…
Some practical results are derived for population inference based on a sample, under the two qualitative conditions of 'ignorability' and exchangeability. These are the 'Histogram Theorem', for predicting the outcome of a non-sampled member…
It is proposed to describe a teleparallel structure as a combination of a Riemannian and a symplectic structure. The correspondent invariance group is an intersection of the orthogonal and the symplectic groups. For a 4D manifold it turns…
Exchangeable arrays are natural tools to model common forms of dependence between units of a sample. Jointly exchangeable arrays are well suited to dyadic data, where observed random variables are indexed by two units from the same…
We provide a survey on relational models. Relational models describe complete networked {domains by taking into account global dependencies in the data}. Relational models can lead to more accurate predictions if compared to non-relational…
In principle, all the natural systems such as biological, ecological and economical systems are structure-variable systems (in which some environment parameters are not fixed). In this Letter we show that data sequences from many…
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…
The integrability condition called shape invariance is shown to have an underlying algebraic structure and the associated Lie algebras are identified. These shape-invariance algebras transform the parameters of the potentials such as…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
A finite form of de Finetti's representation theorem is established using elementary information-theoretic tools: The distribution of the first $k$ random variables in an exchangeable binary vector of length $n\geq k$ is close to a mixture…
A standard assumption in machine learning is the exchangeability of data, which is equivalent to assuming that the examples are generated from the same probability distribution independently. This paper is devoted to testing the assumption…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…