Related papers: $(\infty,n)$-Limits I: Definition and first consis…
An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…
In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $\Delta$-complexes, respectively. The functors of classifying spaces and face posets are compatible with…
We define the notion of {\em classifying space} of a topological stack and show that every topological stack \X has a classifying space X which is a topological space well-defined up to weak homotopy equivalence. Under a certain…
By homotopy linear algebra we mean the study of linear functors between slices of the $\infty$-category of $\infty$-groupoids, subject to certain finiteness conditions. After some standard definitions and results, we assemble said slices…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
We explain how the notion of homotopy colimits gives rise to that of mapping spaces, even in categories which are not simplicial. We apply the technique of model approximations and use elementary properties of the category of spaces to be…
We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.
In "On o-minimal homotopy groups", o-minimal homotopy was developed for the definable category, proving o-minimal versions of the Hurewicz theorems and the Whitehead theorem. Here, we extend these results to the category of locally…
We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…
In this paper we present a novel approach to graph (and structural) limits based on model theory and analysis. The role of Stone and Gelfand dualities is displayed prominently and leads to a general theory, which we believe is naturally…
Given a locally presentable category together with a suitable functorial cylinder object, we construct model structures which are sensitive to the `direction' of the cylinder. We show that the Covariant and Contravariant model structures on…
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…
The notion of spectrum of first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. We study properties of spectrum for first-order formulae with bounded quantifier…
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…
We prove that the homotopy theory of Picard 2-categories is equivalent to that of stable 2-types.
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…