icon
Memristive networks: from graph theory to statistical physics

AZA. ZegaracFCF. Caravelli EPL

Memristive networks

A simple solvable model of memristive networks suggests a correspondence between the asymptotic states of memristors and the Ising model.

Scale-free networks as an epiphenomenon of memory

FCF. CaravelliAHMV EPL

From memory to scale-free

A local model of preferential attachment with short-term memory generates scale-free networks, which can be readily computed by memristors.

When are cellular automata random?

TFT. FinkJCSA EPL

Random cellular automata

Of the 256 elementary cellular automata, 28 of them exhibit random behavior over time, but spatio-temporal currents still lurk underneath.

Placeholder

3 EPL

Strategy for conkers

In single elimination competition the best indicator of success is a player's wealth: the accumulated wealth of all defeated players.