Related papers: Semigraphoids Are Two-Antecedental Approximations …
The goal of this paper is to integrate the notions of stochastic conditional independence and variation conditional independence under a more general notion of extended conditional independence. We show that under appropriate assumptions…
A stochastic model of short-term verbal memory is proposed, in which the psychological state of the subject is encoded as the instantaneous position of a particle diffusing over a semantic graph with a probabilistic structure. The model is…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…
We describe a new, generally applicable strategy for the systematic construction of basis invariants (BIs). Our method allows one to count the number of mutually independent BIs and gives controlled access to the interrelations (syzygies)…
Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
This work develops problem statements related to encoders and autoencoders with the goal of elucidating variational formulations and establishing clear connections to information-theoretic concepts. Specifically, four problems with varying…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
Given a semigroup $S$, a diagonal subsemigroup $\rho$ is defined to be a reflexive and compatible relation on $S$, i.e. a subsemigroup of the direct square $S\times S$ containing the diagonal $\{ (s,s)\colon s\in S\}$. When $S$ is finite,…
Bayesian networks are a widely-used class of probabilistic graphical models capable of representing symmetric conditional independence between variables of interest using the topology of the underlying graph. For categorical variables, they…
The use of compositions simplifies some aspects of the theory of numerical semigroups. We illustrate this by giving a new proof for the asymptotic number C((1 + $\sqrt$ 5)/2) g of numerical semigroups of genus g and by describing the…
For any class $\mathcal{C}$ of bipartite graphs, we define quasi-$\cal C$ to be the class of all graphs $G$ such that every bipartition of $G$ belongs to $\cal C$. This definition is motivated by a generalisation of the switch Markov chain…
Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…
The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…
We propose a new variant of the semiclassical quantisation with two independent parameters. The first one is proportional to the Planck constant as usually and the second one is connected with a deviation of the given potential from a very…
We introduce the concept of a restriction semigroupoid S, which unifies the notion of restriction semigroups and restriction categories within a single structure. We prove a representation theorem, showing that every restriction…
Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…
Probabilistic dependency graphs (PDGs) are a flexible class of probabilistic graphical models, subsuming Bayesian Networks and Factor Graphs. They can also capture inconsistent beliefs, and provide a way of measuring the degree of this…