Related papers: Large Random Simplicial Complexes, II; the fundame…

Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the modeling strength of differently generated random graph model…

We determine which simplicial complexes have the maximum or minimum sum of Betti numbers and sum of bigraded Betti numbers with a given number of vertices in each dimension.

We investigate asymptotic symmetries in flat backgrounds of dimension higher than or equal to four. For spin two we provide the counterpart of the extended BMS transformations found by Campiglia and Laddha in four-dimensional Minkowski…

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

It was shown in Part I that there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski-dense. Here we show…

We construct a random model for an $n$-fold branched cover of a finite acceptable $2$-complex $X$. This includes presentation $2$-complexes for finitely presented groups satisfying some mild conditions. For any $\lambda >0$, we show that as…

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

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…

Let $G$ be a group and $g$ a non-trivial element in $G$. If some non-empty finite product of conjugates of $g$ equals to the trivial element, then $g$ is called a generalized torsion element. To the best of our knowledge, we have no…

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…

Bounded-cohomological dimension of groups is a relative of classical cohomological dimension, defined in terms of bounded cohomology with trivial coefficients instead of ordinary group cohomology. We will discuss constructions that lead to…

Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first $\ell^2$-Betti number of the group. Our main aim, however, is…

In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost…

We study compact three-manifolds with boundary obtained by randomly gluing together truncated tetrahedra along their faces. We prove that, asymptotically almost surely as the number of tetrahedra tends to infinity, these manifolds are…

This article discusses random hypergraphs with varying hyperedge sizes, admitting large hyperedges with size tending to infinity, and heavy-tailed limiting hyperedge size distributions. The main result describes a threshold for the random…

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…

We focus on the geometrical reformulation of free higher spin supermultiplets in $4\rm{D},~\mathcal{N}=1$ flat superspace. We find that there is a de Wit-Freedman like hierarchy of superconnections with simple gauge transformations. The…

Simplicial complexes constitute the underlying topology of interacting complex systems including among the others brain and social interaction networks. They are generalized network structures that allow to go beyond the framework of…

In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The…