Related papers: Random chain complexes of real vector spaces
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows to apply methods of complex network theory for characterizing time series. In this work we present the…
In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…
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.
The Linial-Meshulam complex model is a natural higher-dimensional analog of the Erd\H{o}s-R\'enyi graph model. In recent years, Linial and Peled established a limit theorem for Betti numbers of Linial-Meshulam complexes with an appropriate…
Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…
Let W be the germ of a smooth complex surface around an exceptional curve and let E be a rank 2 vector bundle on W. We study the cohomological properties of a finite sequence $E_i, 1 \leq i \leq t$ of rank 2 vector bundles canonically…
Let $C$ be a chain-like curve over $\mathbb{C}$. In this paper, we investigate the rationality of moduli spaces of $w$-semistable vector bundles on $C$ of arbitrary rank and fixed determinant by putting some restrictions on the Euler…
If a characteristic class for two vector bundles over the same base space does not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in…
Path homology is a topological invariant for directed graphs, which is sensitive to their asymmetry and can discern between digraphs which are indistinguishable to the directed flag complex. In Erd\"os-R\'enyi directed random graphs, the…
In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…
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…
In a paper by Lin an interesting family of semipermutations comes out to index the elements of a cohomology basis of a Hessenberg type variety. The corresponding Betti numbers are a generalization of Eulerian numbers. We show three…
In network science, the non-homogeneity of node degrees has been a concerned issue for study. Yet, with the modern web technologies today, the traditional social communication topologies have evolved from node-central structures to online…
Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…
We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…
The paper discusses progress in understanding statistical properties of complex eigenvalues (and corresponding eigenvectors) of weakly non-unitary and non-Hermitian random matrices. Ensembles of this type emerge in various physical…
The spectral statistics and entanglement within the eigenstates of generic spin chain Hamiltonians are analysed. A class of random matrix ensembles is defined which include the most general nearest-neighbour qubit chain Hamiltonians. For…
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
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…
We investigate the higher-order connectivity of scale-free networks using algebraic topology. We model scale-free networks as preferential attachment graphs, and we study the algebraic-topological properties of their clique complexes. We…