English
Related papers

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

200 papers

For every $k \ge 1$, the $k$th cohomology group $H^k(X, \Q)$ of the random flag complex $X \sim X(n,p)$ passes through two phase transitions: one where it appears, and one where it vanishes. We describe the vanishing threshold and show that…

Algebraic Topology · Mathematics 2013-10-04 Matthew Kahle

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

Combinatorics · Mathematics 2020-09-21 Matthew Kahle , Elliot Paquette , Érika Roldán

We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…

Algebraic Topology · Mathematics 2015-06-12 Armindo Costa , Michael Farber , Danijela Horak

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…

Probability · Mathematics 2007-05-23 Ashish Goel , Sanatan Rai , Bhaskar Krishnamachari

We use the probabilistic method to construct examples of conjectured phenomenon about asymptotic syzygies. In particular, we use the Stanley-Reisner ideals of random flag complexes to construct new examples of Ein and Lazarsfeld's…

Commutative Algebra · Mathematics 2019-03-19 Daniel Erman , Jay Yang

We consider the random clique complex process - the process of clique complexes induced by the complete graph with i.i.d. Uniform edge weights. We investigate the evolution of the Betti numbers of the clique complex process in the critical…

Probability · Mathematics 2023-03-31 Agniva Roy , D Yogeshwaran

We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there…

Group Theory · Mathematics 2019-06-25 Tomasz Odrzygóźdź

We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…

Combinatorics · Mathematics 2016-04-05 Oliver Cooley , Penny Haxell , Mihyun Kang , Philipp Sprüssel

Let Y ~ Y_d(n,p) denote the Bernoulli random d-dimensional simplicial complex. We answer a question of Linial and Meshulam from 2003, showing that the threshold for vanishing of homology H_{d-1}(Y; Z) is less than 80d log n / n. This bound…

Algebraic Topology · Mathematics 2014-04-11 Christopher Hoffman , Matthew Kahle , Elliot Paquette

For positive integers $n$ and $d$, and the probability function $0\leq p(n)\leq 1$, we let $Y_{n,p,d}$ denote the probability space of all at most $d$-dimensional simplicial complexes on $n$ vertices, which contain the full…

Algebraic Topology · Mathematics 2009-04-13 Dmitry N. Kozlov

Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…

Combinatorics · Mathematics 2023-03-10 Maksim Zhukovskii

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

Combinatorics · Mathematics 2018-05-09 A. V. Burkin , M. E. Zhukovskii

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.

Discrete Mathematics · Computer Science 2008-07-23 J. Diaz , D. Mitsche , X. Perez

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

Combinatorics · Mathematics 2022-10-21 Florian Frick , Andrew Newman

Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…

Combinatorics · Mathematics 2013-02-19 Eric Babson

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

Combinatorics · Mathematics 2026-05-29 Guorui Ma , Zhifei Yan

Several years ago Linial and Meshulam introduced a model called X_d(n,p) of random n-vertex d-dimensional simplicial complexes. The following question suggests itself very naturally: What is the threshold probability p=p(n) at which the…

Combinatorics · Mathematics 2012-03-16 L. Aronshtam , N. Linial

We develop the geometric theory of equivariant quasisymmetry via a new ``quasisymmetric flag variety''. This is a toric complex in the flag variety whose fixed point set is the set of noncrossing partitions, and whose cohomology ring is the…

Algebraic Geometry · Mathematics 2025-08-19 Nantel Bergeron , Lucas Gagnon , Philippe Nadeau , Hunter Spink , Vasu Tewari

Let $M$ be a compact, unit volume, Riemannian manifold with boundary. In this paper we study the homology of a random \v{C}ech-complex generated by a homogeneous Poisson process in $M$. Our main results are two asymptotic threshold…

Probability · Mathematics 2019-06-19 Henry-Louis de Kergorlay , Ulrike Tillmann , Oliver Vipond

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Combinatorics · Mathematics 2013-03-25 Michal Adamaszek
‹ Prev 1 2 3 10 Next ›