Related papers: Completely Positive Tensors and Multi-Hypergraphs
The purpose of this paper is to outline a generalised model for representing hybrids of relational-categorical, symbolic, perceptual-sensory and perceptual-latent data, so as to embody, in the same architectural data layer, representations…
For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-uniform hypergraphs, such as email networks and co-authorship…
Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
For an $m$-order $n-$dimensional Hilbert tensor (hypermatrix) $\mathcal{H}_n=(\mathcal{H}_{i_1i_2\cdots i_m})$, $$\mathcal{H}_{i_1i_2\cdots i_m}=\frac1{i_1+i_2+\cdots+i_m-m+1},\ i_1,\cdots, i_m=1,2,\cdots,n$$ its spectral radius is not…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
Positive definite (p.d.) matrices arise naturally in many areas within mathematics and also feature extensively in scientific applications. In modern high-dimensional applications, a common approach to finding sparse positive definite…
We introduce the concept of pattern graphs--directed acyclic graphs representing how response patterns are associated. A pattern graph represents an identifying restriction that is nonparametrically identified/saturated and is often a…
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of…
We propose a tensor product structure that is compatible with the hypergraph structure. We define the algebraic connectivity of the $(m+1)$-uniform hypergraph in this product, and prove the relationship with the vertex connectivity. We…
We define two new constants associated with real eigenvalues of a P-tensor. With the help of these two constants, in the case of P-tensors, we establish upper bounds of two important quantities, whose positivity is a necessary and…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
Given a set of matrices, it is often of interest to determine the algebra they generate. Here we exploit the concept of the Burnside graph of a set of matrices, and show how it may be used to deduce properties of the algebra they generate.…
In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…
We develop the theory of the higher commutator for Taylor varieties. A new higher commutator operation called the hypercommutator is defined using a type of invariant relation called a higher dimensional congruence. The hypercommutator is…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
Circulant tensors naturally arise from stochastic process and spectral hypergraph theory. The joint moments of stochastic processes are symmetric circulant tensors. The adjacency, Laplacian and signless Laplacian tensors of circulant…