Related papers: Injective and Projective Model Structures on Enric…

It is well known that surface-links in 4-space can be presented by diagrams on the plane of 4-valent spatial graphs with makers on the vertices, called marked graph diagrams. In this paper we extend the method of presenting surface-links by…

Suppose that $F: \mathcal{N} \to \mathcal{M}$ is a functor whose target is a Quillen model category. We give a succinct sufficient condition for the existence of the right-induced model category structure on $\mathcal{N}$ in the case when…

In this paper, we construct recollements and ladders for exceptional curves by using reduction/insertion functors due to $p$-cycle construction. As applications to weighted projective lines, we classify recollements for the category of…

We combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

We investigate an enriched-categorical approach to a field of discrete mathematics. The main result is a duality theorem between a class of enriched categories (called $\overline{\mathbb{Z}}$- or $\overline{\mathbb{R}}$-categories) and that…

Exponential random graph models (ERGMs) are a widely used framework for network data, enabling hypothesis testing on the structural mechanisms underlying observed networks. Bayesian ERGMs provide principled uncertainty quantification and…

The Ziegler spectrum for categories enriched in closed symmetric monoidal Grothendieck categories is defined and studied in this paper. It recovers the classical Ziegler spectrum of a ring. As an application, the Ziegler spectrum as well as…

We present a uniform theory of constructible sheaves on arbitrary schemes with coefficients in topological or even condensed rings. This is accomplished by defining lisse sheaves to be the dualizable objects in the derived infinity-category…

This work is the first one in a series, in which we develop a mathematical theory of enriched (braided) monoidal categories and their representations. In this work, we introduce the notion of the $E_0$-center ($E_1$-center or $E_2$-center)…

We introduce a new notion of recursively generated enriched term which generalizes the one studied in joint work with Rosick\'y. These new terms come together with a notion of term-interpretability, which recovers the same type of…

Exponential-family Random Graph Models (ERGMs) constitute a large statistical framework for modeling sparse and dense random graphs, short- and long-tailed degree distributions, covariates, and a wide range of complex dependencies. Special…

In this paper we initiate the study of enriched $\infty$-operads. We introduce several models for these objects, including enriched versions of Barwick's Segal operads and the dendroidal Segal spaces of Cisinski and Moerdijk, and show these…

Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a…

For $X$ a finite category and $F$ a finite field, we study the additive image of the functor $\operatorname{H}_0(-,F) \colon \operatorname{rep}(X, \mathbf{Top}) \to \operatorname{rep}(X, \mathbf{Vect}_F)$, or equivalently, of the free…

We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized…

The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…

We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of…

Probabilistic graphical models combine the graph theory and probability theory to give a multivariate statistical modeling. They provide a unified description of uncertainty using probability and complexity using the graphical model.…

Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…