2000 character limit reached
Memristive Networks: from Graph Theory to Statistical Physics (1908.08105v1)
Published 21 Aug 2019 in cond-mat.dis-nn, cond-mat.stat-mech, and nlin.AO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.