Related papers: The Right Angled Artin Group Functor as a Categori…
We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.
We consider homological finiteness properties $FP_n$ of certain $\mathbb{N}$-graded Lie algebras. After proving some general results, see Theorem A, Corollary B and Corollary C, we concentrate on a family that can be considered as the Lie…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Let $k$ be an algebraically closed field and $\alpha$, $\beta$, $\gamma$ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent $k$-linear operators of Jordan types $\alpha$, $\beta$, and…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
For a prime number $\ell$ we introduce and study oriented right-angled Artin pro-$\ell$ groups $G_{\Gamma,\lambda}$(oriented pro-$\ell$ RAAGs for short) associated to a finite oriented graph $\Gamma$ and a continuous group homomorphism…
Structural features are important features in a geometrical graph. Although there are some correlation analysis of features based on covariance, there is no relevant research on structural feature correlation analysis with graph neural…
Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the…
Using notions of homogeneity we give new proofs of M. Artin's algebraicity criteria for functors and groupoids. Our methods give a more general result, unifying Artin's two theorems and clarifying their differences.
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We define Gaussian graphical models on directed acyclic graphs with coloured vertices and edges, calling them RDAG (restricted directed acyclic graph) models. If two vertices or edges have the same colour, their parameters in the model must…
Let $\Gamma=(V,E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph. A graph $\Gamma$ is determined by its spectrum if every graph cospectral to it…
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
In this work we perform a detailed statistical analysis of topological and spectral properties of random geometric graphs (RGGs); a graph model used to study the structure and dynamics of complex systems embedded in a two dimensional space.…
In this paper we will study the structure of algebras A(Gamma) associated to two directed, layered graphs Gamma. These are algebras associated with Hasse graphs of n-gons and the algebras Q_n related to pseudoroots of noncommutative…
The study of the homology of diagram algebras has emerged as an interesting and important field. In many cases, the homology of a diagram algebra can be identified with the homology of a group. In this paper we have two main aims. Firstly,…