English
Related papers

Related papers: Topology of random 2-dimensional cubical complexes

200 papers

In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…

Probability · Mathematics 2017-05-05 Janko Gravner , Alexander E. Holroyd

Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…

Disordered Systems and Neural Networks · Physics 2020-07-15 Hanlin Sun , Robert M. Ziff , Ginestra Bianconi

I propose a random network model governed by a Gaussian weight corresponding to Ising link antiferromagnetism as a model for emergent quantum space-time. In this model, discrete space is fundamental, not a regularization, its spectral…

Statistical Mechanics · Physics 2016-11-15 Carlo A. Trugenberger

The 2-dimensional Hamming graph H(2,n) consists of the $n^2$ vertices $(i,j)$, $1\leq i,j\leq n$, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability…

Probability · Mathematics 2009-01-05 Remco van der Hofstad , Malwina J. Luczak , Joel Spencer

We study the combinatorial geometry of a random closed multicurve on a surface of large genus and of a random square-tiled surface of large genus. We prove that primitive components of a random multicurve represent linearly independent…

Geometric Topology · Mathematics 2023-04-06 Vincent Delecroix , Elise Goujard , Peter Zograf , Anton Zorich

The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…

Combinatorics · Mathematics 2011-11-07 Svante Janson , Oliver Riordan

We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…

Combinatorics · Mathematics 2017-09-07 Colin McDiarmid , Nikola Yolov

We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…

Combinatorics · Mathematics 2024-11-26 Ji Zeng

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

Let $\pi$ be a group satisfying the Farrell-Jones conjecture and assume that $B\pi$ is a 4-dimensional Poincar\'e duality space. We consider topological, closed, connected manifolds with fundamental group $\pi$ whose canonical map to $B\pi$…

Geometric Topology · Mathematics 2023-04-13 Daniel Kasprowski , Markus Land

We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…

Probability · Mathematics 2015-09-10 D. Yogeshwaran , Eliran Subag , Robert J. Adler

We study higher-dimensional homological analogues of bond percolation on a square lattice and site percolation on a triangular lattice. By taking a quotient of certain infinite cell complexes by growing sublattices, we obtain finite cell…

Probability · Mathematics 2023-10-02 Paul Duncan , Matthew Kahle , Benjamin Schweinhart

A two-dimensional simplicial complex is called $d$-{\em regular} if every edge of it is contained in exactly $d$ distinct triangles. It is called $\epsilon$-expanding if its up-down two-dimensional random walk has a normalized maximal…

Combinatorics · Mathematics 2020-04-27 Eyal Karni , Tali Kaufman

In this paper, we study relations between positivity of the curvature and the asymptotic behavior of the higher cohomology group for tensor powers of a holomorphic line bundle. The Andreotti-Grauert vanishing theorem asserts that partial…

Complex Variables · Mathematics 2013-01-17 Shin-ichi Matsumura

We show that the universal abelian cover of the complement to a germ of a reducible divisor on a complex space $Y$ with isolated singularity is $(dimY-2)$-connected provided that the divisor has normal crossings outside of the singularity…

Algebraic Geometry · Mathematics 2007-05-23 Alexandru Dimca , Anatoly Libgober

In previous work, we have defined---intrinsically, entirely within the digital setting---a fundamental group for digital images. Here, we show that this group is isomorphic to the edge group of the clique complex of the digital image…

Algebraic Topology · Mathematics 2019-10-21 Gregory Lupton , Nicholas A. Scoville

This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs. We focus on the Gaussian model where the two graphs are complete graphs with correlated Gaussian weights and the…

Statistics Theory · Mathematics 2022-02-17 Yihong Wu , Jiaming Xu , Sophie H. Yu

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

Given an $n$-dimensional compact complex Hermitian manifold $X$, a $C^\infty$ complex line bundle $L$ equipped with a connection $D$ whose $(0,\,1)$-component $D''$ squares to zero and a real-valued function $\eta$ on $X$, we prove that the…

Differential Geometry · Mathematics 2024-06-11 Dan Popovici

Garland introduced a vanishing criterion for a characteristic zero cohomology group of a locally finite and locally connected simplicial complex. The criterion is based on the spectral gaps of the graph Laplacians of the links of faces and…

Combinatorics · Mathematics 2026-05-05 Eric Babson , Volkmar Welker