Related papers: Statistical hyperbolicity in groups
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…
We find bounds on the Hilbert space compression of the limit of a directed metric system of groups. We also give estimates on the Hilbert space compression of group extensions of a group $H$ by a a word-hyperbolic group or a group of…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
We relate three classes of nonpositively curved metric spaces: hierarchically hyperbolic spaces, coarsely injective spaces, and strongly shortcut spaces. We show that every hierarchically hyperbolic space admits a new metric that is…
The Vahlen group gives a way for presenting the hyperbolic space of every dimension of a group acting via M\"{o}bius transformations. As Vahlen groups and paravector Vahlen groups are now defined over any field of characteristic different…
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social…
In this paper we investigate metric properties of the groups $\Gamma_d(q)$ whose Cayley graphs are the Diestel-Leader graphs $DL_d(q)$ with respect to a given generating set $S_{d,q}$. These groups provide a geometric generalization of the…
We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there…
A group theory justification of one dimensional fractional supersymmetry is proposed using an analogue of a coset space, just like the one introduced in $1D$ supersymmetry. This theory is then gauged to obtain a local fractional…
A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…
Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
A remarkable approach for grasping the relevant statistical features of real networks with the help of random graphs is offered by hyperbolic models, centred around the idea of placing nodes in a low-dimensional hyperbolic space, and…
Over the last decade, random hyperbolic graphs have proved successful in providing geometric explanations for many key properties of real-world networks, including strong clustering, high navigability, and heterogeneous degree…
We present a new notion of non-positively curved groups: the collection of discrete countable groups acting (AU-)acylindrically on finite products of $\delta$-hyperbolic spaces with general type factors. Inspired by the classical theory of…
The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…
Let $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm…
We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, effectively showing how every hyperlinear approximation to such a group is simulated by a suitable sofic approximation. The…
The problem of defining a statistical ensemble of random graphs with an arbitrary connectivity distribution is discussed. Introducing such an ensemble is a step towards uderstanding the geometry of wide classes of graphs independently of…