Related papers: Random Artin groups
It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated…
We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
We give criteria for a graph of groups to have finite stature with respect to its collection of vertex groups, in the sense of Huang-Wise. We apply it to the triangle Artin groups that were previously shown to split as a graph of groups.…
We introduce a novel class of graphical models, termed profile graphical models, that represent, within a single graph, how an external factor influences the dependence structure of a multivariate set of variables. This class is quite…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…
Probabilistic graphical models, such as Markov random fields (MRFs), are useful for describing high-dimensional distributions in terms of local dependence structures. The probabilistic inference is a fundamental problem related to graphical…
Twisted right-angled Artin groups are defined through presentation based on mixed graphs. Each vertex corresponds to a generator, each undirected edge yields a commuting relation and each directed edge gives a Klein bottle relation. If…
We give a complete characterisation of when the right-angled Artin group on one cycle graph can be quasiisometrically embedded in the right-angled Artin group on another cycle graph. In particular, we find infinitely many instances of…
Analysis of probability distributions conditional on species trees has demonstrated the existence of anomalous ranked gene trees (ARGTs), ranked gene trees that are more probable than the ranked gene tree that accords with the ranked…
Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate $r$ which invades a population of residents. We say that the fixation…
We prove the Farrell-Jones fibered isomorphism conjecture for several classes of Artin groups of finite and affine types. As a consequence, we compute explicitly the surgery obstruction groups of the finite type pure Artin groups.
We introduce the notion of metrically systolic simplicial complexes. We study geometric and large-scale properties of such complexes and of groups acting on them geometrically. We show that all two-dimensional Artin groups act geometrically…
Graph neural networks (GNNs) are powerful machine learning models for various graph learning tasks. Recently, the limitations of the expressive power of various GNN models have been revealed. For example, GNNs cannot distinguish some…
This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover,…
Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…
We give a brief introduction to the geometric and combinatorial group theory of Artin groups. In particular we introduce the $K(\pi,1)$ conjecture for Artin groups and survey known results as of January 2024. These notes were written as…