Related papers: Random Artin groups
Designing plausible network models typically requires scholars to form a priori intuitions on the key drivers of network formation. Oftentimes, these intuitions are supported by the statistical estimation of a selection of network evolution…
We consider group orders and right-orders which are discrete, meaning there is a least element which is greater than the identity. We note that free groups cannot be given discrete orders, although they do have right-orders which are…
Testing whether a variable of interest affects the outcome is one of the most fundamental problem in statistics and is often the main scientific question of interest. To tackle this problem, the conditional randomization test (CRT) is…
We characterize twisted right-angled Artin groups whose finitely generated subgroups are also twisted right-angled Artin groups. Additionally, we give a classification of coherence within this class of groups in terms of the defining graph.…
We study the outer automorphism group of a right-angled Artin group $A_\Gamma$ with finite defining graph $\Gamma$. We construct a subnormal series for $Out(A_\Gamma)$ such that each consecutive quotient is either finite, free-abelian,…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
We study $2$-dimensional Artin groups of hyperbolic type from the viewpoint of measure equivalence, and establish rigidity theorems. We first prove that they are boundary amenable. So is every group acting discretely by simplicial…
In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k$ random graphs}, and that are special in that their…
We observe that, for each positive integer n > 2, each of the Artin groups of finite type A_n, B_n=C_n, and affine type \tilde A_{n-1} and \tilde C_{n-1} is a central extension of a finite index subgroup of the mapping class group of the…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of…
Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…
We generalize to (certain) Artin groups some results previously known for right-angled Artin groups (RAAGs). First, we generalize a result by Droms, B. Servatius, and H. Servatius, and prove that the derived subgroup of an Artin group is…
We study homomorphisms between XL-type Artin groups and show that, in a suitable sense, a generic Artin group is both hopfian and co-hopfian. For XL-type Artin groups over complete graphs, we describe all possible homomorphisms with…
Even Artin groups generalize right-angled Artin groups by allowing the labels in the defining graph to be even. In this paper a complete characterization of quasi-projective even Artin groups is given in terms of their defining graphs.…
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…