G. M. Viswanathan

Learn More
We address the general question of what is the best statistical strategy to adapt in order to search efficiently for randomly located objects ('target sites'). It is often assumed in foraging theory that the flight lengths of a forager have a characteristic scale: from this assumption gaussian, Rayleigh and other classical distributions with well-defined(More)
The study of animal foraging behaviour is of practical ecological importance, and exemplifies the wider scientific problem of optimizing search strategies. Lévy flights are random walks, the step lengths of which come from probability distributions with heavy power-law tails, such that clusters of short steps are connected by rare long steps. Lévy flights(More)
In this work we discuss some recent contributions to the random search problem. Our analysis includes superdiffusive Lévy processes and correlated random walks in several regimes of target site density, mobility and revisitability. We present results in the context of mean-field-like and closed-form average calculations, as well as numerical simulations. We(More)
An important application involving two-species reaction-diffusion systems relates to the problem of finding the best statistical strategy for optimizing the encounter rate between organisms. We investigate the general problem of how the encounter rate depends on whether organisms move in Lévy or Brownian random walks. By simulating a limiting generalized(More)
We study the role of dynamical constraints in the general problem of finding the best statistical strategy for random searching when the targets can be detected only in the limited vicinity of the searcher. We find that the optimal search strategy depends strongly on the delay time tau during which a previously visited site becomes unavailable. We also find(More)
Animal searches cover a full range of possibilities from highly deterministic to apparently completely random behaviors. However, even those stochastic components of animal movement can be adaptive, since not all random distributions lead to similar success in finding targets. Here we address the general problem of optimizing encounter rates in(More)
We introduce and develop new techniques to quantify DNA patchiness, and to quantify characteristics of its mosaic structure. These techniques, which involve calculating two functions, alpha(l) and beta(l), measure correlations at length scale l and detect distinct characteristic patch sizes embedded in scale-invariant patch size distributions. Using these(More)
Theoretical and empirical investigations of search strategies typically have failed to distinguish the distinct roles played by density versus patchiness of resources. It is well known that motility and diffusivity of organisms often increase in environments with low density of resources, but thus far there has been little progress in understanding the(More)
We apply the theory of random walks to quantitatively describe the general problem of how to search eÆciently for randomly located objects that can only be detected in the limited vicinity of a searcher who typically has a nite degree of \free will" to move and search at will. We illustrate L evy ight search processes by comparison to Brownian random walks(More)
We investigate the properties of a deterministic walk, whose locomotion rule is always to travel to the nearest site. Initially the sites are randomly distributed in a closed rectangular (ALxL) landscape and, once reached, they become unavailable for future visits. As expected, the walker step lengths present characteristic scales in one (L-->0) and two (AL(More)