Volume 125, Number 1, January 2019
|Number of page(s)||7|
|Published online||15 January 2019|
Memristive networks: From graph theory to statistical physics
1 ETH Zurich - 8092 Zurich, Switzerland
2 London Institute for Mathematical Sciences - 35a South Street, London W1K 2XF, UK
3 Invenia Labs - 27 Parkside Place, CB1 1JF Cambridge, UK
4 Theoretical Division (T4) and Center for Nonlinear Studies, Los Alamos National Laboratory Los Alamos, NM 87545, USA
Received: 30 November 2018
Accepted: 4 December 2018
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.
PACS: 05.45.-a – Nonlinear dynamics and chaos / 05.20.-y – Classical statistical mechanics / 07.50.Ek – Circuits and circuit components
© EPLA, 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.