Noncommutative network models

From MaRDI portal
Publication:5220180

DOI10.1017/S0960129519000161zbMATH Open1442.18034arXiv1804.07402WikidataQ126813419 ScholiaQ126813419MaRDI QIDQ5220180FDOQ5220180


Authors: Joe Moeller Edit this on Wikidata


Publication date: 11 March 2020

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Abstract: Network models, which abstractly are given by lax symmetric monoidal functors, are used to construct operads for modeling and designing complex networks. Many common types of networks can be modeled with simple graphs with edges weighted by a monoid. A feature of the ordinary construction of network models is that it imposes commutativity relations between all edge components. Because of this, it cannot be used to model networks with bounded degree. In this paper, we construct the free network model on a given monoid, which can model networks with bounded degree. To do this, we generalize Green's graph products of groups to pointed categories which are finitely complete and cocomplete.


Full work available at URL: https://arxiv.org/abs/1804.07402




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Noncommutative network models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220180)