English
Related papers

Related papers: One-sided sharp thresholds for homology of random …

200 papers

We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…

Geometric Topology · Mathematics 2025-12-01 Sophie Wright

Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$…

Combinatorics · Mathematics 2023-05-22 Tolson Bell

This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…

Combinatorics · Mathematics 2025-10-30 Xiongfeng Zhan , Xueyi Huang , Jin-Xin Zhou

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…

Group Theory · Mathematics 2011-05-11 Eric Babson , Christopher Hoffman , Matthew Kahle

We prove that the family of facets of a pure simplicial complex of dimension up to three satisfies the Erd\H{o}s-Ko-Rado property whenever it is flag and has no boundary ridges. We conjecture the same to be true in arbitrary dimension and…

Combinatorics · Mathematics 2020-08-25 Jorge Olarte , Francisco Santos , Jonathan Spreer , Christian Stump

We prove that the property of containing a $k$-regular subgraph in the random graph model $G(n,p)$ has a sharp threshold for $k\ge3$. We also show how to use similar methods to obtain an easy prove for the (known fact of) sharpness of…

Probability · Mathematics 2013-10-22 Shoham Letzter

We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…

Group Theory · Mathematics 2021-12-13 Michal Buran

Let $Y(n, p)$ denote the probability space of random 2-dimensional simplicial complexes in the Linial--Meshulam model, and let $Y \sim Y(n, p)$ denote a random complex chosen according to this distribution. In a paper of Cohen, Costa,…

Algebraic Topology · Mathematics 2017-10-12 Andrew Newman

Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…

Physics and Society · Physics 2015-02-03 Jun Zhao , Osman Yağan , Virgil Gligor

Let \Gamma(n,p) denote the binomial model of a random triangular group. We show that there exist constants c, C > 0 such that if p <= c/n^2, then a.a.s. \Gamma(n,p) is free and if p >= C log n/n^2 then a.a.s. \Gamma(n,p) has Kazhdan's…

Group Theory · Mathematics 2019-02-20 Sylwia Antoniuk , Tomasz Łuczak , Jacek Świcatkowski

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…

Group Theory · Mathematics 2013-08-06 Marcin Kotowski , Michal Kotowski

We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…

Commutative Algebra · Mathematics 2023-08-16 Anton Dochtermann , Andrew Newman

We study the discrete Gaussian free field (harmonic crystal) on $\mathbb{Z}^d$, $d\geq 3$, with uniformly elliptic and bounded random conductances sampled according to a sufficiently mixing environment measure. We consider the hard wall…

Probability · Mathematics 2025-10-29 Alberto Chiarini , Emanuele Pasqui

We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…

Group Theory · Mathematics 2013-07-09 Danny Calegari , Alden Walker

A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary…

Probability · Mathematics 2026-05-05 Aleksandr Mysliuk

We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…

Combinatorics · Mathematics 2022-09-14 Alan Lew , Eran Nevo , Yuval Peled , Orit E. Raz

In this paper, generalising the idea of the Rokhlin property, we explore the concept of the twisted Rokhlin property of topological groups. A topological group is said to exhibit the twisted Rokhlin property if, for each automorphism $\phi$…

Geometric Topology · Mathematics 2026-02-04 Pravin Kumar , Apeksha Sanghi , Mahender Singh

Free groups are known to be homogeneous, meaning that finite tuples of elements which satisfy the same first-order properties are in the same orbit under the action of the automorphism group. We show that virtually free groups have a…

Group Theory · Mathematics 2018-10-29 Simon André

We prove twisted homological stability with polynomial coefficients for automorphism groups of free nilpotent groups of any given class. These groups interpolate between two extremes for which homological stability was known before, the…

Group Theory · Mathematics 2014-10-15 Markus Szymik

Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…

Combinatorics · Mathematics 2020-12-23 Tony Johansson