Growing Random Graphs with Quantum Rules

Hamza Jnane (1, 2) , Di Molfetta Giuseppe (3) , Filippo Miatto (1, 2)

1 IQA - Information Quantique et Applications
2 INFRES - Département Informatique et Réseaux
3 LIS - Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more established techniques. We propose two variations of a model to grow random graphs and trees, based on continuous-time quantum walks on the graphs. After a random characteristic time, the position of the walker(s) is measured and new nodes are attached to the nodes where the walkers collapsed. Such dynamical systems are reminiscent of the class of spontaneous collapse theories in quantum mechanics. We investigate several rates of this spontaneous collapse for an individual quantum walker and for two non-interacting walkers. We conjecture (and report some numerical evidence) that the models are scale-free.

Domaines: Physique Quantique [quant-ph]

Hamza Jnane, Di Molfetta Giuseppe, Filippo Miatto. Growing Random Graphs with Quantum Rules. Electronic Proceedings in Theoretical Computer Science, 2020, 315, pp.38-47. ⟨10.4204/EPTCS.315.4⟩. ⟨hal-03594728⟩