Our papers are the official record of our discoveries. They allow others to build on and apply our work. Each paper is the result of many months of research, so we make a special effort to make them clear, beautiful and inspirational, and publish them in leading journals.

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.

  • Robustness and assortativity for diffusion-like processes in scale-free networks

    GDASA. ScalaVZGCG. Caldarelli EPL

    Robust and assortative

    Spectral analysis shows that disassortative networks exhibit a higher epidemiological threshold and are therefore easier to immunize.

  • Networks with arbitrary edge multiplicities

    VZDGGCG. Caldarelli EPL

    Clustering inverted

    Edge multiplicity—the number of triangles attached to edges—is a powerful analytic tool to understand and generalize network properties.

  • 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.

  • EPL

    Single elimination competition

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