Related papers: An Aldous-Hoover type representation for row excha…
The matrix-variate normal distribution is a popular model for high-dimensional transposable data because it decomposes the dependence structure of the random matrix into the Kronecker product of two covariance matrices: one for each of the…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
A random variable Z will be called self-inverse if it has the same distribution as its reciprocal 1/Z. It is shown that if Z is defined as a ratio, X/Y, of two rv's X and Y (with Pr[X=0]=Pr[Y=0]=0), then Z is self-inverse if and only if X…
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical account of Bayesian inference (in the spirit of the…
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…
The analysis of network data has gained considerable interest in recent years. This also includes the analysis of large, high-dimensional networks with hundreds and thousands of nodes. While exponential random graph models serve as…
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO-arrays.…
A notion of conditionally identically distributed (c.i.d.) sequences has been studied as a form of stochastic dependence that is weaker than exchangeability, but is equivalent to exchangeability for stationary sequences. In this article we…
A relation algebra is measurable if the identity element is a sum of atoms, and the square x;1;x of each subidentity atom x is a sum of non-zero functional elements. These functional elements form a group Gx. We prove that a measurable…
We show that the essentially algebraic theory of generalized algebraic theories, regarded as a category with finite limits, has a universal exponentiable arrow in the sense that any exponentiable arrow in any category with finite limits is…
In this article we show that there are branching systems (which induce representations of the graph algebra $C^*(E)$) associated to each row-countable graph $E$. For row-countable graphs, we characterize the condition $(L)$ via branching…
In statistical network analysis, models for binary adjacency matrices satisfying vertex exchangeability are commonly used. However, such models may fail to capture key features of the data-generating process when interactions, rather than…
Given well-shuffled data, can we determine whether the data items are statistically (in)dependent? Formally, we consider the problem of testing whether a set of exchangeable random variables are independent. We will show that this is…
The article is devoted to some ``strange'' phenomena of representation theory and their interrelations. Cross-projective representations of pairs of anticommutative algebras, alloys, their universal envelopping Lie algebras and their…
There has been an increased interest in applying machine learning techniques on relational structured-data based on an observed graph. Often, this graph is not fully representative of the true relationship amongst nodes. In these settings,…
A graph $G=(V,E)$ is representable if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. If $W$ is $k$-uniform (each letter of $W$ occurs exactly $k$…
Bayesian networks are directed acyclic graphs representing independence relationships among a set of random variables. A random variable can be regarded as a set of exhaustive and mutually exclusive propositions. We argue that there are…
A simple graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ iff $xy\in E$. Word-representable graphs generalize several important classes of graphs. A graph…
Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…