| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Network Models | John C. Baez
; John Foley
; Joseph Moeller
; Blake S. Pollard
; | Date: |
31 Oct 2017 | Abstract: | Networks can be combined in many 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
$mathrm{Cat}$, and the construction of the corresponding operad proceeds via a
symmetric monoidal version of the Grothendieck construction. | Source: | arXiv, 1711.0037 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |