Abstract
The challenge of maximizing dispersion of a dynamical process over a globally unknown network is overcome by introducing an adaptive random walk. This adaptive random walk, through a large-deviation-theory approach, updates its transition rule on the local information collected while exploring the network.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
