English
Related papers

Related papers: The fundamental group of random 2-complexes

200 papers

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…

Commutative Algebra · Mathematics 2017-10-25 Jesus De Loera , Christopher O'Neill , Dane Wilburne

We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…

Combinatorics · Mathematics 2019-07-16 Christopher Hoffman , Matthew Kahle , Elliot Paquette

We study the Prime Graph Question for integral group rings. This question can be reduced to almost simple groups by a result of Kimmerle and Konovalov. We prove that the Prime Graph Question has an affirmative answer for all almost simple…

Representation Theory · Mathematics 2022-11-23 Andreas Bächle , Leo Margolis

Using the random complexes of Linial and Meshulam, we exhibit a large family of simplicial complexes for which, whenever affinely embedded into Euclidean space, the filling areas of simplicial cycles is greatly distorted. This phenomenon…

Metric Geometry · Mathematics 2014-10-29 Dominic Dotterrer

We prove that the topological connectivity of a graph homomorphism complex Hom($G,K_m$) is at least $m-D(G)-2$, where $\displaystyle D(G)=\max_{H\subseteq G}\delta(H)$. This is a strong generalization of a theorem of Cuki\'{c} and Kozlov,…

Combinatorics · Mathematics 2016-02-16 Greg Malen

Suppose $G$ is a 1-ended finitely presented group that is hyperbolic relative to $\mathcal P$ a finite collection of 1-ended finitely presented proper subgroups of $G$. Our main theorem states that if the boundary $\partial (G,{\mathcal…

Group Theory · Mathematics 2020-04-21 Michael Mihalik , Eric Swenson

We generalise a theorem of Gersten on surjectivity of the restriction map in $\ell^{\infty}$-cohomology of groups. This leads to applications on subgroups of hyperbolic groups, quasi-isometric distinction of finitely generated groups and…

Group Theory · Mathematics 2024-04-05 Nansen Petrosyan , Vladimir Vankov

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…

Group Theory · Mathematics 2024-12-18 Tsung-Hsuan Tsai

We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…

Information Theory · Computer Science 2022-06-24 Mihai-Alin Badiu , Justin P. Coon

We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a…

Combinatorics · Mathematics 2024-01-24 Ran Tessler , Elad Tzalik

Network geometry is currently a topic of growing scientific interest as it opens the possibility to explore and interpret the interplay between structure and dynamics of complex networks using geometrical arguments. However the field is…

Disordered Systems and Neural Networks · Physics 2019-08-21 Ivan Kryven , Robert M. Ziff , Ginestra Bianconi

We investigate conformal dimension for the class of infinite hyperbolic groups in the Gromov density model $\mathcal{G}^d_{m,l}$ of random groups with $m \geq 2$ fixed generators, density $0 < d < 1/2$ and relator length $l \to \infty$. Our…

Group Theory · Mathematics 2022-04-12 Jordan Frost

We give a cohomological characterization of Gromov relative hyperbolicity. As an application we prove a converse to the combination theorem for graphs of relatively hyperbolic groups given in a previous paper of the first author. We build…

Group Theory · Mathematics 2007-10-25 F. Gautero , M. Heusener

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…

Group Theory · Mathematics 2017-11-22 C. J. Ashcroft , Colva M. Roney-Dougal

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

Probability · Mathematics 2014-05-13 Mathew D. Penrose

We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with…

Combinatorics · Mathematics 2023-09-26 José D. Alvarado , Yoshiharu Kohayakawa , Richard Lang , Guilherme O. Mota , Henrique Stagni

We initiate the investigation of critical exponents (in degree equal to the rank) for the vanishing of L^p-cohomology of higher rank Lie groups and related manifolds. We deal with the rank 2 case and exhibit such phenomena for SL$_3$(R) and…

Group Theory · Mathematics 2026-01-07 Marc Bourdon , Bertrand Rémy

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

Mathematical Physics · Physics 2015-06-12 Rogério G. Alves , Aldo Procacci , Remy Sanchis

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…

We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…

Combinatorics · Mathematics 2017-08-04 Mohammed Amin Abdullah , Michel Bode , Nikolaos Fountoulakis