Related papers: Random chain complexes of real vector spaces

For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

Random contractions (sub-unitary random matrices) appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with discrete time. We analyze statistical properties of complex…

We study the homological properties of random simplicial complexes. In particular, we obtain the asymptotic behavior of lifetime sums for a class of increasing random simplicial complexes; this result is a higher-dimensional counterpart of…

In the current work, we study the eigenvalue distribution results of a class of non-normal matrix-sequences which may be viewed as a low rank perturbation, depending on a parameter $\beta>1$, of the basic Toeplitz matrix-sequence…

Over thirty years ago, Kalai proved a beautiful $d$-dimensional analog of Cayley's formula for the number of $n$-vertex trees. He enumerated $d$-dimensional hypertrees weighted by the squared size of their $(d-1)$-dimensional homology…

We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to…

We consider multiple and set-indexed sums of random vectors taking values in Euclidean space of growing dimension. It is shown that, when viewed as finite metric spaces, the sets of values of such sums converge in probability. The limit is…

Continual Lie algebras are infinite-dimensional generalizations of Lie algebras with discrete root system by considering continual root systems. In this paper we establish the general relation between chain complexes and continual Lie…

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…

Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…

We consider an ensemble of $2\times 2$ normal matrices with complex entries representing operators in the quantum mechanics of 2 - level parity-time reversal (PT) symmetric systems. The randomness of the ensemble is endowed by obtaining…

The characteristic cycle of a complex of sheaves on a complex analytic space provides weak information about the complex; essentially, it yields the Euler characteristics of the hypercohomology of normal data to strata. We show how perverse…

In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…

Intrinsic volumes, which generalize both Euler characteristic and Lebesgue volume, are important properties of $d$-dimensional sets. A random cubical complex is a union of unit cubes, each with vertices on a regular cubic lattice,…

We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…

Complex Hermitian random matrices with a unitary symmetry can be distinguished by a weight function. When this is even, it is a known result that the distribution of the singular values can be decomposed as the superposition of two…

In this paper we consider the asymptotic behavior of invariants such as Betti numbers, minimal numbers of generators of singular homology, the order of the torsion subgroup of singular homology, and torsion invariants. We will show that all…

We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…

We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is…