Geometry-induced fluctuations of olfactory searches in bounded domains.

In olfactory search an immobile target emits chemical molecules at constant rate. The molecules are transported by the medium, which is assumed to be turbulent. Considering a searcher able to detect such chemical signals and whose motion follows the infotaxis strategy, we study the statistics of the first-passage time to the target when the searcher moves on a finite two-dimensional lattice of different geometries. Far from the target, where the concentration of chemicals is low, the direction of the searcher's first movement is determined by the geometry of the domain and the topology of the lattice, inducing strong fluctuations on the average search time with respect to the initial position of the searcher. The domain is partitioned in well-defined regions characterized by the direction of the first movement. If the search starts over the interface between two different regions, large fluctuations in the search time are observed.

[1]  D. Dean,et al.  Distribution of the least-squares estimators of a single Brownian trajectory diffusion coefficient , 2013, 1301.4374.

[2]  G. Schehr,et al.  Proportionate vs disproportionate distribution of wealth of two individuals in a tempered Paretian ensemble , 2011, 1106.4710.

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Simona Cocco,et al.  On the trajectories and performance of Infotaxis, an information-based greedy search algorithm , 2010, 1010.2728.

[5]  E. Gelenbe.  Search in unknown random environments. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  H. Wio,et al.  Optimal intermittent search strategies: smelling the prey , 2010 .

[7]  I M Sokolov,et al.  Sampling from scale-free networks and the matchmaking paradox. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  G. Schehr,et al.  Symmetry breaking between statistically equivalent, independent channels in few-channel chaotic scattering. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Massimo Vergassola,et al.  ‘Infotaxis’ as a strategy for searching without gradients , 2007, Nature.

[10]  R. Andrew Russell,et al.  Robot Odor Localization: A Taxonomy and Survey , 2008, Int. J. Robotics Res..

[11]  Ralf Metzler,et al.  First passages in bounded domains: when is the mean first passage time meaningful? , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Ralf Metzler,et al.  Lévy strategies in intermittent search processes are advantageous , 2008, Proceedings of the National Academy of Sciences.

[13]  G. Oshanin,et al.  First passages for a search by a swarm of independent random searchers , 2011, 1106.4182.

[14]  I. Eliazar,et al.  The matchmaking paradox: a statistical explanation , 2010 .

[15]  I. Eliazar,et al.  On the fractal characterization of Paretian Poisson processes , 2012 .

[16]  Iddo Eliazar,et al.  On selfsimilar Lévy Random Probabilities , 2005 .

[17]  Jean-Baptiste Masson,et al.  Olfactory searches with limited space perception , 2013, Proceedings of the National Academy of Sciences.

[18]  Katja Lindenberg,et al.  Intermittent random walks for an optimal search strategy: one-dimensional case , 2007 .

[19]  Optimal least-squares estimators of the diffusion constant from a single Brownian trajectory , 2013, 1303.4273.

[20]  G. Schehr,et al.  Two stock options at the races: Black–Scholes forecasts , 2010, 1005.1760.

[21]  O Bénichou,et al.  Optimal search strategies for hidden targets. , 2005, Physical review letters.

[22]  Denis Boyer,et al.  Optimal estimates of the diffusion coefficient of a single Brownian trajectory. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Massimo Vergassola,et al.  Chasing information to search in random environments , 2009 .