Memristive Networks: from Graph Theory to Statistical Physics
arXiv:1908.08105 · doi:10.1209/0295-5075/125/10001
Abstract
We provide an introduction to a very specific toy model of memristive networks, for which an exact differential equation for the internal memory which contains the Kirchhoff laws is known. In particular, we highlight how the circuit topology enters the dynamics via an analysis of directed graph. We try to highlight in particular the connection between the asymptotic states of memristors and the Ising model, and the relation to the dynamics and statics of disordered systems.
7 pages double columns; invited EPL Perspectives paper
References in corpus (8)
- Statistical mechanics and dynamics of solvable models with long-range interactions
- Memory effects in complex materials and nanoscale systems
- Memcomputing: a computing paradigm to store and process information on the same physical platform
- Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states
- The complex dynamics of memristive circuits: analytical results and universal slow relaxation
- Complex dynamics and scale invariance of one-dimensional memristive networks
- Locality of interactions for planar memristive circuits
- A mean-field model of memristive circuit interaction