Self-organization and solution of shortest-path optimization problems with memristive networks

Abstract

We show that memristive networks-namely networks of resistors with memory-can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time non-locality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

arXiv admin note: substantial text overlap with arXiv:1211.4487

References in corpus (2)

• Memory effects in complex materials and nanoscale systems
• Memcomputing: a computing paradigm to store and process information on the same physical platform

Cited by in corpus (15)

• Universal Memcomputing Machines
• Memcomputing: Leveraging memory and physics to compute efficiently
• The complex dynamics of memristive circuits: analytical results and universal slow relaxation
• Scale-free networks as an epiphenomenon of memory
• Memcomputing with membrane memcapacitive systems
• Phase Transitions and Duality in Adiabatic Memristive Networks
• Asymptotic behavior of memristive circuits
• Memristive oscillatory circuits for resolution of NP-complete logic puzzles: Sudoku case
• The mise en scene of memristive networks: effective memory, dynamics and learning
• Transient dynamics of pulse-driven memristors in the presence of a stable fixed point
• A scalable method to find the shortest path in a graph with circuits of memristors
• Memcomputing and Swarm Intelligence
• Switching Synchronization in One-Dimensional Memristive Networks
• Switching synchronization in 1-D memristive networks: An exact solution
• Brain-like features of MemComputing machines