Efficient network exploration by means of resetting self-avoiding random walkers

The self-avoiding random walk (SARW) is a stochastic process whose state variable avoids returning to previously visited states. This non-Markovian feature has turned SARWs a powerful tool for modeling a plethora of relevant aspects in network science, such as network navigability, robustness and re...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of physic, complexity complexity, 2023-12, Vol.4 (4), p.4
Hauptverfasser:	Colombani, Gaia, Bertagnolli, Giulia, Artime, Oriol
Format:	Artikel
Sprache:	eng
Schlagworte:	network exploration network navigability self-avoiding random walks stochastic resetting
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!