Related papers: Fundamental groups of random clique complexes

We initiate the study of holomorphically convex groups: groups that can be realized as fundamental groups of smooth complex projective varieties with holomorphically convex universal covers. If $G$ is a holomorphically convex group of…

We prove a division algorithm for group rings of high genus surface groups and use it to show that some $2$-complexes with surface fundamental groups are standard. We also give an application of division to cohomological dimension of…

We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…

In the theory of dense graph limits, a graphon is a symmetric measurable function $W:[0,1]^2\to [0,1]$. Each graphon gives rise naturally to a random graph distribution, denoted $\mathbb{G}(n,W)$, that can be viewed as a generalization of…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Tur\'an-type result is an extension of the celebrated Erd\H{o}s and Gallai theorem and a strengthening of…

We show that if a sequence $M_n$ of closed aspherical $d$-dimensional Riemannian manifolds with Ricci curvature uniformly bounded below and diameter uniformly bounded above collapses, then for all large enough $n$, the fundamental groups…

We study the problem of counting the number of {\em isomorphic} copies of a given {\em template} graph, say $H$, in the input {\em base} graph, say $G$. In general, it is believed that polynomial time algorithms that solve this problem…

We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…

We investigate random partitions of complete graphs defined by Poissonian emsembles of Markov loops

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called…

We give a geometric characterisation of those groups that arise as fixed subgroups of finite-order untwisted automorphisms of right-angled Artin groups (RAAGs). They are precisely the fundamental groups of a class of compact special cube…

We show that for each $r\ge 4$, in a density range extending up to, and slightly beyond, the threshold for a $K_r$-factor, the copies of $K_r$ in the random graph $G(n,p)$ are randomly distributed, in the (one-sided) sense that the…

We classify closed, topological spin$^+$ 4-manifolds with fundamental group $\pi$ of cohomological dimension $\leq 3$ (up to s-cobordism), after stabilization by connected sum with at most $b_3(\pi)$ copies of $S^2\times S^2$. In general we…

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…

Let PSigma_n denote the group that can be thought of either as the group of motions of the trivial n-component link or the group of symmetric automorphisms of a free group of rank n. The integral cohomology ring of PSigma_n is determined,…

There have been several recent articles studying homology of various types of random simplicial complexes. Several theorems have concerned thresholds for vanishing of homology, and in some cases expectations of the Betti numbers. However…

We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…

The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…