Topology-dependent density optima for efficient simultaneous network exploration.

A random search process in a networked environment is governed by the time it takes to visit every node, termed the cover time. Often, a networked process does not proceed in isolation but competes with many instances of itself within the same environment. A key unanswered question is how to optimize this process: How many concurrent searchers can a topology support before the benefits of parallelism are outweighed by competition for space? Here, we introduce the searcher-averaged parallel cover time (APCT) to quantify these economies of scale. We show that the APCT of the networked symmetric exclusion process is optimized at a searcher density that is well predicted by the spectral gap. Furthermore, we find that nonequilibrium processes, realized through the addition of bias, can support significantly increased density optima. Our results suggest alternative hybrid strategies of serial and parallel search for efficient information gathering in social interaction and biological transport networks.

[1]  J. Palacios.  On hitting and cover times via electric networks , 2003 .

[2]  M. Moreau,et al.  Intermittent search strategies , 2011, 1104.0639.

[3]  A. Caspi,et al.  Enhanced diffusion in active intracellular transport. , 2000, Physical review letters.

[4]  C. Kipnis.  Central Limit Theorems for Infinite Series of Queues and Applications to Simple Exclusion , 1986 .

[5]  Christophe Lutz,et al.  Single-file diffusion of colloids in one-dimensional channels , 2004, Science.

[6]  K. Kehr.  Diffusion in concentrated lattice gases , 1983 .

[7]  Kerry A. Landman,et al.  Diffusing Populations: Ghosts or Folks? , 2009 .

[8]  Johan Elf,et al.  Effects of macromolecular crowding and DNA looping on gene regulation kinetics , 2009 .

[9]  Izaak Neri,et al.  Totally asymmetric simple exclusion process on networks. , 2011, Physical review letters.

[10]  S. Majumdar,et al.  Exact distributions of the number of distinct and common sites visited by N independent random walkers. , 2013, Physical review letters.

[11]  Johan Jonasson.  On the Cover Time for Random Walks on Random Graphs , 1998, Comb. Probab. Comput..

[12]  Nicola Bellomo,et al.  On the Modeling of Traffic and Crowds: A Survey of Models, Speculations, and Perspectives , 2011, SIAM Rev..

[13]  Exact distributions of cover times for N independent random walkers in one dimension. , 2016, Physical review. E.

[14]  T. Liggett,et al.  Stochastic Interacting Systems: Contact, Voter and Exclusion Processes , 1999 .

[15]  Matthew J Simpson,et al.  Models of collective cell behaviour with crowding effects: comparing lattice-based and lattice-free approaches , 2012, Journal of The Royal Society Interface.

[17]  Alessandro Vespignani,et al.  Reaction–diffusion processes and metapopulation models in heterogeneous networks , 2007, cond-mat/0703129.

[18]  K. Mallick,et al.  Large Deviations of a Tracer in the Symmetric Exclusion Process. , 2017, Physical review letters.

[19]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[20]  O. Bénichou,et al.  Global mean first-passage times of random walks on complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  H. Hilhorst,et al.  Covering of a finite lattice by a random walk , 1991 .

[22]  K. Mallick,et al.  Large deviations in single-file diffusion. , 2014, Physical review letters.

[23]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[24]  Radhika Nagpal,et al.  Programmable self-assembly in a thousand-robot swarm , 2014, Science.

[25]  Katsuhiro Nishinari,et al.  Physics of Transport and Traffic Phenomena in Biology: from molecular motors and cells to organisms , 2005 .

[26]  R. Kutner,et al.  Diffusion in concentrated lattice gases. III. Tracer diffusion on a one-dimensional lattice , 1983 .

[27]  Michael Small,et al.  Multiple random walks on complex networks: A harmonic law predicts search time. , 2017, Physical review. E.

[28]  Liu,et al.  Time-reversal invariance and universality of two-dimensional growth models. , 1987, Physical review. B, Condensed matter.

[29]  O Bénichou,et al.  Exact calculations of first-passage quantities on recursive networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[31]  L. Lizana,et al.  Single-file diffusion in a box. , 2008, Physical review letters.

[32]  Clemens Bechinger,et al.  Single-file diffusion of colloids in one-dimensional channels. , 2000, Physical review letters.

[33]  H. Rieger,et al.  Optimality of Spatially Inhomogeneous Search Strategies. , 2016, Physical review letters.

[34]  Dirk Brockmann,et al.  Cover time for random walks on arbitrary complex networks , 2017, Physical review. E.

[35]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[36]  Armin Fügenschuh,et al.  Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks , 2006, SIAM J. Optim..

[37]  Some exact results for the lattice covering time problem , 1990 .

[38]  H. Berg.  Random Walks in Biology , 2018 .

[39]  Peter J. Cameron,et al.  What is Combinatorics , 1994 .

[40]  Brian C. Ross.  Mutual Information between Discrete and Continuous Data Sets , 2014, PloS one.

[41]  Raphaël Voituriez,et al.  Migration of dendritic cells: physical principles, molecular mechanisms, and functional implications , 2013, Immunological reviews.

[42]  Jörn Dunkel,et al.  Stochastic cycle selection in active flow networks , 2016, Proceedings of the National Academy of Sciences.

[43]  O. Bénichou,et al.  Optimal search strategies of run-and-tumble walks. , 2016, Physical review. E.

[44]  M. Chupeau,et al.  Cover times of random searches , 2015, Nature Physics.

[45]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[46]  C. Van den Broeck,et al.  Diffusion of interacting particles in discrete geometries. , 2013, Physical review letters.

[47]  F. Bartumeus,et al.  Optimal search behavior and classic foraging theory , 2009 .

[48]  N. Linial,et al.  On the cover time of random walks on graphs , 1989 .

[49]  G. Viswanathan,et al.  Lévy flights and superdiffusion in the context of biological encounters and random searches , 2008 .

[50]  H. Stanley,et al.  Optimizing the success of random searches , 1999, Nature.

[51]  O. Bénichou,et al.  Kinetics of target site localization of a protein on DNA: a stochastic approach. , 2004, Biophysical journal.

[52]  Edward A. Codling,et al.  Random walk models in biology , 2008, Journal of The Royal Society Interface.

[53]  On cover times for 2D lattices , 2011, 1110.3367.

[54]  Fuji Zhang,et al.  Resistance distance and the normalized Laplacian spectrum , 2007, Discret. Appl. Math..

[55]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[56]  Axel Klar,et al.  Modeling, Simulation, and Optimization of Traffic Flow Networks , 2003, SIAM J. Sci. Comput..