Related papers: Randomized simplicial sets
Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…
We consider locally symmetric manifolds with a fixed universal covering, and construct for each such manifold M a simplicial complex R whose size is proportional to the volume of M. When M is non-compact, R is homotopically equivalent to M,…
We study the homotopy types of spaces of algebraic (rational) maps from real projective spaces into complex projective spaces. In a previous paper we have shown that the inclusion of the first space into the second one is a homotopy…
We prove that the homotopy theory of parametrized spaces embeds fully and faithfully in the homotopy theory of simplicial presheaves, and that its essential image consists of the locally homotopically constant objects. This gives a…
We study the homotopy types of certain spaces closely related to the spaces of algebraic (rational) maps from the $m$ dimensional real projective space into the $n$ dimensional complex projective space for $2\leq m\leq 2n$ (we conjecture…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
Let $f:G\rightarrow H$ be a homomorphism of groups, we construct a topological space $X_f$ such that its group of homeomorphisms is isomorphic to $G$, its group of homotopy classes of self-homotopy equivalences is isomorphic to $H$ and the…
There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…
We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…
In this paper, we study some topological characteristics of the n-normed spaces. We observe convergence sequences, closed sets, and bounded sets in the n-normed spaces using norms of quotient spaces that will be constructed. These norms…
A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…
We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…
We consider the space of probabilities {P(x)}, where the x are coordinates of a configuration space. Under the action of the translation group there is a natural metric over the space of parameters of the group given by the Fisher-Rao…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
In this paper I give overviews of the polysymplectic approach to covariant Hamiltonian field theory and the simplest geometric quantization of classical particle theories. I then give a synopsis of a recently proposed toy model for applying…
In this paper, we review a method for computing and parameterizing the set of homotopy classes of chain maps between two chain complexes. This is then applied to finding topologically meaningful maps between simplicial complexes, which in…
Coquand's cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the…