Related papers: The fundamental group of random 2-complexes
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…
We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…
A remarkable result of Gersten states that the class of hyperbolic groups of cohomological dimension $2$ is closed under taking finitely presented (or more generally $FP_2$) subgroups. We prove the analogous result for relatively hyperbolic…
In the paper we describe complexes whose homologies are naturally isomorphic to the first term of the Vassiliev spectral sequence computing (co)homology of the spaces of long knots in R^d, d>=3. The first term of the Vassiliev spectral…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
Let $S=\Gamma\backslash \mathbb{H}$ be a hyperbolic surface of finite topological type, such that the Fuchsian group $\Gamma \le \operatorname{PSL}_2(\mathbb{R})$ is non-elementary, and consider any generating set $\mathfrak S$ of $\Gamma$.…
Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
A large variety of interacting complex systems are characterized by interactions occurring between more than two nodes. These systems are described by simplicial complexes. Simplicial complexes are formed by simplices (nodes, links,…
Real-world networks exhibit universal structural properties such as sparsity, small-worldness, heterogeneous degree distributions, high clustering, and community structures. Geometric network models, particularly Random Hyperbolic Graphs…
For n>3 we study spaces obtained from finite volume complete real hyperbolic n-manifolds by removing a compact totally geodesic submanifold of codimension two. We prove that their fundamental groups are relative hyperbolic, co-Hopf,…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
This paper discusses the enumeration of two-terminal series-parallel networks, i.e. the number of electrical networks built with n identical elements connected in series or parallel with two-terminal nodes. They frequently occur in applied…
We study hyperbolic cohomology classes in the general context of simplicial complexes and prove homological invariance statements for them. We relate the existence of hyperbolic cohomology classes to the non-amenability of the fundamental…
We provide a simple, combinatorial criteria for a hierarchically hyperbolic space to be relatively hyperbolic by proving a new formulation of relative hyperbolicity in terms of hierarchy structures. In the case of clean hierarchically…
We classify the homotopy types of reduced 2-nilpotent simplicial groups in terms of the homology an d boundary invariants $b,\beta$. This contains as special cases results of J.H.C. Whitehead on 1-connected 4-dimensional complexes and of…
General Relativity in 4 dimensions can be equivalently described as a dynamical theory of SO(3)-connections rather than metrics. We introduce the notion of asymptotically hyperbolic connections, and work out an analog of the…
In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…
We consider random right-angled Coxeter groups, $W_{\Gamma}$, whose presentation graph $\Gamma$ is taken to be an Erd\H{o}s--R\'enyi random graph, i.e., $\Gamma\sim \mathcal{G}_{n,p}$. We use techniques from probabilistic combinatorics to…
In previous work, we have defined---intrinsically, entirely within the digital setting---a fundamental group for digital images. Here, we show that this group is isomorphic to the edge group of the clique complex of the digital image…