Related papers: On the permutation capacity of digraphs
Directed information theory deals with communication channels with feedback. When applied to networks, a natural extension based on causal conditioning is needed. We show here that measures built from directed information theory in networks…
In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…
We consider the distributed optimization problem for the sum of convex functions where the underlying communications network connecting agents at each time is drawn at random from a collection of directed graphs. Building on an earlier work…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. This is an old question which relates to recent advances in copula modeling for discrete random…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…
The capacity of a graph is defined as the rate of exponential growth of independent sets in the strong powers of the graph. In the strong power an edge connects two sequences if at each position their letters are equal or adjacent. We…
We study the expansions of permutation statistics in the basis of functions counting occurrences of a fixed pattern in a permutation. We show the finiteness of these pattern expansions for a class of permutation statistics including the…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
Nonlinear dynamics play an important role in the analysis of signals. A popular, readily interpretable nonlinear measure is Permutation Entropy. It has recently been extended for the analysis of graph signals, thus providing a framework for…
A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below…
In this paper, we define a new construction of completely scrambled 0-dimensional systems using the inverse limit of sequences of directed graph covers. These examples are transitive and are not locally equicontinuous.
The signature is an infinite graded sequence of statistics known to characterise a stream of data up to a negligible equivalence class. It is a transform which has previously been treated as a fixed feature transformation, on top of which a…
The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…