Memristive network dynamics are governed by a projector of the circuit's cycle space; this paper reviews that framework, adds a disorder-averaged equation, proves planar locality bounds do not extend to non-planar graphs, and reports logarithmic relaxation in simulations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.dis-nn 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Memristive Networks: from Graph Theory to Statistical Physics
Memristive network dynamics are governed by a projector of the circuit's cycle space; this paper reviews that framework, adds a disorder-averaged equation, proves planar locality bounds do not extend to non-planar graphs, and reports logarithmic relaxation in simulations.