English
Related papers

Related papers: Integral homology of random simplicial complexes

200 papers

By studying the commuting graphs of conjugacy classes of the sequence of Heisenberg groups $H_{2n+1}(p)$ and their limit $H_\infty(p)$ we find pseudo-random behavior (and the random graph in the limiting case). This makes a nice case study…

Group Theory · Mathematics 2021-08-16 Persi Diaconis , Maryanthe Malliaris

Algorithms for persistent homology and zigzag persistent homology are well-studied for persistence modules where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under…

Computational Geometry · Computer Science 2014-03-26 Tamal K. Dey , Fengtao Fan , Yusu Wang

We show a homological result for the class of planar or symmetric operad groups: We show that under certain conditions, group (co)homology of such groups with certain coefficients vanishes in all dimensions, provided it vanishes in…

Algebraic Topology · Mathematics 2016-09-21 Werner Thumann

We prove that the random flag complex has a probability regime where the probability of nonvanishing homology is asymptotically bounded away from zero and away from one. Related to this main result we also establish new bounds on a sharp…

Algebraic Topology · Mathematics 2024-02-28 Andrew Newman

We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…

Geometric Topology · Mathematics 2010-06-10 Felix Effenberger , Wolfgang Kühnel

Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…

Algebraic Topology · Mathematics 2022-07-14 Shiquan Ren , Chengyuan Wu , Jie Wu

We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this…

Representation Theory · Mathematics 2011-08-31 Jacob T. Harper

A non-trivial separable metric space $X$ is called an almost homology $n$-manifold if the homology groups $H_k(X,X\backslash\{x\},\mathbb Z)$ are trivial for all $x\in X$ and all $k=0,1,..,n-1$. We provide a necessary and sufficient…

General Topology · Mathematics 2025-05-13 Vesko Valov

In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…

Algebraic Topology · Mathematics 2015-03-03 A. Costa , M. Farber

For $n \geq 2$, the $n$-th curvature set of a metric space $X$ is the set consisting of all $n$-by-$n$ distance matrices of $n$ points sampled from $X$. Curvature sets can be regarded as a geometric analogue of configuration spaces. In this…

Algebraic Topology · Mathematics 2023-07-26 Peter Eastwood , Anna M. Ellison , Mario Gómez , Facundo Mémoli

Let $r\ge 3$ be a fixed constant and let $ {\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D > N^\varepsilon $ for some $ \varepsilon>0 $. Consider the random greedy algorithm for forming an…

Combinatorics · Mathematics 2024-09-25 Patrick Bennett , Tom Bohman

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

Combinatorics · Mathematics 2019-07-30 Michael Anastos , Peleg Michaeli , Samantha Petti

A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…

Algebraic Topology · Mathematics 2021-03-09 Jonathan A. Barmak

In this note, we study the emergence of Hamiltonian Berge cycles in random $r$-uniform hypergraphs. For $r\geq 3$, we prove an optimal stopping-time result that if edges are sequently added to an initially empty $r$-graph, then as soon as…

Combinatorics · Mathematics 2021-07-01 Deepak Bal , Ross Berkowitz , Pat Devlin , Mathias Schacht

A method of ``blocking'' triangulations that rests on the self-similarity feature of dynamically triangulated random manifolds is proposed. The method is used to define the renormalization group for random geometries. As an illustration,…

High Energy Physics - Lattice · Physics 2009-10-22 D. Johnston , J-P. Kownacki , A. Krzywicki

Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of…

Algebraic Topology · Mathematics 2023-09-14 Chaim Even-Zohar , Michael Farber , Lewis Mead

The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…

Group Theory · Mathematics 2025-07-21 Melissa Lee , Kamilla Rekvényi

We study locally compact group topologies on semisimple Lie groups. We show that the Lie group topology on such a group $S$ is very rigid: every 'abstract' isomorphism between $S$ and a locally compact and $\sigma$-compact group $\Gamma$ is…

Group Theory · Mathematics 2011-08-09 Linus Kramer

By Rickard's work, two rings are derived equivalent if there is a tilting complex, constructed from projective modules over the first ring such that the second ring is the endomorphism ring of this tilting complex. In this work I describe,…

Rings and Algebras · Mathematics 2007-05-23 Intan Muchtadi-Alamsyah

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

Combinatorics · Mathematics 2016-02-23 Nicolau C. Saldanha , Márcio Telles
‹ Prev 1 8 9 10 Next ›