Related papers: Network right * abundant semigroups
The relations, rather than the elements, constitute the structure of networks. We therefore develop a systematic approach to the analysis of networks, modelled as graphs or hypergraphs, that is based on structural properties of…
We introduce a new quasi-isometry invariant of 2-dimensional right-angled Coxeter groups, the hypergraph index, that partitions these groups into infinitely many quasi-isometry classes, each containing infinitely many groups. Furthermore,…
The concept of an adequate transversal of an abundant semigroup was introduced by El-Qallali in [8] whilst in [7], he and Fountain initiated the study of quasi-adequate semigroups as natural generalisations of orthodox semigroups. In this…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
In complex networks the rich nodes are the subset of nodes with high degree. These well connected nodes tend to dominate the organisation of the network's structure. In non-evolving networks, a reference network has been used to detect if…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
We study P-groupoids that arise from certain decompositions of complete graphs. We show that left distributive P-groupoids are distributive, quasigroups. We characterize P-groupoids when the corresponding decomposition is a Hamiltonian…
The problem of embedding an ample semigroup in an inverse semigroup as a (2, 1, 1)-type subalgebra is known to be undecidable. In this article, we investigate the problem for certain classes of ample semigroups. We also give examples of…
Permutation equivariant neural networks are typically used to learn from data that lives on a graph. However, for any graph $G$ that has $n$ vertices, using the symmetric group $S_n$ as its group of symmetries does not take into account the…
Given a group $X$ we study the algebraic structure of the compact right-topological semigroup $\lambda(X)$ consisting of maximal linked systems on $X$. This semigroup contains the semigroup $\beta(X)$ of ultrafilters as a closed…
Traditional graph analysis focuses on nodes and edges, that is, pairwise relationships. Yet many real-world networks, including biological, social, and communication networks, involve higher-order relationships in which multiple nodes…
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…
Groups with a topology that is in consistent one way or another with the algebraic structure are considered. Classical groups with a topology are topological, paratopological, semitopological, and quasitopological groups. We also study…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…
We give a complete description of which unital graph C*-algebras are semiprojective, and use it to disprove two conjectures by Blackadar. To do so, we perform a detailed analysis of which projections are properly infinite in such…
We develop the Latent Multi-group Membership Graph (LMMG) model, a model of networks with rich node feature structure. In the LMMG model, each node belongs to multiple groups and each latent group models the occurrence of links as well as…
Given a group $X$ we study the algebraic structure of its superextension $\lambda(X)$. This is a right-topological semigroup consisting of all maximal linked systems on $X$ endowed with the operation $$\mathcal A\circ\mathcal B=\{C\subset…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…