Related papers: Random chain complexes of real vector spaces

We consider an ensemble of large non-Hermitian random matrices of the form $\hat{H}+i\hat{A}_s$, where $\hat{H}$ and $\hat{A}_s$ are Hermitian statistically independent random $N\times N$ matrices. We demonstrate the existence of a new…

We investigate the behavior of vertex-weighted exponential random graphs. We show that vertex-weighted exponential random graphs with edge weights induced by products of independent vertex weights are approximate mixtures of graphs whose…

Frames for Hilbert spaces are interesting for mathematicians but also important for applications e.g. in signal analysis and in physics. Both in mathematics and physics it is natural to consider a full scale of spaces, and not only a single…

This paper studies random cubical sets in $\mathbb{R}^d$. Given a cubical set $X\subset \mathbb{R}^d$, a random variable $\omega_Q\in[0,1]$ is assigned for each elementary cube $Q$ in $X$, and a random cubical set $X(t)$ is defined by the…

We construct Abelian model structures on the category of chain complexes over a ring $R$, from the notion homological dimensions of modules. Given an integer $n > 0$, we prove that the left modules over a ringoid $\mathfrak{R}$ with…

We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…

The aim of the present exposition is to investigate varieties of almost minimal degree and of low codimension, in particular their Betti diagrams. Here minimal degree is defined as $\deg X = \codim X + 2.$ We describe the structure of the…

Two theorems witnessing the abundance of geometrically trivial strongly minimal autonomous differential equations of arbitrary order are shown. The first one states that a generic algebraic vector field of degree $d\geq 2$ on the affine…

We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we define an optimal basis of a homology group to be the basis…

We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…

In this paper, we solve a classical counting problem for non-degenerate forms of symplectic and hermitian type defined on a vector space: given a subspace $\pi$, we find the number of non-singular subspaces that are trivially intersecting…

In this paper, we give a simple proof of a triviality criterion due to I.Biswas and J.Pedro and P.Dos Santos. We also prove a vector bundle on a homogenous space is trivial if and only if the restrictions of the vector bundle to Schubert…

Clustering aims to form groups of similar data points in an unsupervised regime. Yet, clustering complex datasets containing critically intertwined shapes poses significant challenges. The prevailing clustering algorithms widely depend on…

In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…

There exists a compact manifold so that the set of topologically chaotic but statistically trivial $C^{r} (1\leq r \leq \infty)$ vector fields on this manifold displays considerable scale in the view of dimension. More specifically, it…

Given two vectors in Euclidean space, how unlikely is it that a random vector has a larger inner product with the shorter vector than with the longer one? When the random vector has independent, identically distributed components, we…

Consider the triangle $T$ with vertices $(0,0)$, $(0,1)$, and $(1,0)$. The lower boundary of the convex hull of $(0,1)$, $(1,0)$, together with $n$ independent uniformly distributed random points in $T$, is called a random convex chain and…

Maximal clique enumeration appears in various real-world networks, such as social networks and protein-protein interaction networks for different applications. For general graph inputs, the number of maximal cliques can be up to…

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

We define a model for random (abstract) cell complexes (CCs), similiar to the well-known Erd\H{o}s-R\'enyi model for graphs and its extensions for simplicial complexes. To build a random cell complex, we first draw from an Erd\H{o}s-R\'enyi…