Related papers: Generalized Random Simplicial Complexes
In the paper we consider pseudo bihermitian structures - a pair of complex structures compatible with a pseudo Riemannian metric. As in the positive definite case we establish its relations with generalized (pseudo) Kaehler geometry and…
The framework of non-extensive statistical mechanics, proposed by Tsallis, has been used to describe a variety of systems. The non-extensive statistical mechanics is usually introduced in a formal way, thus simple models exhibiting some…
In this paper we inititate the study of abstract simplicial complexes which are initial segments of qualitative probability orders. This is a natural class that contains the threshold complexes and is contained in the shifted complexes, but…
As Physics did in previous centuries, there is currently a common dream of extracting generic laws of nature in economics, sociology, neuroscience, by focalising the description of phenomena to a minimal set of variables and parameters,…
We explain the relation between certain random tiling models and interacting particle systems belonging to the anisotropic KPZ (Kardar-Parisi-Zhang) universality class in 2+1-dimensions. The link between these two \emph{a priori} disjoint…
We construct several infinite families of nonnegatively curved manifolds of low cohomogeneity and small dimension which can be distinguished by their cohomology rings. In particular, we exhibit an infinite family of eight-dimensional…
In this paper we study a generalization of K\"ahler differentials, which correspond to the secondary Hochschild homology associated to a triple $(A,B,\varepsilon)$. We establish computations in low dimension, while also showing how this…
In recent years, there has been a growing recognition that higher-order structures are important features in real-world networks. A particular class of structures that has gained prominence is known as a simplicial complex. Despite their…
There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…
For any k<2n we construct a complete system of invariants in the problem of classifying singularities of immersed k-dimensional submanifolds of a symplectic 2n-manifold at a generic double point.
Geometrical random multiplicative cascade processes are often used to model positive-valued multifractal fields such as for example the energy dissipation field of fully developed turbulence. A dynamical generalisation of these models is…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
A Hamiltonian cycle in a graph is a spanning subgraph that is homeomorphic to a circle. With this in mind, it is natural to define a Hamiltonian d-sphere in a d-dimensional simplicial complex as a spanning subcomplex that is homeomorphic to…
We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…
We describe a random matrix approach that can provide generic and readily soluble mean-field descriptions of the phase diagram for a variety of systems ranging from QCD to high-T_c materials. Instead of working from specific models, phase…
In this paper, we investigate multidimensional first-order quasi-linear systems and find necessary conditions for them to admit Hamiltonian formulation. The insufficiency of the conditions is related to the Poisson cohomology of the…
We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…
For a graph G, the neighborhood complex N[G] is the simplicial complex having all subsets of vertices with a common neighbor as its faces. It is a well known result of Lovasz that if N[G] is k-connected, then the chromatic number of G is at…
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…