Coloring Fibonacci-Cayley tree: An application to neural networks

arXiv1707.02227MaRDI QIDQ6288752FDOQ6288752

Publication date: 5 July 2017

Abstract: This paper investigates the coloring problem on Fibonacci-Cayley tree, which is a Cayley graph whose vertex set is the Fibonacci sequence. More precisely, we elucidate the complexity of shifts of finite type defined on Fibonacci-Cayley tree via an invariant called entropy. It comes that computing the entropy of a Fibonacci tree-shift of finite type is equivalent to studying a nonlinear recursive system. After proposing an algorithm for the computation of entropy, we apply the result to neural networks defined on Fibonacci-Cayley tree, which reflect those neural systems with neuronal dysfunction. Aside from demonstrating a surprising phenomenon that there are only two possibilities of entropy for neural networks on Fibonacci-Cayley tree, we reveal the formula of the boundary in the parameter space.

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Symbolic dynamics (37B10)

This page was built for publication: Coloring Fibonacci-Cayley tree: An application to neural networks

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