Related papers: Density of random subsets and applications to grou…
In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…
Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…
Consider a uniformly distributed random linear subspace $L$ and a stochastically independent random affine subspace $E$ in $\mathbb{R}^n$, both of fixed dimension. For a natural class of distributions for $E$ we show that the intersection…
Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal…
Magnus' Freiheitssatz states that if a group is defined by a presentation with $m$ generators and a single relator containing the last generating letter, then the first $m-1$ letters freely generate a free subgroup. We study an analogue of…
For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…
Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…
Gromov showed that (1993) with high probability, every bounded and reduced van Kampen diagram $D$ of a random group at density $d$ satisfies the isoperimetric inequality $|\partial D|\geq (1-2d-s)|D|\ell$. In this article, we adapt…
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…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…
The \emph{intersection density} of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is the rational number $\rho(G)$ given by the ratio between the maximum size of a subset of $G$ in which any two permutations agree on some…
The density of a subgroupoid with respect to a free groupoid is defined as the asymptotic ratio of their growths. This notion can be interpreted as a generalisation of the index's inverse for groups or as the probability of an element…
We characterize the phenomenon of "crowding" near the largest eigenvalue $\lambda_{\max}$ of random $N \times N$ matrices belonging to the Gaussian $\beta$-ensemble of random matrix theory, including in particular the Gaussian orthogonal…
Let $G$ be a finite $D$-quasirandom group and $A \subset G^{k}$ a $\delta$-dense subset. Then the density of the set of side lengths $g$ of corners \[ \{(a_{1},\dots,a_{k}),(ga_{1},a_{2},\dots,a_{k}),\dots,(ga_{1},\dots,ga_{k})\} \subset A…
Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…
We provide a full and rigorous proof of a theorem attributed to \.Zuk, stating that random groups in the Gromov density model for d > 1/3 have property (T) with high probability. The original paper had numerous gaps, in particular, crucial…
Let $G$ be a random group in Gromov's density model $G(m,d,L)$ with $d<\tfrac12$. We prove a sharp quantitative constraint on products of conjugates equal to the identity: for every $n\ge1$ and $\varepsilon>0$, with overwhelming probability…
Improving Importance Sampling estimators for rare event probabilities requires sharp approx- imations of the optimal density leading to a nearly zero-variance estimator. This paper presents a new way to handle the estimation of the…