Related papers: Topology of random 2-dimensional cubical complexes

We study the topology of a random cubical complex associated to Bernoulli site percolation on a cubical grid. We begin by establishing a limit law for homotopy types. More precisely, looking within an expanding window, we define a sequence…

We consider random topologies of surfaces generated by cubic interactions. Such surfaces arise in various contexts in 2-dimensional quantum gravity and as world-sheets in string theory. Our results are most conveniently expressed in terms…

Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called…

A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…

We define and investigate a quantisation of null hypersurfaces in the context of loop quantum gravity on a fixed graph. The main tool we use is the parametrisation of the theory in terms of twistors, which has already proved useful in…

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…

For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…

A random geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_1,\ldots,x_n$ independently and uniformly from the $d$-dimensional unit sphere, then connecting each pair $(i,j)$ with probability $K(\langle…

We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…

This article establishes the algebraic covering theory of quandles. For every connected quandle we explicitly construct a universal covering, which in turn leads us to define the algebraic fundamental group as the automorphism group of the…

Amit and Linial showed that a random lift of a graph with minimum degree $\delta\ge3$ is asymptotically almost surely $\delta$-connected, and mentioned the problem of estimating this probability as a function of the degree of the lift. We…

Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…

For $R$ a Euclidean number ring, and let $\Gamma_n(p)$ be the level-$p$ principal congruence subgroup of $\text{SL}_n(R)$. Borel--Serre showed that the cohomology of $\Gamma_n(p)$ vanishes above a degree $\nu$ that is quadratic in $n$. Let…

Let $\Gamma_n(p)$ be the level-$p$ principal congruence subgroup of $\text{SL}_n(\mathbb{Z})$. Borel-Serre proved that the cohomology of $\Gamma_n(p)$ vanishes above degree $\binom{n}{2}$. We study the cohomology in this top degree…

We introduce a novel percolation model that generalizes the classical Random Connection Model (RCM) to a random simplicial complex, allowing for a more refined understanding of connectivity and emergence of large-scale structures in random…

We show vanishing of the second $L^p$-cohomology group for most semisimple algebraic groups of rank at least 3 over local fields. More precisely, we show this result for $\SL(4)$, for simple groups of rank $\geq 4$ that are not of…

In a previous work (arXiv:0806.1503v2), we defined a family of subcomplexes of the $n$-dimensional half cube by removing the interiors of all half cube shaped faces of dimension at least $k$, and we proved that the homology of such a…

In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…

We examine the fundamental question whether a random discrete structure with the minimal number of restrictions can converge to continuous metric space. We study the geometrical properties such as the dimensionality and the curvature…

Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…