## Network models.(English)Zbl 1442.18014

This paper studies operads suitable for designing networks. The authors want a malleable framework that can handle networks of various kinds, described at a level of detail that the user is free to adjust. To achieve this malleability, the authors introduce, as a generalization of the concept of colored directed multigraphs, a general concept of network model, which gives an operad whose operations are ways to build larger networks of this kind from smaller ones. Formally, given a set $$C$$ of vertex colors, a network model is a lax symmetric monoidal functor $F:\boldsymbol{S}(C)\rightarrow\boldsymbol{Cat}$ where $$\boldsymbol{S}(C)$$ is the free strict symmetric monoidal category on $$C$$ and $$\boldsymbol{Cat}$$ is the category of small categories endowed with its cartesian monoidal structure. The main result of the paper is that any network model gives rise to a typed operad, also known as a colored operad or symmetric multicategory [D. Yau, Colored operads. Providence, RI: American Mathematical Society (AMS) (2016; Zbl 1348.18014)].
By assuming that $$F$$ takes values in the category $$\boldsymbol{Mon}$$ of monoids and simultaneously that $$C$$ is a singleton so that $$\boldsymbol{S}(C)$$ is the groupoid $$\boldsymbol{S}$$, we get what is called a one-colored network model, which is a lax symmetric monoidal functor $F:\boldsymbol{S}\rightarrow\boldsymbol{Mon}$ Joyal initiated an extensive study of functors $F:\boldsymbol{S}\rightarrow\boldsymbol{Set}$ under the name of species [F. Bergeron et al., Combinatorial species and tree-like structures. Transl. from the French by Margaret Readdy. Cambridge: Cambridge University Press (1998; Zbl 0888.05001); A. Joyal, Adv. Math. 42, 1–82 (1981; Zbl 0491.05007); Lect. Notes Math. 1234, 126–159 (1986; Zbl 0612.18002)]. It can be said that a one-colored network model is a species with some extra operations.
The paper consists of 8 sections. §2 studies one-colored network models. §3 describes a systematic procedure for getting one-colored network models from monoids. §4 studies network models with examples. §5 describes a category $$\boldsymbol{NetMod}$$ of network models, showing that the procedure for network models from monoids is functorial. Making $$\boldsymbol{NetMod}$$ a symmetric monoidal category, the authors give examples of how to build new network models by tensoring old ones. §6 is the technical heart of the paper, providing the machinery to construct operads from network models in a functorial way and describing enhancements of the well-known Grothendieck construction of thei category of elements $$\int F$$ of a functor $$F:C\rightarrow\boldsymbol{Cat}$$, where $$C$$ is any small category. It is shown that, given a symmetric monoidal category $$C$$ and a lax symmetric monoidal functor $$F:C\rightarrow\boldsymbol{Cat}$$, $$\int F$$ is symmetric monoidal. It is also shown that the construction sending the lax symmetric monoidal functor $$F$$ to the symmetric monoidal category $$\int F$$ is functorial. §7 applies the machinery to build operads from network models. §8 describes some algebras of these operads, discussing an algebra whose elements are networks of range-limited communication channels (Example 8.4).

### MSC:

 18D30 Fibered categories 18M05 Monoidal categories, symmetric monoidal categories 18M35 Categories of networks and processes, compositionality 18M60 Operads (general) 18M80 Species, Hopf monoids, operads in combinatorics 68M10 Network design and communication in computer systems 90B18 Communication networks in operations research

### Keywords:

Grothendieck construction; graph; monoidal category; network; operad

### Citations:

Zbl 1348.18014; Zbl 0888.05001; Zbl 0491.05007; Zbl 0612.18002
Full Text:

### References:

 [1] J. C. Baez and B. S. Pollard, A compositional framework for reaction networks,Rev. Math. Phys. 29, 1750028. Available asarXiv:1704.02051. · Zbl 1383.68053 [2] J. C. Baez, J. D. Foley, J. Moeller and B. S. Pollard, Operads for communication networks, 2016, 37 pages, Technical report, DARPA CASCADE project. [3] J. C. Baez, J. D. Foley, J. Moeller and B. S. Pollard, Compositional tasking, 2017, 27 pages, Technical report, DARPA CASCADE project. [4] J. C. Baez, J. Foley and J. Moeller, Network models from Petri nets with catalysts,Compositionality1, 4 (2019). Available asarXiv:1904.03550. [5] F. Bergeron, G. Labelle, and P. Leroux,Combinatorial Species and Tree-like Structures, Cambridge, Cambridge Univ. Press, 1998. · Zbl 0888.05001 [6] F. Borceux,Handbook of Categorical Algebra, Cambridge Univ. Press, Cambridge, 1994. · Zbl 0911.18001 [7] B. Day and R. Street, Monoidal bicategories and Hopf algebroids,Adv. Math.129(1997), 99-157. · Zbl 0910.18004 [8] N. Gambino and A. Joyal, On operads, bimodules and analytic functors,Memoirs AMS249, 2017. Available asarXiv:1405.7270 · Zbl 1393.18007 [9] A. Grothendieck, Cat´egories fibr´ees et descente, inSGA1: Revˆetements ´etales et groupe fondamental, Lecture Notes in Mathematics224, Springer, Berlin, pp. 145-194.Available as arXiv:math/0206203. [10] C. Hermida, Some properties of Fib as a fibred 2-category,J. Pure Appl. Algebra,134(1999), 83-109. · Zbl 0935.18007 [11] M. Hyland and A. J. Power, Pseudo-commutative monads and pseudo-closed 2-categories,Jour. Pure Appl. Alg.175(2002), 141-185. · Zbl 1009.18003 [12] B. Jacobs,Categorical Logic and Type Theory, Elsevier, Amderstam, 1999. · Zbl 0911.03001 [13] P. Johnstone,Sketches of an Elephant: A Topos Theory Compendium, Vol. 1, Oxford Univ. Press, Oxford, 2002. · Zbl 1071.18001 [14] A. Joyal, Une th´eorie combinatoire des s´eries formelles,Adv. Math.42(1981), 1-82. [15] A. Joyal, Foncteurs analytiques et esp‘eces des structures, in Lecture Notes in Mathematics1234, Springer, Berlin, 1986, pp. 126-159. [16] F. W. Lawvere, Qualitative distinctions between some toposes of generalized graphs,Contemp. Math.92(1989), 261-299. · Zbl 0675.18003 [17] S. Mac Lane,Categories for the Working Mathematician, 2nd edition, Springer, Berlin, 1998. · Zbl 0906.18001 [18] P. McCrudden, Balanced coalgebroids,Th. Appl. Cat.7(2000), 71-147. · Zbl 0960.18005 [19] J. Moeller, Noncommutative network models,Math. Struct. Comp. Sci.30(2020), 14-32. Available asarXiv:1804.07402. · Zbl 1442.18034 [20] J. Moeller and C. Vasilakopoulou, Monoidal Grothendieck construction,Theor. Appl. Cat., to appear. Available asarXiv:1809.00727. [21] V. Sassone,Strong Concatenable Processes: an Approach to the Category of Petri Net Computations,BRICS Report Series33(1994). [22] C. Vasilakopoulou,Generalization of Algebraic Operations via Enrichment, Chap. I.5: Fibrations and Cofibrations, Ph.D. Thesis, University of Cambridge, 2014. Available asarXiv:1411.3038. [23] D.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.