Universality in the target arrival statistics of non-conservative search processes
Stochastic search processes in which agents are continuously inserted into and removed from a target search domain are fundamental to a wide class of physical and artificial systems. The theory of such non-conservative search processes is, however, much less developed than for search processes with a fixed number of agents. Recent work on the non-conservative case has characterized the fastest first-passage time (FPT) to a target, after which the search process is terminated. Here we consider the complementary problem of continuous arrival statistics to a target. In particular, we derive the full time-dependent distribution of target arrivals, which we use to show that the inter-arrival time distribution is exactly exponential in steady-state regardless of the underlying search process. Thus, counterintuitively, the arrival statistics of non-conservative search are both universal and much simpler than sequential search-and-capture processes involving a fixed number of agents. Our methods also yield an exact expression for the fastest FPT distribution with time-dependent insertion, thereby generalizing previous work on fixed-rate insertion for non-conservative search. Altogether these results have major implications for target resource accumulation, wherein the delivery of resources is counter-balanced by their downstream consumption.