English
Related papers

Related papers: Topology of random 2-dimensional cubical complexes

200 papers

We introduce and study the vanishing homology of singular projective hypersurfaces. We prove its concentration in two levels in case of 1-dimensional singular locus $\Sigma$, and moreover determine the ranks of the nontrivial homology…

Algebraic Geometry · Mathematics 2017-09-11 Dirk Siersma , Mihai Tibar

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

Differential Geometry · Mathematics 2024-03-25 Florent Balacheff , Wolfgang Pitsch

We consider the random right-angled Coxeter group $W_{\Gamma}$ whose presentation graph $\Gamma\sim \mathcal{G}_{n,p}$ is an Erd{\H o}s--R\'enyi random graph on $n$ vertices with edge probability $p=p(n)$. We establish that $p=1/\sqrt{n}$…

Group Theory · Mathematics 2025-09-25 Jason Behrstock , Recep Altar Ciceksiz , Victor Falgas-Ravry

Let $n\geq 2$ and $r\in \{1, \cdots, n-1\}$ be integers, $M$ be a compact smooth K\''ahler manifold of complex dimension $n$, $E$ be a holomorphic vector bundle with complex rank $r$ and equipped with an hermitian metric $h_E$, and $L$ be…

Algebraic Geometry · Mathematics 2022-02-23 Damien Gayet

We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…

Probability · Mathematics 2026-02-12 Ayat Ababneh , Matthew Kahle

Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…

We study Hamiltonicity in random subgraphs of the hypercube $\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\mathcal{Q}^n$ according to a uniformly chosen…

Combinatorics · Mathematics 2022-08-16 Padraig Condon , Alberto Espuny Díaz , António Girão , Daniela Kühn , Deryk Osthus

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

Statistical Mechanics · Physics 2010-04-27 Allon G. Percus , Gabriel Istrate , Bruno Goncalves , Robert Z. Sumi , Stefan Boettcher

A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…

Combinatorics · Mathematics 2022-08-12 Victor Falgas-Ravry , Vincent Pfenninger

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

Geometric Topology · Mathematics 2018-10-03 Greg Kuperberg , Eric Samperton

Given a Poisson process on a $d$-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are given by the \u{C}ech complex associated to the coverage of…

Probability · Mathematics 2013-07-05 Laurent Decreusefond , Eduardo Ferraz , Hugues Randriam , Anaïs Vergne

There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…

Probability · Mathematics 2015-10-28 D. Yogeshwaran , Robert J. Adler

As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied…

Probability · Mathematics 2025-06-16 Dominik Pabst

For connectivity of \emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \emph{Cantor} distributed points on $[0,1]$. We show that for this random geometric graph, the…

Probability · Mathematics 2012-08-09 Antar Bandyopadhyay , Farkhondeh Sajadi

We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…

Probability · Mathematics 2024-07-02 Felix Hermann , Peter Pfaffelhuber

We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…

Computational Geometry · Computer Science 2016-04-11 Salman Parsa

Given a random 3-uniform hypergraph $H=H(n,p)$ on $n$ vertices where each triple independently appears with probability $p$, consider the following graph process. We start with the star $G_0$ on the same vertex set, containing all the edges…

Combinatorics · Mathematics 2015-11-02 Dániel Korándi , Yuval Peled , Benny Sudakov

We consider a conjectured topological inequality for the number of equisingular moduli of a rational surface singularity, and prove it in some natural special cases. When the resolution dual graph is "sufficiently negative" (in a precise…

Algebraic Geometry · Mathematics 2016-03-28 Jonathan Wahl

We provide new vanishing and glueing results for relative simplicial volume, following up on two current themes in bounded cohomology: The passage from amenable groups to boundedly acyclic groups and the use of equivariant topology. More…

Algebraic Topology · Mathematics 2022-02-14 Kevin Li , Clara Loeh , Marco Moraschini

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
‹ Prev 1 3 4 5 6 7 10 Next ›