Network Models
Theory and applications of categories, Tome 35 (2020), pp. 700-744
Cet article a éte moissonné depuis la source Theory and Applications of Categories website
Networks can be combined in various ways, such as overlaying one on top of another or setting two side by side. We introduce `network models' to encode these ways of combining networks. Different network models describe different kinds of networks. We show that each network model gives rise to an operad, whose operations are ways of assembling a network of the given kind from smaller parts. Such operads, and their algebras, can serve as tools for designing networks. Technically, a network model is a lax symmetric monoidal functor from the free symmetric monoidal category on some set to Cat, and the construction of the corresponding operad proceeds via a symmetric monoidal version of the Grothendieck construction.
Publié le :
Classification :
18D30, 18M05, 18M35, 18M60, 18M80, 68M10, 90B18
Keywords: Grothendieck construction, graph, monoidal category, network, operad
Keywords: Grothendieck construction, graph, monoidal category, network, operad
@article{TAC_2020_35_a19,
author = {John C. Baez and John Foley and Joe Moeller and Blake S. Pollard},
title = {Network {Models}},
journal = {Theory and applications of categories},
pages = {700--744},
year = {2020},
volume = {35},
language = {en},
url = {http://geodesic.mathdoc.fr/item/TAC_2020_35_a19/}
}
John C. Baez; John Foley; Joe Moeller; Blake S. Pollard. Network Models. Theory and applications of categories, Tome 35 (2020), pp. 700-744. http://geodesic.mathdoc.fr/item/TAC_2020_35_a19/