2 papers
cs.DS2026
Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
Matteo Stromieri, Emanuele Natale, Amos Korman
Target shape, not just size, plays a pivotal role in determining detectability during random search. We analyze intermittent Lévy walks in three dimensions, and mathematically prov…
cs.DS2025
Approximate -hop neighborhoods on incremental graphs: An efficient lazy approach
Luca Becchetti, Andrea Clementi, Luciano Gualà +3
In this work, we propose, analyze and empirically validate a lazy-update approach to maintain accurate approximations of the -hop neighborhoods of dynamic graphs resulting from…