Related papers: Random Artin groups
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
Identifying groups of variables that may be large simultaneously amounts to finding out which joint tail dependence coefficients of a multivariate distribution are positive. The asymptotic distribution of a vector of nonparametric,…
In this paper, we establish a new criterion for determining whether an Artin group is subgroup separable (LERF), building upon a criterion introduced in a previous work. Specifically, we prove an Artin group is LERF if and only if it does…
We classify the Artin groups that admit retractions onto all of their parabolic subgroups. Our approach relies on a detailed analysis of triangular subgroups, with a key ingredient being the classification of homomorphisms between dihedral…
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 contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…
Right-angled Artin groups and their subgroups are of great interest because of their geometric, combinatorial and algorithmic properties. It is convenient to define these groups using finite simplicial graphs. The isomorphism type of the…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described my the Moran process. Recently, this approach has been generalized in \cite{LHN} by arranging individuals on the nodes of a…
We study a class models of correlated random networks in which vertices are characterized by \textit{hidden variables} controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological…
In this note we give an upper bound for the virtually cyclic dimension of any normally poly-free group in terms of its length. In particular, this implies that virtually even Artin groups of FC-type admit a finite dimensional model for the…
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
The selection of grouped variables using the random forest algorithm is considered. First a new importance measure adapted for groups of variables is proposed. Theoretical insights into this criterion are given for additive regression…
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…
The objective of this paper is to detect which combinatorial properties of a regular graph can completely determine the geodesic growth of the right-angled Coxeter or Artin group this graph defines, and to provide the first examples of…
We construct and analyze a random graph model for discrete choice with social interaction and several groups of equal size. We concentrate on the case of two groups of equal sizes and we allow the interaction strength within a group to…
Artin's representation is an injective homomorphism from the braid group $B_n$ on $n$ strands into $\operatorname{Aut}\mathbb{F}_n$, the automorphism group of the free group $\mathbb{F}_n$ on $n$ generators. The representation induces maps…
For all Artin groups, we characterise the girth (i.e. the length of a shortest cycle) of the defining graph algebraically, showing that it is an isomorphism invariant. Using this result, we prove that the Artin groups based on a cycle graph…
Exponential family Random Graph Models (ERGMs) can be viewed as expressing a probability distribution on graphs arising from the action of competing social forces that make ties more or less likely, depending on the state of the rest of the…