Related papers: A sharper threshold for random groups at density o…

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…

Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient. Other properties like a giant component, the small world…

Let K >= 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A^2 is covered by K left translates of A. The main result of this paper is a qualitative…

We lay the foundations for the study of relatively quasiconvex subgroups of relatively hyperbolic groups. These foundations require that we first work out a coherent theory of countable relatively hyperbolic groups (not necessarily finitely…

In recent years, the mathematical limits and algorithmic bounds for probabilistic group testing have become increasingly well-understood, with exact asymptotic thresholds now being known in general scaling regimes for the noiseless setting.…

In this paper we investigate Gromov's question: whether every one-ended word hyperbolic group contains a surface subgroup. The case of double groups is considered by studying the associated one relator groups. We show that the majority…

We show that one relator groups viewed as metric spaces with respect to the word-length metric have finite asymptotic dimension in the sense of Gromov and give an estimate of their asymptotic dimension in terms of the relator length.

We prove that if a group possesses a deficiency 1 presentation where one of the relators is a commutator then it is the integers times the integers, is large, or is as far as possible from being residually finite. Then we use this to show…

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…

Finding a non-sofic hyperbolic group will resolve two major problems in geometric group theory: Are there non sofic groups? Are there non residually finite hyperbolic groups? In this paper, we propose a new probabilistic approach to this…

The continuum random cluster model is defined as a Gibbs modification of the stationary Boolean model in $\mathbb{R}^d$ with intensity $z>0$ and the law of radii $Q$. The formal unormalized density is given by $q^{N_{cc}}$ where $q>0$ is a…

We study percolation on nonamenable groups at the uniqueness threshold $p_u$, the critical value that separates the phase in which there are infinitely many infinite clusters from the phase in which there is a unique infinite cluster. The…

The residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship…

Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of $\lambda$-{\sf ADD}-codes, studying such codes with certain distance $d$ and codelength $n$. When $d$ is constant, we provide…

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…

A comment on the Letter by A. Rebenshtok, S. Denisov, P. H\"anggi, and E. Barkai, Phys. Rev. Lett., vol. 112, 110601 (2014). It is shown that the recent claims that the particle distributions or densities can become non-normalizable in the…

Assume that all the Sylow subgroups of a finite group $G$ can be generated by $d$ elements. Then the expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found, is at most…

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 consider an even probability distribution on the $d$-dimensional Euclidean space with the property that it assigns measure zero to any hyperplane through the origin. Given $N$ independent random vectors with this distribution, under the…