Dynamically generated Networks

Publication date 17 November 2013

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Abstract: Simple algebraic rules can produce complex networks with rich structures. These graphs are obtained when looking at a monoid operating on a ring. There are relations to dynamical systems theory and number theory. This document illustrates this class of networks introduced together with Montasser Ghachem. Besides showing off pictures, we look at elementary results related to the Chinese remainder theorem, the Collatz problem, the Artin constant, Fermat primes and Pierpont primes.

This page was built for publication: Dynamically generated Networks

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