Related papers: Random groups arising as graph products
We study the algebraic structure of the automorphism group of a general right-angled Artin group. We show that this group is virtually torsion-free and has finite virtual cohomological dimension. This generalizes results proved by the…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
We give a geometric characterisation of those groups that arise as fixed subgroups of finite-order untwisted automorphisms of right-angled Artin groups (RAAGs). They are precisely the fundamental groups of a class of compact special cube…
We show that word hyperbolicity of automorphism groups of graph products $G_\Gamma$ and of Coxeter groups $W_\Gamma$ depends strongly on the shape of the defining graph $\Gamma$. We also characterized those $Aut(G_\Gamma)$ and…
Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian, we introduce two families of discrete matrix models constructed both with the help of the Erdos-Renyi ensemble of random graphs. Corresponding matrix sums…
In this paper we give an algorithm for computing the conjugacy growth series for a right-angled Artin group, based on a natural language of minimal length conjugacy representatives. In addition, we provide a further language of unique…
We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…
Relatively little is known about the discrete horospheres in hyperbolic groups, even in simple settings. In this paper we work with hyperbolic one-ended right-angled Coxeter groups and describe two graph structures that mimic the intrinsic…
Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models. Here, we…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…
We introduce a quantitative characterization of subgroup alternatives modeled on the Tits alternative in terms of group laws and investigate when this property is preserved under extensions. We develop a framework that lets us expand the…
We present a new angle on the expressive power of graph neural networks (GNNs) by studying how the predictions of real-valued GNN classifiers, such as those classifying graphs probabilistically, evolve as we apply them on larger graphs…
An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…
We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
We study the outer automorphism group of a right-angled Artin group A_G in the case where the defining graph G is connected and triangle-free. We give an algebraic description of Out(A_G) in terms of maximal join subgraphs in G and prove…