Noncommutative network models

DOI10.1017/S0960129519000161MaRDI QIDQ5220180zbMATH OpenWikidataFDO

Authors Joe Moeller

Publication date 11 March 2020

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

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

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

zbMATH Keywords

networkKneser graphuniversal algebramonoidal categorygraph product

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40) Connections of semigroups with homological algebra and category theory (20M50) Monoidal categories, symmetric monoidal categories (18M05)

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.

Recommendations

• Network models
• scientific article; zbMATH DE number 6456807
• Constructing network models by graph operations and based graphs
• Network models from Petri nets with catalysts
• Computational Science - ICCS 2004

Cites work

• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 3458752 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• A survey of graphical languages for monoidal categories
• Braided tensor categories
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
• Graph products of monoids
• Homotopical algebra
• Kneser's conjecture, chromatic number, and homotopy
• Network models
• On the duality between varieties and algebraic theories
• Poset topology and homological invariants of algebras arising in algebraic combinatorics

Cited in

(5)

• Monoidal Grothendieck construction
• Hypergraph categories
• Constructing network models by graph operations and based graphs
• Network models
• Operads for complex system design specification, analysis and synthesis

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)