This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Phase transition in non-Markovian animal exploration model with preferential returns

Ohad Vilka,b,c, Daniel Camposd, Vicenç Méndezd, Emmanuel Lourieb,c, Ran Nathanb,c, Michael Assafa,e,∗ a Racah Institute of Physics, The Hebrew University of Jerusalem, Jerusalem, Israel, b Movement Ecology Lab, Department of Ecology, Evolution and Behavior, Alexander Silberman Institute of Life Sciences, Faculty of Science, The Hebrew University of Jerusalem, Jerusalem, Israel, c Minerva Center for Movement Ecology, The Hebrew University of Jerusalem, Jerusalem, Israel, d Grup de Física Estadística, Dept. de Física, Universitat Autónoma de Barcelona, 08193 Bellaterra (Barcelona), Spain, eInstitute for Physics and Astronomy, University of Potsdam, Potsdam 14476, Germany To whom correspondence should be addressed: michael.assaf@mail.huji.ac.il
Abstract

We study a non-Markovian and nonstationary model of animal mobility incorporating both exploration and memory in the form of preferential returns. We derive exact results for the probability of visiting a given number of sites and develop a practical WKB approximation to treat the nonstationary problem. We further show that this model adequately describes empirical movement data of Egyptian fruit bats (Rousettus aegyptiacus) when accounting for inter-individual variation in the population. Finally, we study the probability of visiting any site a given number of times and derive the corresponding mean-field equation. Here, we find a remarkable phase transition occurring at preferential returns which scale linearly with past visits. Following empirical evidence, we suggest that this phase transition reflects a trade-off between extensive and intensive foraging modes.

preprint: APS/123-QED

Introduction. Movement is a vital part of life and is key in a wide range of physical, biological and ecological systems. Theoretical and empirical frameworks are thus amply used to study the mechanisms underlying movement patterns in all organisms [1]. In particular, individual-based modeling of movement has played a crucial role in studying dynamic systems across multiple spatiotemporal scales [2, 3, 4]. These models can be applied to infer behaviors and draw causal links between observed phenomena and their underlying mechanisms beyond phenomenological description of the observed patterns [5].

Most theoretical models rely on Markovian assumptions to capture the properties of animal trajectories. However, memory and similar cognitive mechanisms are key to understanding patterns observed in animal foraging [6, 7]. A range of taxa, from insects to primates, have been shown to exhibit spatial memory, and many of them are known to repeatedly return to previously visited sites as a part of their regular foraging strategies, mammals being a paradigmatic example [8, 9, 10, 11, 4]. Notably, memory patterns must be properly balanced by the organisms with some level of behavioral plasticity to enhance flexibility and exploration (see, e.g., [12]). For all these reasons, correctly incorporating memory within stochastic models is an important research line for improving both predictive and descriptive tools of movement [13, 14, 6, 15]. Indeed, it has been shown that heuristic models of memory can be derived from microscopic consideration for limited cases [16, 17]. At the same time, new experimental methods are allowing to disentangle, even under field conditions, memory effects on movement from other cognitive/perception mechanisms [9]. As long as such experimental and theoretical advances are able to nourish each other, new levels of detail in our understanding of living organisms can be potentially reached.

Dealing with memory and similar cognitive mechanisms still represents a significant theoretical challenge. Stochastic models that allow the individual to return to its original position (resettings) have attracted much attention recently [18, 19, 20], but these only incorporate memory in an elementary way. More complex self-avoiding random walks or preferential returns (PR), where the individual returns to any previous location with a probability proportional to the number of previous visits have also been studied [21, 22]. These models are non-Markovian (and typically also non-stationary), requiring that the individual identifies and keeps record of its entire trajectory. While the propagator of these models [23], and some properties of relocation times [24], have been computed, characterizing the revisits complete statistics to each particular location remains an open problem.

Here we study a non-Markovian and non-stationary mechanistic model of animal mobility, explicitly incorporating both the tendency of an individual to return to previously visited locations (PR) and the tendency to explore new sites. Versions of this model have been used to model the mobility of humans [21] and monkeys [25], the latter suggesting that monkey movements are non-random due to the use of memory and visitation patterns driven by resource availability. We generalize the model by accounting for stochasticity, incorporating inter-specific variability in the population, and allowing for nonlinear PR [26]. We provide analytical solutions to this non-Markovian, non-stationary model that go well beyond previous mean-field results. In particular, we present several approaches to analytically find the (non-stationary) probability of having visited nn sites at time tt and study the statistics of how revisits are distributed through the available locations. Our approach, based on the WKB (Wentzel–Kramers–Brillouin) approximation, is thus useful to deal with explicitly time-dependent and non-stationary problems. Remarkably, by allowing for nonlinear PR we find a phase transition as a function of the strength of the PR, where above some threshold the most visited site dominates the dynamics, receiving practically all new visits. We suggest that this phase transition reflects a balance between the tendency to return to known sites and the will to explore new ones [19]. We further verify our predictions using simulations, and show that our theoretical results adequately describe the space use patterns and the revisitation dynamics of Egyptian fruit bats (Rousettus aegyptiacus) to fruit trees.

Model. Our model consists of two elements [21]: (i) exploration – with probability PnewP_{new} the animal visits a new site, and (ii) PR – with probability 1Pnew1-P_{new} the animal visits a previously visited site ii with probability Πi(mi)\Pi_{i}(m_{i}), where mim_{i} is the number of previous visits to site ii. Following empirical evidence in humans and animals [21, 25] we assume that

Pnew=qnβ,Πi(mi)=miαj=1nmjα.P_{new}=qn^{-\beta}\;\;,\;\;\;\;\Pi_{i}(m_{i})=\frac{m_{i}^{\alpha}}{\sum_{j=1}^{n}m_{j}^{\alpha}}. (1)

Here nn is the number of previously visited sites, and β>0\beta>0 and 0<q<10<q<1 control the animal’s tendency to visit new sites indicating a power-law decay controlled by conformity exponent β\beta. On the other hand, the PR exponent α>0\alpha>0, governs the tendency to return to a previously visited location. Furthermore, and without loss of generality, we order the sites by rank such that i=1i=1 is the most visited site with m1m_{1} visits. Notably, we assume that the number of available sites is always larger than the number of visited sites, and that no significant resource depletion within a site occurs.

Cumulative number of sites. The probability P(n,t)P(n,t) of having visited nn sites in t1t\gg 1 time steps follows

P(n,t)/t=q(n1)βP(n1,t)qnβP(n,t).\partial P(n,t)/\partial t=q(n-1)^{-\beta}P(n-1,t)-qn^{-\beta}P(n,t). (2)

Although this master equation is interpreted here in the context of movement between spatially distributed sites, it can equivalently describe a birth-death process of population of size nn, where the growth rate is proportional to nβn^{-\beta} 111Similar growth rates appear in self-inhibitory gene regulatory networks, where a protein inhibits its own growth, see e.g., Refs. [47, 48]. In particular, for β=0\beta=0 the birth-death process is 𝑞A\emptyset\xrightarrow{q}A and for β=1\beta=-1 the birth-death process is A𝑞2AA\xrightarrow{q}2A. While these special cases have known exact solutions, in this manuscript we are primarily interested in the regime β>0\beta>0, which describes a growth which decreases [or saturates, see Eq. (1)] with the number of sites (or with the population size). To the best of our knowledge this regime has not been analytically studied.

An equation for the first moment n=nnP(n,t)\left<n\right>=\sum_{n}nP(n,t) can be obtained from Eq. (2) by multiplying the latter by nn, summing over all nn’s, and using the definition for n\left<n\right>, resulting in dn/dt=qnβd\left<n\right>/dt=q\left<n^{-\beta}\right> which under the mean-field approximation nβnβ\left<n^{-\beta}\right>\simeq\left<n\right>^{-\beta} is solved by [21]

n=[(1+β)qt]1/(1+β),\left<n\right>=[(1+\beta)qt]^{1/(1+\beta)}, (3)

predicting a power-law dependence on the time of measurement. A similar derivation for the second moment yields n2=n2+n\left<n^{2}\right>=\left<n\right>^{2}+\left<n\right> such that the variance follows σn2n2n2=n\sigma_{n}^{2}\equiv\left<n^{2}\right>-\left<n\right>^{2}=\left<n\right>, i.e., the variance of the number of sites is equal to the mean as in a Poisson process. This result, however, turns out to be inaccurate as it involves various uncontrolled assumptions, and is not consistent with simulations, as elaborated below.

An exact solution to Eq. (2) can be found by Laplace transforming the equation and solving the resulting recurrence equation 222In the SI, Sec. S1.B we alternatively develop a a generating function approach, and Eq. (2) becomes a fractional integro-differential equation, which is solvable in specific cases.. The exact solution for β0\beta\neq 0 has the form [see Supplementary Information (SI) Sec. S1.A]

P(n,t)=(1)n1nβk=1nkβeqt/kβj=1,jkn(jβkβ1).P(n,t)=(-1)^{n-1}n^{\beta}\sum_{k=1}^{n}\frac{k^{-\beta}e^{-qt/k^{\beta}}}{\prod_{j=1,j\neq k}^{n}\left(\frac{j^{\beta}}{k^{\beta}}-1\right)}. (4)

For special values of β\beta this result simplifies to

P(n,t)={1(n1)!k=1n(nk)(1)nkkn1eqtkβ=11n!(qt)neqtβ=0enqt(eqt1)n1β=1.P(n,t)=\begin{cases}\frac{1}{(n-1)!}\sum_{k=1}^{n}\binom{n}{k}(\!-\!1)^{n-k}k^{n-1}e^{-\frac{qt}{k}}&\beta=1\\ \frac{1}{n!}(qt)^{n}e^{-qt}&\beta=0\\ e^{-nqt}\left(e^{qt}-1\right)^{n-1}&\beta=-1.\end{cases} (5)

Although Eq. (4) is an exact solution, it is given in form of a summation of large terms of alternating sign, which converges due to a precise balance between the terms. Thus, in practice this result is very slow to converge for n1n\gg 1 in any finite-size system (e.g., python, matlab, and mathematica) and may result in a significant lack of accuracy. Moreover, virtually any approximation made in calculating the individual terms may cause large errors for n1n\gg 1 [29]. To circumvent these issues, we develop a time-dependent WKB approximation.

Refer to caption
Figure 1: The probability P(n,t)P(n,t) for β=1\beta=1 and t=1500t=1500. (a) No variation in β\beta (σ=0\sigma=0). We compare simulations (circles), exact result [black dashed-dotted line, Eq. (4)], WKB approximation [red dashed line, Eq. (Phase transition in non-Markovian animal exploration model with preferential returns)], and WKB approximation at low energies [blue dashed line, Eq. (9)]. (b) Variability in β\beta with σ=0.1\sigma=0.1, compared to a numerical solution of Eq. (10) (dashed line). Insets show n\left<n\right> and σn2\sigma_{n}^{2} (red and black marks, respectively) versus tt, compared with theory (dashed lines).

Time dependent WKB. In the limit of a large number of sites n1n\gg 1 [30, 31, 32], we substitute the time-dependent ansatz P(n,t)e𝒮(n,t)P(n,t)\sim e^{-{\cal S}(n,t)} into Eq. (2). Neglecting terms of order 𝒪(n1)\mathcal{O}(n^{-1}) we obtain a classical Hamilton-Jacobi equation for the action function 𝒮(n,t){\cal S}(n,t): t𝒮=H(n,n𝒮)H(n,p)\mathcal{\partial}_{t}{\cal S}=H(n,\mathcal{\partial}_{n}{\cal S})\equiv H(n,p) where we have defined the Hamiltonian H(n,p)=q(1ep)nβ,H(n,p)=q\left(1-e^{-p}\right)n^{-\beta}, and denoted p=nSp=-\mathcal{\partial}_{n}S as the conjugate momentum. Instead of directly solving the Hamilton-Jacobi equations, we use the Hamilton approach for the classical equations of motion

n˙=qepnβ,p˙=βq(1ep)nβ1.\displaystyle\dot{n}=qe^{-p}n^{-\beta}\;,\;\;\;\dot{p}=\beta q\left(1-e^{-p}\right)n^{-\beta-1}. (6)

We write the action on a classical trajectory as  [31]:

S=Et0tpn˙𝑑t=Etnp(n)𝑑nS=Et-\int_{0}^{t}p\dot{n}dt=Et-\int^{n}p(n^{\prime})dn^{\prime} (7)

where the energy EH[n(t),p(t)]E\equiv H[n(t),p(t)] is constant along a dynamical trajectory given by p(n)=log[q/(qEnβ)]p(n)=\log\left[q/(q-En^{\beta})\right]. To find the energy we solve the equation of motion (6) on a given dynamical trajectory on which the energy is constant. After some algebra (SI, Sec. S1.C) this yields

P(n,t)\displaystyle P(n,t) en𝒮(x),𝒮(x)=f(x)xββ+1\displaystyle\sim e^{-\left<n\right>\mathcal{S}(x)}\;,\;\;\;\mathcal{S}(x)=\frac{f(x)x^{-\beta}}{\beta+1}
+xf(x)1/βB[f(x);1+1/β,0]+xlog(1f(x)),\displaystyle+xf(x)^{-1/\beta}B\left[f(x);1+1/\beta,0\right]+x\log(1-f(x)),

with xn/nx\equiv n/\left<n\right> and f(x)=1xβ(β(x1)+x)f(x)=1-x^{\beta}(\beta(x-1)+x). Here, B(z;a,b)=0zua1(1u)b1𝑑uB(z;a,b)=\int_{0}^{z}u^{a-1}(1-u)^{b-1}du is the incomplete beta function. This calculation of the probability of having visited n1n\gg 1 sites at time tt, is one of our main results. In the low energy limit, E1E\ll 1, S(x)S(x) becomes (SI)

𝒮(x)[(2β+1)x2β1(xβ+11)2]/[2(β+1)2],\mathcal{S}(x)\simeq\left[(2\beta+1)x^{-2\beta-1}\left(x^{\beta+1}-1\right)^{2}\right]/\left[2(\beta\!+\!1)^{2}\right]\!, (9)

which can be shown to solve the Hamilton-Jacobi equation in the limit |x1|1|x-1|\ll 1. In Fig. 1a we find good agreement between the exact result for the PDF [Eq. (4)], time-dependent WKB approximation [Eqs. (Phase transition in non-Markovian animal exploration model with preferential returns,9)], and simulations (see also Fig. S1 in the SI). Here the exact result and WKB approximation are practically indistinguishable, whereas the low energy approximation predicts the PDF well only in its Gaussian vicinity. Notably, for n1n\gg 1 the accuracy of the exact result rapidly deteriorates due to summation of (alternating) very large terms and accumulation of errors, making the time-dependent WKB approach highly advantageous in this case [29].

Equation (Phase transition in non-Markovian animal exploration model with preferential returns) predicts a different variance than that predicted by the mean-field approach above. The variance can be found by approximating 𝒮(x)\mathcal{S}(x) in the Gaussian vicinity of n=nn=\left<n\right>. Doing so, we find 𝒮(x)(β+1/2)(x1)2\mathcal{S}(x)\simeq\left(\beta+1/2\right)(x-1)^{2}, which yields a variance of σn2=n/|𝒮′′(x)|x=1=n/(1+2β)\sigma_{n}^{2}=\left<n\right>/|\mathcal{S}^{\prime\prime}(x)|_{x=1}=\left<n\right>/(1+2\beta). This entails that the distribution is narrower by a factor of (1+2β1+2\beta) than that predicted by the moment equations. In the inset of Fig. 1a both the average [Eq. (3)] and the variance of number of sites show good agreement with simulations.

To account for between-individual variation, we generalize our model by allowing different β\beta values acoss individuals. Assuming β\beta is sampled from a normal distribution 𝒩(β0,σ2)\mathcal{N}(\beta_{0},\sigma^{2}) with mean β0\beta_{0} and variance σ21\sigma^{2}\ll 1 (indicating the inter-individual variability in β\beta around β0\beta_{0}, see empirical results analysis below), Pn(t)P_{n}(t) satisfies

P(n,t)=12πσ2Pβ(n,t)e(ββ0)22σ2𝑑β,P(n,t)=\frac{1}{\sqrt{2\pi\sigma^{2}}}\int_{-\infty}^{\infty}P_{\beta}(n,t)e^{-\frac{(\beta-\beta_{0})^{2}}{2\sigma^{2}}}d\beta, (10)

where Pβ(n,t)P_{\beta}(n,t) is the probability for a given β\beta, see e.g., Eq. (Phase transition in non-Markovian animal exploration model with preferential returns). Although analytical progress is possible in the limit of σ1\sigma\!\ll\!1 (SI, Sec. S1.D), Eq. (10) can generally be solved numerically (Fig. 1b). Notably, we checked that while variability in a population (σ>0\sigma\!>\!0) will not significantly affect the mean number of sites, it dramatically affects the variability across a population (SI, Fig. S2).


Statistics of number of visits to a site. Having computed the statistics of number of sites, we now turn to study the probability Wi(mi,t)W_{i}(m_{i},t) of having mim_{i} visits at time tt to an already visited site ii, which follows

Wit=(1Pnew)[Πi(mi1)Wi(mi1,t)\displaystyle\frac{\partial W_{i}}{\partial t}=(1-P_{new})\left[\Pi_{i}(m_{i}-1)W_{i}(m_{i}-1,t)\right.
Πi(mi)Wi(mi,t)],\displaystyle\left.-\Pi_{i}(m_{i})W_{i}(m_{i},t)\right], (11)

where PnewP_{new} and Πi\Pi_{i} are given by Eq. (1). In general, Πi\Pi_{i} depends on the number of visits to other sites, such that Eq. (Phase transition in non-Markovian animal exploration model with preferential returns) couples between different sites. Below, we focus on the limit t1t\gg 1, where Pnew0P_{new}\!\to\!0 (SI, Sec. S2).

Refer to caption
Figure 2: (a) The average frequency of visits to the most visited site f1f_{1} versus α\alpha, for β=1\beta=1 (simulations). Each curve corresponds to a given number of visits tt (see legend). (b) fkf_{k} for different sites (see legend) for β=1\beta=1 and t=105t=10^{5}.

The case of α=1\alpha=1. In the limit t1t\gg 1 we have imi=t\sum_{i}m_{i}=t, namely, the total number of visits to all sites equals the total number of time steps tt. Thus, Πi(mi)=mi/t\Pi_{i}(m_{i})=m_{i}/t and Pnew=0P_{new}=0 333Here, Eq. (Phase transition in non-Markovian animal exploration model with preferential returns) is similar to the master equation in Ref. [22]. However, they only consider the case of β=0\beta=0.. Equation (Phase transition in non-Markovian animal exploration model with preferential returns) is then solved by Wi(mi,t)=titmi(tti),mi1W_{i}(m_{i},t)=t_{i}t^{-m_{i}}\left(t-t_{i}\right){}^{m_{i}-1}, where tit_{i} is defined as the first time site ii is visited, mi(t=ti)=1m_{i}(t=t_{i})=1. The average is then mi=t/ti\left<m_{i}\right>=t/t_{i}, while the variance σmi2=mi2mi2=t(tti)/ti2t2\sigma_{m_{i}}^{2}=\left<m_{i}^{2}\right>-\left<m_{i}\right>^{2}=t\left(t-t_{i}\right)/t_{i}^{2}\sim t^{2}.

The case of α1\alpha\neq 1. Here, we a priori assume that j=1nmjαtξ\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>^{\alpha}\sim t^{\xi}, where ξ\xi is a priori unknown and satisfies α<ξ<1\alpha<\xi<1 (see SI, Sec. S2.A for proof). The average number of visits to any site ii can then be shown to asymptotically follow mit(1ξ)/(1α)[1+𝒪(tξ1)]\left<m_{i}\right>\sim t^{(1-\xi)/(1-\alpha)}[1+\mathcal{O}(t^{\xi-1})]. Plugging this back into the sum over mjα\left<m_{j}\right>^{\alpha} we find that ξ=ξ0(1+ϵ)\xi=\xi_{0}(1+\epsilon), where ξ0=(1+αβ)/(1+β)\xi_{0}=(1+\alpha\beta)/(1+\beta) and ϵ1\epsilon\ll 1 is an unknown function of α,β\alpha,\beta (Fig. S3). For 1αϵ1-\alpha\ll\epsilon [β=𝒪(1)\beta=\mathcal{O}(1)], we further find mitβ/(1+β)\left<m_{i}\right>\sim t^{\beta/(1+\beta)}, which is independent of α\alpha; yet, the condition 1αϵ1-\alpha\ll\epsilon breaks down as α\alpha approaches 1 (SI, Sec. S2.B and Fig. S4). Importantly, in the limit t1t\gg 1, for any α<1\alpha<1 we find that all sites scale similarly with time. In contrast, for α>1\alpha>1 not all site scale similarly with time. Here we find mit\left<m_{i}\right>\simeq t for i=1i=1, while miCi[1+𝒪(t1α)]\left<m_{i}\right>\simeq C_{i}[1+\mathcal{O}(t^{1-\alpha})] for i>1i>1, where Ci=Ci(ti)C_{i}=C_{i}(t_{i}) is a constant (SI, Sec. S2.C).

Refer to caption
Figure 3: (a-b): The mean (blue marks) and variance (red marks) of number of sites visited by bats during summer and winter, compared to theoretical prediction (black dashed lines), with fitted values (a) β0=0.71,0.53\beta_{0}=0.71,0.53 and (b) σ=0.21,0.16\sigma=0.21,0.16, respectively. These are averaged over an ensemble of 38 (a) and 53 (b) bats. (c-d): The mean number of visits mi\left<m_{i}\right> to the six most visited sites, i=1,,6i=1,...,6 (different colors mark different sites), averaged over the same ensembles as in (a) and (b). Black dashed lines mit\left<m_{i}\right>\sim t correspond to the theoretical prediction for α=1\alpha=1. (e-f): Variance of number of visits σmi2\sigma_{m_{i}}^{2} to the same six sites, averaged over the same ensembles for summer (e) and winter (f). Black dashed lines σmi2t2\sigma_{m_{i}}^{2}\sim t^{2} correspond to the theoretical prediction for α=1\alpha=1.

These results reveal a phase transition at α=1\alpha=1 (see also SI, Sec. S2.D), where for weak PR (α<1\alpha<1) the frequency of visits to the most visited site f1m1/j=1nmjf_{1}\equiv\left<m_{1}\right>/\sum_{j=1}^{\left<n\right>}\left<m_{j}\right> is only a small fraction of the total number of visits, while for strong PR (α>1\alpha>1) f1f_{1} approaches 1 as tt is increased and site 1 dominates (Fig. 2a). Importantly, in addition to the phase transition for f1f_{1}, the next most visited sites (fkf_{k}, for k=2,3,k=2,3,...) peak around α=1\alpha=1 (Figs. 2b and S5). Here, as α\alpha approaches 0 the number of visits to all sites becomes similar, while for α>1\alpha>1 these visitation frequencies tend to zero.

Movement of fruit bats. To study the relevance of our model for real-life systems and to obtain insights into the phase transition, we compare our predictions to resource use patterns and visitation dynamics of wild fruit bats tracked by ATLAS during winter and summer 444To have proper statistics and ensure no significant resource depletion, we analyse 10-day periods for each bat. For details on the species, seasonality and the segmentation and fitting procedures, see SI Sec. S3 and [4]. For details on ATLAS see [49, 11]. In Fig. 3a-b we fit the mean and variance of the number of visited sites (fruit trees) as a function of the number of movement steps (defined here as distinguishable movement between trees, see SI) to our theory 555 Note that the power-law dependence for the mean has also been experimentally observed in humans [21] and monkeys [25]; however, these studies did not analyze fluctuations around n\langle n\rangle.. We find that during the summer β0\beta_{0} and σ\sigma are higher than during the winter, entailing lower rate of visits to new sites (higher levels of conformity) and larger inter-individual variability, respectively. Notably, many empirical studies have shown that individual preferences and decisions can affect movement and behavior, such that individuals do not have identical movement patterns [36, 37]. This may explain the inter-individual variability observed in both summer and winter. In Fig. 3c-f we show that during summer m1t0.97\left<m_{1}\right>\sim t^{0.97} and m2t0.99\left<m_{2}\right>\sim t^{0.99} (as well as σm12t1.94\sigma_{m_{1}}^{2}\sim t^{1.94} and σm22t2.16\sigma_{m_{2}}^{2}\sim t^{2.16}), which matches the theory for α=1\alpha=1. In contrast, during winter m1t0.89\left<m_{1}\right>\sim t^{0.89} and m2t0.87\left<m_{2}\right>\sim t^{0.87} (σm12t1.96\sigma_{m_{1}}^{2}\sim t^{1.96}, σm22t1.80\sigma_{m_{2}}^{2}\sim t^{1.80}), which is consistent with α\alpha values slightly below 1. These seasonal differences may be attributed to the fact that bats during the summer feed of highly abundant and palatable fruits – mulberries or figs with high levels of sugar content – and hence do not need to explore for feeding alternatives (high β0\beta_{0}) and can strongly rely on a limited number of sites (α=1\alpha=1). Similarly, when food is abundant it makes sense that most bats will forage on the same bountiful locations, as they are not constrained by intense resource competition, thus reducing inter-individual variability in behaviour. In contrast, during winter there is less motivation to return to less favorable fruits (chinaberries) and a higher motivation to explore alternative trees, such as non-seasonal (unpredictable) fruit from the Ficus family.

In light of the phase transition at α=1\alpha=1, and in agreement with experimental results, we hypothesize that in animal movement the value of α\alpha will tend towards 1. This maximizes the frequencies of visits to preferred sites (Fig. 2b), yet avoids an exclusive choice of a preferred site which occurs at α>1\alpha>1 (see Fig. 2a). In this manner the animal combines intensive search patterns (committing to few site) with extensive searches (returning to all sites with some probability), a balance which is essential to optimize between energy expenditure and risk management [38, 39, 19]. Indeed, for fruit bats we find α1\alpha\approx 1, and similar results were obtained for humans [21] and monkeys [25]. Furthermore, the strategy of avoiding an exclusive site resembles bet-hedging strategies, e.g., bacterial persistence [40]. In addition, the value of α\alpha may be correlated to the total number of known sites: for large β0\beta_{0} (few sites, summer) the bats will show stronger PR, while for smaller β0\beta_{0} (more sites, winter) the strategy may tend towards a more uniform visitation rate to all trees.

More generally, we expect our results to also provide key insights into revisit dynamics in other areas like human mobility [41, 42, 43], COVID-19 spread [44], human migration [45] and languages dynamics [46].

Acknowledgements

OV and MA were supported by the Israel Science Foundation Grant No. 531/20. MA was also supported by the Humboldt Research Fellowship for Experienced Researchers of the Alexander von Humboldt Foundation. Fieldwork with ATLAS was funded by the Minerva Foundation, the Minerva Center for Movement Ecology, and grants ISF-1259/09, ISF-965/15 and GIF 1316/15 to RN. Finally, we thank Yoav Bartan, Anat Levi, David Shohami and other members of the Minerva Center for Movement Ecology for their valuable help with fieldwork.

References

  • Nathan et al. [2008] R. Nathan, W. M. Getz, E. Revilla, M. Holyoak, R. Kadmon, D. Saltz, and P. E. Smouse, A movement ecology paradigm for unifying organismal movement research, Proceedings of the National Academy of Sciences 105, 19052 (2008).
  • Grimm and Railsback [2005] V. Grimm and S. F. Railsback, Individual-based modeling and ecology, Vol. 8 (Princeton University Press, 2005).
  • Metzler et al. [2014] R. Metzler, J.-H. Jeon, A. G. Cherstvy, and E. Barkai, Anomalous diffusion models and their properties: non-stationarity, non-ergodicity, and ageing at the centenary of single particle tracking, Physical Chemistry Chemical Physics 16, 24128 (2014).
  • Lourie et al. [2021] E. Lourie, I. Schiffner, S. Toledo, and R. Nathan, Memory and conformity, but not competition, explain spatial partitioning between two neighboring fruit bat colonies, Frontiers in Ecology and Evolution , 711 (2021).
  • Gurarie et al. [2016] E. Gurarie, C. Bracis, M. Delgado, T. D. Meckley, I. Kojola, and C. M. Wagner, What is the animal doing? tools for exploring behavioural structure in animal movements, Journal of Animal Ecology 85, 69 (2016).
  • Fagan et al. [2013] W. F. Fagan, M. A. Lewis, M. Auger-Méthé, T. Avgar, S. Benhamou, G. Breed, L. LaDage, U. E. Schlägel, W.-w. Tang, Y. P. Papastamatiou, et al., Spatial memory and animal movement, Ecology letters 16, 1316 (2013).
  • Bracis et al. [2015] C. Bracis, E. Gurarie, B. V. Moorter, and R. A. Goodwin, Memory effects on movement behavior in animal foraging, PLOS ONE 10, e0136057 (2015).
  • Polansky et al. [2015] L. Polansky, W. Kilian, and G. Wittemyer, Elucidating the significance of spatial memory on movement decisions by african savannah elephants using state–space models, Proceedings of the Royal Society B: Biological Sciences 282, 20143042 (2015).
  • Ranc et al. [2021] N. Ranc, P. R. Moorcroft, F. Ossi, and F. Cagnacci, Experimental evidence of memory-based foraging decisions in a large wild mammal, Proceedings of the National Academy of Sciences 118 (2021).
  • Goldshtein et al. [2020] A. Goldshtein, M. Handel, O. Eitan, A. Bonstein, T. Shaler, S. Collet, S. Greif, R. A. Medellín, Y. Emek, A. Korman, et al., Reinforcement learning enables resource partitioning in foraging bats, Current Biology 30, 4096 (2020).
  • Toledo et al. [2020] S. Toledo, D. Shohami, I. Schiffner, E. Lourie, Y. Orchan, Y. Bartan, and R. Nathan, Cognitive map–based navigation in wild bats revealed by a new high-throughput tracking system, Science 369, 188 (2020).
  • Krochmal et al. [2021] A. R. Krochmal, T. C. Roth, and N. T. Simmons, My way is the highway: the role of plasticity in learning complex migration routes, Animal Behaviour 174, 161 (2021).
  • Morales et al. [2004] J. M. Morales, D. T. Haydon, J. Frair, K. E. Holsinger, and J. M. Fryxell, Extracting more out of relocation data: building movement models as mixtures of random walks, Ecology 85, 2436 (2004).
  • Patterson et al. [2008] T. Patterson, L. Thomas, C. Wilcox, O. Ovaskainen, and J. Matthiopoulos, State-space models of individual animal movement, Trends in Ecology & Evolution 23, 87 (2008).
  • Riotte-Lambert et al. [2015] L. Riotte-Lambert, S. Benhamou, and S. Chamaillé-Jammes, How memory-based movement leads to nonterritorial spatial segregation, The American Naturalist 185, E103 (2015).
  • Hod and Keshet [2004] S. Hod and U. Keshet, Phase transition in random walks with long-range correlations, Physical Review E 70, 015104 (2004).
  • Schütz and Trimper [2004] G. M. Schütz and S. Trimper, Elephants can always remember: Exact long-range memory effects in a non-markovian random walk, Physical Review E 70, 045101 (2004).
  • Evans and Majumdar [2011] M. R. Evans and S. N. Majumdar, Diffusion with stochastic resetting, Physical Review Letters 106, 160601 (2011).
  • Berger-Tal and Bar-David [2015] O. Berger-Tal and S. Bar-David, Recursive movement patterns: review and synthesis across species, Ecosphere 6, 1 (2015).
  • Evans et al. [2020] M. R. Evans, S. N. Majumdar, and G. Schehr, Stochastic resetting and applications, Journal of Physics A: Mathematical and Theoretical 53, 193001 (2020).
  • Song et al. [2010] C. Song, T. Koren, P. Wang, and A.-L. Barabási, Modelling the scaling properties of human mobility, Nature Physics 6, 818 (2010).
  • Boyer and Solis-Salas [2014] D. Boyer and C. Solis-Salas, Random walks with preferential relocations to places visited in the past and their application to biology, Physical Review Letters 112, 240601 (2014).
  • Boyer and Romo-Cruz [2014] D. Boyer and J. C. R. Romo-Cruz, Solvable random-walk model with memory and its relations with markovian models of anomalous diffusion, Physical Review E 90, 042136 (2014).
  • Campos and Méndez [2019] D. Campos and V. Méndez, Recurrence time correlations in random walks with preferential relocation to visited places, Physical Review E 99, 062137 (2019).
  • Boyer et al. [2012] D. Boyer, M. C. Crofoot, and P. D. Walsh, Non-random walks in monkeys and humans, Journal of The Royal Society Interface 9, 842 (2012).
  • Krapivsky et al. [2000] P. L. Krapivsky, S. Redner, and F. Leyvraz, Connectivity of growing random networks, Physical review letters 85, 4629 (2000).
  • Note [1] Similar growth rates appear in self-inhibitory gene regulatory networks, where a protein inhibits its own growth, see e.g., Refs. [47, 48].
  • Note [2] In the SI, Sec. S1.B we alternatively develop a a generating function approach, and Eq. (2\@@italiccorr) becomes a fractional integro-differential equation, which is solvable in specific cases.
  • Assaf and Meerson [2006] M. Assaf and B. Meerson, Spectral formulation and wkb approximation for rare-event statistics in reaction systems, Physical Review E 74, 041115 (2006).
  • Dykman et al. [1994] M. I. Dykman, E. Mori, J. Ross, and P. Hunt, Large fluctuations and optimal paths in chemical kinetics, The Journal of chemical physics 100, 5735 (1994).
  • Elgart and Kamenev [2004] V. Elgart and A. Kamenev, Rare event statistics in reaction-diffusion systems, Physical Review E 70, 041106 (2004).
  • Assaf and Meerson [2017] M. Assaf and B. Meerson, Wkb theory of large deviations in stochastic populations, Journal of Physics A: Mathematical and Theoretical 50, 263001 (2017).
  • Note [3] Here, Eq. (Phase transition in non-Markovian animal exploration model with preferential returns\@@italiccorr) is similar to the master equation in Ref. [22]. However, they only consider the case of β=0\beta=0.
  • Note [4] To have proper statistics and ensure no significant resource depletion, we analyse 10-day periods for each bat. For details on the species, seasonality and the segmentation and fitting procedures, see SI Sec. S3 and [4]. For details on ATLAS see [49, 11].
  • Note [5] Note that the power-law dependence for the mean has also been experimentally observed in humans [21] and monkeys [25]; however, these studies did not analyze fluctuations around n\langle n\rangle.
  • Dingemanse et al. [2002] N. J. Dingemanse, C. Both, P. J. Drent, K. Van Oers, and A. J. Van Noordwijk, Repeatability and heritability of exploratory behaviour in great tits from the wild, Animal Behaviour 64, 929 (2002).
  • Dingemanse and Dochtermann [2013] N. J. Dingemanse and N. A. Dochtermann, Quantifying individual variation in behaviour: mixed-effect modelling approaches, Journal of Animal Ecology 82, 39 (2013).
  • Bartumeus et al. [2014] F. Bartumeus, E. P. Raposo, G. M. Viswanathan, and M. G. E. da Luz, Stochastic optimal foraging: Tuning intensive and extensive dynamics in random searches, PloS ONE 9 (2014).
  • Nolting et al. [2015] B. C. Nolting, T. M. Hinkelman, C. E. Brassil, and B. Tenhumberg, Composite random search strategies based on non-directional sensory cues, Ecological Complexity 22, 126 (2015).
  • Balaban et al. [2004] N. Q. Balaban, J. Merrin, R. Chait, L. Kowalik, and S. Leibler, Bacterial persistence as a phenotypic switch, Science 305, 1622 (2004).
  • Schlosser and Brockmann [2021] F. Schlosser and D. Brockmann, Finding disease outbreak locations from human mobility data, EPJ data science 10, 52 (2021).
  • do Couto Teixeira et al. [2021] D. do Couto Teixeira, J. M. Almeida, and A. C. Viana, On estimating the predictability of human mobility: the role of routine, EPJ Data Science 10, 49 (2021).
  • Schläpfer et al. [2021] M. Schläpfer, L. Dong, K. O’Keeffe, P. Santi, M. Szell, H. Salat, S. Anklesaria, M. Vazifeh, C. Ratti, and G. B. West, The universal visitation law of human mobility, Nature 593, 522 (2021).
  • Galeazzi et al. [2021] A. Galeazzi, M. Cinelli, G. Bonaccorsi, F. Pierri, A. L. Schmidt, A. Scala, F. Pammolli, and W. Quattrociocchi, Human mobility in response to covid-19 in France, Italy and UK, Scientific Reports 11, 1 (2021).
  • Chi et al. [2020] G. Chi, F. Lin, G. Chi, and J. Blumenstock, A general approach to detecting migration events in digital trace data, PloS ONE 15, e0239408 (2020).
  • Watanabe [2018] H. Watanabe, Empirical observations of ultraslow diffusion driven by the fractional dynamics in languages, Physical Review E 98 (2018).
  • Dublanche et al. [2006] Y. Dublanche, K. Michalodimitrakis, N. Kümmerer, M. Foglierini, and L. Serrano, Noise in transcription negative feedback loops: simulation and experimental analysis, Molecular Systems Biology 2, 41 (2006).
  • Roberts et al. [2015] E. Roberts, S. Be’er, C. Bohrer, R. Sharma, and M. Assaf, Dynamics of simple gene-network motifs subject to extrinsic fluctuations, Physical Review E 92, 062717 (2015).
  • Weiser et al. [2016] A. W. Weiser, Y. Orchan, R. Nathan, M. Charter, A. J. Weiss, and S. Toledo, Characterizing the accuracy of a self-synchronized reverse-gps wildlife localization system, in 2016 15th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) (IEEE, 2016) pp. 1–12.
  • Abramowitz and Stegun [1964] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, ninth dover printing, tenth gpo printing ed. (Dover, New York, 1964).
  • Gardiner [2009] C. Gardiner, Stochastic methods, Vol. 4 (Springer Berlin, 2009).
  • Arfken and Weber [1999] G. B. Arfken and H. J. Weber, Mathematical methods for physicists (1999).
  • Kwiecinski and Griffiths [1999] G. G. Kwiecinski and T. A. Griffiths, Rousettus egyptiacus, Mammalian Species , 1 (1999).
  • Egert-Berg et al. [2018] K. Egert-Berg, E. R. Hurme, S. Greif, A. Goldstein, L. Harten, J. J. Flores-Martínez, A. T. Valdés, D. S. Johnston, O. Eitan, I. Borissov, et al., Resource ephemerality drives social foraging in bats, Current Biology 28, 3667 (2018).
  • Gupte et al. [2020] P. R. Gupte, C. E. Beardsworth, O. Spiegel, E. Lourie, S. Toledo, R. Nathan, and A. I. Bijleveld, A guide to pre-processing high-throughput animal tracking data, bioRxiv  (2020).

Supplementary Information: Phase transition in non-Markovian animal exploration model with preferential returns

Here we provide additional details and results to support the derivations presented in the main text. Below, the notations and acronyms are the same as in the main text and the equations and figures refer to those therein.

S1 Cumulative number of sites

In this section we detail the exact solution and the WKB approximation to Eq. (2) of the main text

dP(n,t)dt=q(n1)βP(n1,t)qnβP(n,t).\frac{dP(n,t)}{dt}=q(n-1)^{-\beta}P(n-1,t)-qn^{-\beta}P(n,t). (S1)

S1.1 Solution by Laplace transform

Here we derive Eqs. (4) and (5) of the main text by Laplace transforming Eq. (S1) and solving the resulting recurrence equation. First we define J(n,t)=qP(n,t)/nβJ(n,t)=qP(n,t)/n^{\beta}, which turns Eq. (S1) into:

nβqdJ(n,t)dt=J(n1,t)J(n,t).\frac{n^{\beta}}{q}\frac{dJ(n,t)}{dt}=J(n-1,t)-J(n,t). (S2)

Transforming (S2) by Laplace in time and considering the initial condition P(n,t=0)=δn,1P(n,t=0)=\delta_{n,1}, where δa,b\delta_{a,b} is the Kronecker delta, we obtain the recurrence equation

J^(n,s)=11+snβqJ^(n1,s)+11+snβqδn,1,\hat{J}(n,s)=\frac{1}{1+\frac{sn^{\beta}}{q}}\hat{J}(n-1,s)+\frac{1}{1+\frac{sn^{\beta}}{q}}\delta_{n,1}, (S3)

where ss is the Laplace variable and J^(n,s)\hat{J}(n,s) stands for the Laplace transform of J(n,t)J(n,t) defined as follows:

J^(n,s)=s[J(n,t)]=0estJ(n,t)𝑑t.\hat{J}(n,s)=\mathcal{L}_{s}\left[J(n,t)\right]=\int_{0}^{\infty}e^{-st}J(n,t)dt.

Multiplying (S3) by j=0n(1+sjβq)\prod_{j=0}^{n}\left(1+\frac{sj^{\beta}}{q}\right) it has the form

A(n,s)=A(n1,s)+δn,1j=0n1(1+sjβq),A(n,s)=A(n-1,s)+\delta_{n,1}\prod_{j=0}^{n-1}\left(1+\frac{sj^{\beta}}{q}\right), (S4)

where A(n,s)=J^(n,s)j=0n(1+sjβq)A(n,s)=\hat{J}(n,s)\prod_{j=0}^{n}\left(1+\frac{sj^{\beta}}{q}\right) has been introduced. Since P(n0,t)=0P(n\leq 0,t)=0 one has A(0,s)=0A(0,s)=0 and using (S4), A(n1,s)=1A(n\geq 1,s)=1. Inserting this result into (S3) the solution to the master equation in the Laplace domain reads

P^(n,s)=nβqj=0n(1+sjβq)=qn1[(n1)!]β1j=1n(s+qjβ).\hat{P}(n,s)=\frac{n^{\beta}}{q\prod_{j=0}^{n}\left(1+\frac{sj^{\beta}}{q}\right)}=\frac{q^{n-1}}{[(n-1)!]^{\beta}}\frac{1}{\prod_{j=1}^{n}\left(s+\frac{q}{j^{\beta}}\right)}. (S5)

Now we need to invert (S5) by Laplace. To do this we use the Heaviside expansion theorem [50]

t1[1f(s)]=k=1neaktf(s=ak),f(s)=j=1n(s+aj),\mathcal{L}_{t}^{-1}\left[\frac{1}{f(s)}\right]=\sum_{k=1}^{n}\frac{e^{-a_{k}t}}{f^{\prime}(s=-a_{k})},\qquad f(s)=\prod_{j=1}^{n}(s+a_{j}), (S6)

where the prime symbol stands for the derivative with respect to ss. Making use of the property

f(s=ak)=j=1,jkn(ajak),f^{\prime}(s=a_{k})=\prod_{j=1,j\neq k}^{n}(a_{j}-a_{k}),

and (S6), one readily obtains for any β0\beta\neq 0

t1[1j=1n(s+qjβ)]=k=1neqt/kβj=1,jkn(qjβqkβ)=(1)n1(n!)βq1nk=1nkβeqt/kβj=1,jkn(jβkβ1).\displaystyle\mathcal{L}_{t}^{-1}\left[\frac{1}{\prod_{j=1}^{n}\left(s+\frac{q}{j^{\beta}}\right)}\right]=\sum_{k=1}^{n}\frac{e^{-qt/k^{\beta}}}{\prod_{j=1,j\neq k}^{n}\left(\frac{q}{j^{\beta}}-\frac{q}{k^{\beta}}\right)}=(-1)^{n-1}(n!)^{\beta}q^{1-n}\sum_{k=1}^{n}\frac{k^{-\beta}e^{-qt/k^{\beta}}}{\prod_{j=1,j\neq k}^{n}\left(\frac{j^{\beta}}{k^{\beta}}-1\right)}. (S7)

Finally, plugging (S7) into (S5) the exact solution for β0\beta\neq 0 has the form

P(n,t)=(1)n1nβk=1nkβeqt/kβj=1,jkn(jβkβ1),P(n,t)=(-1)^{n-1}n^{\beta}\sum_{k=1}^{n}\frac{k^{-\beta}e^{-qt/k^{\beta}}}{\prod_{j=1,j\neq k}^{n}\left(\frac{j^{\beta}}{k^{\beta}}-1\right)}, (S8)

which is Eq. (4) of the main text, and is valid for any β0\beta\neq 0. For β=0\beta=0, Eq. (S5) reduces to

P^(n,s)=1q(1+sq)n+1,\hat{P}(n,s)=\frac{1}{q\left(1+\frac{s}{q}\right)^{n+1}},

which after inversion by Laplace coincides with Eq. (5) of the main text

P(n,t)=(qt)nn!eqt.P(n,t)=\frac{(qt)^{n}}{n!}e^{-qt}. (S9)

S1.2 Solution by generating function

In some special cases it is more convenient to solve Eq. (S1) using the generating function approach. Particularly, in the limit of a large number of sites, the equation in the generating function domain becomes a fractional integro-differential equation for 0<β10<\beta\leq 1, see below.

We define the generating function G(z,t)=nznP(n,t)G(z,t)=\sum_{n}z^{n}P(n,t), such that

P(n,t)=1n!nG(z,t)zn|z=0,P(n,t)=\frac{1}{n!}\frac{\mathcal{\partial}^{n}G(z,t)}{\mathcal{\partial}z^{n}}|_{z=0}, (S10)

with initial condition P(n,0)=δn,1G(n,0)=zP(n,0)=\delta_{n,1}\Rightarrow G(n,0)=z. Substituting Eq. (S1) into the definition of G(n,t)G(n,t) yields

Gt\displaystyle\frac{\partial G}{\partial t} =qn[zn(n1)βP(n1,t)znnβP(n,t)]=q(z1)nznnβP(n,t)\displaystyle=q\sum_{n}\left[z^{n}(n-1)^{-\beta}P(n-1,t)-z^{n}n^{-\beta}P(n,t)\right]=q(z-1)\sum_{n}z^{n}n^{-\beta}P(n,t) (S11)
q(z1)nDzβznβP(n,t)=q(z1)Dzβ[zβG(z,t)],\displaystyle\simeq q(z-1)\sum_{n}D^{-\beta}_{z}z^{n-\beta}P(n,t)=q(z-1)D^{-\beta}_{z}\left[z^{-\beta}G(z,t)\right],

where DzβD^{-\beta}_{z} is the Riemann-Liouville fractional integral defined by Dzβaf(z)=1Γ(β)az(zξ)β1f(ξ)𝑑ξ{}_{a}D^{-\beta}_{z}f(z)=\frac{1}{\Gamma(\beta)}\int_{a}^{z}(z-\xi)^{\beta-1}f(\xi)d\xi, and we used the following relations

Dzβznβ=znΓ(nβ+1)Γ(n+1)=znnβ[1+𝒪(1/n)].D^{-\beta}_{z}z^{n-\beta}=z^{n}\frac{\Gamma(n-\beta+1)}{\Gamma(n+1)}=z^{n}n^{-\beta}[1+\mathcal{O}(1/n)]. (S12)

Here, the equality on the left is valid for β1\beta\leq 1 while the approximation on the right holds for n1n\gg 1 and is exact in the special cases of β=0,1\beta=0,1. Notably, for β<0\beta<0, i.e., when the growth rate increases in nn, Eq. (S11) is a fractional differential equation for GG, while for β>0\beta>0, i.e., when the growth rate decreases in nn, it is a fractional integro-differential equation. Although Eq. (S11) is hard to solve analytically for general β\beta, and the direct method presented above is more suited, it can be solved for β=1,0,1\beta=-1,0,1.

S1.2.1 Solution for β=0\beta=0

For β=0\beta=0, Eq. (S11) simplifies to tG(z,t)=q(z1)G(z,t)\mathcal{\partial}_{t}G(z,t)=q(z-1)G(z,t) and is accordingly solved by G(z,t)=zeqt(1z)G(z,t)=ze^{-qt(1-z)}. Using Eq. (S10) we find that P(n,t)P(n,t) follows a Poisson distribution (S9). In particular, in this case we have n=σn2=qt\left<n\right>=\sigma_{n}^{2}=qt.

S1.2.2 Solution for β=1\beta=-1

For β=1\beta=-1 a similar derivation to Eq. (S11) yields a partial differential equation for the generating function: tG(z,t)=q(z1)zz[G(z,t)]\mathcal{\partial}_{t}G(z,t)=q(z-1)z\mathcal{\partial}_{z}[G(z,t)], whose solution is G(z,t)=z/[z+eqt(1z)]G(z,t)=z/[z+e^{qt}(1-z)] [51]. Using Eq. (S10) we find

P(n,t)=enqt(eqt1)n1.P(n,t)=e^{-nqt}\left(e^{qt}-1\right)^{n-1}. (S13)

The average number of sites here is n=eqt\left<n\right>=e^{qt}, i.e., we find exponential growth, as expected for a growth rate that is linear in nn. Here, the variance is σn2=eqt(eqt1)e2qt=n2\sigma_{n}^{2}=e^{qt}\left(e^{qt}-1\right)\simeq e^{2qt}=\left<n\right>^{2}, which is significantly broader than that of the Poisson distribution. This result also agrees with Eq. (5) of the main text.

S1.2.3 Solution for β=1\beta=1

For β=1\beta=1, Eq. (S11) is rewritten in explicit integro-differential form:

Gt=q(z1)0zy1G(y,t)𝑑y.\frac{\partial G}{\partial t}=q(z-1)\int_{0}^{z}y^{-1}G(y,t)dy. (S14)

Here, we Laplace transform Eq. (S14) in time

uG(z,u)=z+q(z1)0zy1G(y,u)𝑑y,uG(z,u)=z+q(z-1)\int_{0}^{z}y^{-1}G(y,u)dy, (S15)

to obtain an integral equation. This equation can be solved iteratively by the Neumann series method [52] to give:

G(z,u)=1u[(z1)eqzu(qzu)quγ(p+uu,qzu)+z],G(z,u)=\frac{1}{u}\left[(z-1)e^{\frac{qz}{u}}\left(\frac{qz}{u}\right)^{-\frac{q}{u}}\gamma\left(\frac{p+u}{u},\frac{qz}{u}\right)+z\right], (S16)

where γ(a,b)\gamma(a,b) is the lower gamma function. Using Eq. (S10) we can inverse Laplace transform Eq. (S16) to obtain

P(n,t)=1(n1)!k=1n(1)nkkn1(nk)eqtk,P(n,t)=\frac{1}{(n-1)!}\sum_{k=1}^{n}(-1)^{n-k}k^{n-1}\binom{n}{k}e^{-\frac{qt}{k}}, (S17)

in agreement with Eq. (5) of the main text.

S1.3 Time dependent WKB approximation

Here we derive Eqs. (8) and (9) of the main text. We employ the time-dependent WKB approximation in the limit of a large number of sites n1n\gg 1 [31, 32]. Substituting the time-dependent ansatz P(n,t)eS(n,t)P(n,t)\sim e^{-S(n,t)} into Eq. (S1) and neglecting terms of order 𝒪(n1)\mathcal{O}(n^{-1}) we obtain a classical Hamilton-Jacobi equation for the action function S(n,t)S(n,t):

St=H(n,Sn)H(n,p),H(n,p)=q(1ep)nβ,\frac{\partial S}{\partial t}=H(n,\frac{\partial S}{\partial n})\equiv H(n,p)\,,\;\;\;\;\;\;\;H(n,p)=q\left(1-e^{-p}\right)n^{-\beta}, (S18)

where HH is the Hamiltonian and p=nSp=-\mathcal{\partial}_{n}S is the conjugate momentum. Instead of directly solving the Hamilton-Jacobi equations, we use the Hamilton approach for the classical equations of motion [Eq. (6)]

n˙=qepnβ,p˙=βq(1ep)nβ1.\displaystyle\dot{n}=qe^{-p}n^{-\beta}\,,\;\;\;\;\;\dot{p}=\beta q\left(1-e^{-p}\right)n^{-\beta-1}. (S19)

We write the action on a classical trajectory as [31]:

S=Et0tpn˙𝑑t=Etnp(n)𝑑nS=Et-\int_{0}^{t}p\dot{n}dt=Et-\int^{n}p(n^{\prime})dn^{\prime} (S20)

where the energy EH[n(t),p(t)]E\equiv H[n(t),p(t)], is constant along a dynamical trajectory given by p(n)=log[q/(qEnβ)]p(n)=\log\left[q/(q-En^{\beta})\right]. To find the energy we solve the equation of motion (S19) on this given dynamical trajectory, which yields

n˙=qnβE.\dot{n}=qn^{-\beta}-E. (S21)

For n1n\gg 1 and β>0\beta>0 the right hand side of Eq. (S21) varies very slowly with time [𝒪(nβ)\mathcal{O}(n^{-\beta})] (as shown below, the energy EE also scales as nβn^{-\beta}), such that the solution for Eq. (S21) can be approximated as n=(qnβE)t+Cn=(qn^{-\beta}-E)t+C. Here, CC is a slowly-varying function of time, and includes constants such that the energy corresponding to the mean-field solution n=nn=\left<n\right> obeys E(n=n)=0E(n=\left<n\right>)=0 [31]. Having shown that nt1/(1+β)\left<n\right>\sim t^{1/(1+\beta)}, we find C=nβ/(1+β)C=\left<n\right>\beta/(1+\beta), which indeed varies with time slower than tt. Substituting this back into the equation for nn and solving for the energy yields

E=qnβ{xβ+[β(β+1)x]}E=q\left<n\right>^{-\beta}\left\{x^{-\beta}+[\beta-(\beta+1)x]\right\} (S22)

where we have expressed tt in terms of n\left<n\right> and defined xn/nx\equiv n/\left<n\right>. Substituting the energy (S22) into Eq. (S20) and solving the integral yields

S(n,t)=n𝒮(x),𝒮(x)=f(x)xββ+1+xf(x)1/βB[f(x);1+1β,0]+xlog(1f(x))\displaystyle S(n,t)=\left<n\right>\mathcal{S}(x)\quad,\quad\quad\mathcal{S}(x)=\frac{f(x)x^{-\beta}}{\beta+1}+xf(x)^{-1/\beta}B\left[f(x);1+\frac{1}{\beta},0\right]+x\log(1-f(x)) (S23)

where B(z;a,b)B(z;a,b) is the incomplete beta function, defined as B(z;a,b)=0zua1(1u)b1𝑑uB(z;a,b)=\int_{0}^{z}u^{a-1}(1-u)^{b-1}du, and we define f(x)=1xβ(β(x1)+x)f(x)=1-x^{\beta}(\beta(x-1)+x). This result coincides with Eq. (8) of the main text and is valid in the limit of n1n\gg 1.

S1.3.1 Low energy solution

To get better insight for the Gaussian vicinity of Pn(t)P_{n}(t), we solve Eq. (S19) in the low energy limit E1E\ll 1. This yields an approximated solution for the energy in the form

Eqnβ(2β+1)x2β1(1xβ+1)β+1,E\simeq q\left<n\right>^{-\beta}\frac{(2\beta+1)x^{-2\beta-1}\left(1-x^{\beta+1}\right)}{\beta+1}, (S24)

where we have again expressed tt in terms of n\left<n\right>. Equation (S24) is indeed small in the limit |x1|1|x-1|\ll 1, which is the Gaussian vicinity of Pn(t)P_{n}(t). By further approximating the dynamical trajectory as p(n)Enβ/q+E2n2β/(2q2)p(n)\simeq En^{\beta}/q+E^{2}n^{2\beta}/(2q^{2}), we substitute this back into Eq. (S20). Performing the integral and substituting Eq. (S24) yields the following action

𝒮(x)(2β+1)x2β1(xβ+11)22(β+1)2,\mathcal{S}(x)\simeq\frac{(2\beta+1)x^{-2\beta-1}\left(x^{\beta+1}-1\right)^{2}}{2(\beta+1)^{2}}, (S25)

which coincides with Eq. (9) of the main text. Equation (9) can be shown to solve Eq. (S18) in the limit |x1|1|x-1|\ll 1. In Fig. 1a and S1a we compare the WKB solutions to simulations. Notably, while in Fig. 1a (main text) we are able to plot the exact results, in Fig. S1, due to the larger values of nn, the exact result cannot be plotted with standard computational tools.

Refer to caption
Figure S1: The probability P(n,t)P(n,t) for β=0.5\beta=0.5 and t=1500t=1500. (a) No variation in β\beta (σ=0\sigma=0). We compare simulations (circles), WKB approximation [red dashed line, Eq. (Phase transition in non-Markovian animal exploration model with preferential returns)], and WKB approximation at low energies [blue dashed line, Eq. (9)]. (b) Variability in β\beta with σ=0.1\sigma=0.1, compared to a numerical solution of Eq. (10) (dashed line). In the insets of both panels are n\left<n\right> and σn2\sigma_{n}^{2} (red and black marks, respectively) as a function of tt, showing very good agreement with the theory (dashed lines).

S1.4 Individual variability

Here we analytically solve Eq. (10) of the main text in the limit of small variance σ\sigma. In the main text we write the probability of having visited nn sites at time tt as [Eq. (10)]

P(n,t)=12πσ2Pβ(n,t)e(ββ0)22σ2𝑑β,P(n,t)=\frac{1}{\sqrt{2\pi\sigma^{2}}}\int_{-\infty}^{\infty}P_{\beta}(n,t)e^{-\frac{(\beta-\beta_{0})^{2}}{2\sigma^{2}}}d\beta, (S26)

which can be numerically solved (Figs. 1b, S1b and S2). Analytical progress can only be made in limit of small variance, σ1/n0\sigma\ll 1/\sqrt{\left<n\right>_{0}}, where n0=[(1+β0)qt]1/(1+β0)\left<n\right>_{0}=[(1+\beta_{0})qt]^{1/(1+\beta_{0})} is the mean number of sites given β=β0\beta=\beta_{0}. For simplicity we focus on the small energy regime, yet similar calculations can be made with the full expression for the action [Eq. (Phase transition in non-Markovian animal exploration model with preferential returns)]. Substituting Eq. (9) into Eq. (S26) yields

P(n,t)12πσ2e(ββ0)22σ2n0𝒮β(n/n0)𝑑β,P(n,t)\sim\frac{1}{\sqrt{2\pi\sigma^{2}}}\int_{-\infty}^{\infty}e^{-\frac{(\beta-\beta_{0})^{2}}{2\sigma^{2}}-\left<n\right>_{0}\mathcal{S}_{\beta}(n/\left<n\right>_{0})}d\beta, (S27)

where 𝒮β(x)\mathcal{S}_{\beta}(x) is given by Eq. (9). This integral can be solved for σ1/n0\sigma\ll 1/\sqrt{\left<n\right>_{0}}, using the saddle point approximation, which yields

P(n,t)en0𝒮β0(n/n0)+n02σ2𝒮1(n/n0),P(n,t)\sim e^{-\left<n\right>_{0}\mathcal{S}_{\beta_{0}}(n/\left<n\right>_{0})+\left<n\right>_{0}^{2}\sigma^{2}\mathcal{S}_{1}(n/\left<n\right>_{0})}, (S28)

with

S1(x)=x4β02(xβ0+11)22(β0+1)6[β0(1+xβ0+1)(β0+1)(2β0+1)ln(n0x)+1]2.\displaystyle S_{1}(x)=\frac{x^{-4\beta_{0}-2}\left(x^{\beta_{0}+1}-1\right)^{2}}{2\left(\beta_{0}+1\right){}^{6}}\left[\beta_{0}(1+x^{\beta_{0}+1})-\left(\beta_{0}+1\right)\left(2\beta_{0}+1\right)\ln(\left<n\right>_{0}x)+1\right]^{2}. (S29)

Here, the mean number of sites obeys n=n0[1+𝒪(σ2)]\left<n\right>=\left<n\right>_{0}\left[1+\mathcal{O}(\sigma^{2})\right], whereas the variance obeys

σn=n0{12β0+1+n0σ2[(β0+1)ln(n0)1]2(β0+1)4+𝒪(n02σ4)}.\displaystyle\sigma_{n}=\left<n\right>_{0}\left\{\frac{1}{2\beta_{0}+1}+\left<n\right>_{0}\sigma^{2}\frac{\left[\left(\beta_{0}+1\right)\ln(\left<n\right>_{0})-1\right]^{2}}{\left(\beta_{0}+1\right){}^{4}}+\mathcal{O}(\left<n\right>_{0}^{2}\sigma^{4})\right\}. (S30)

Thus, while inter-individual variability will almost not affect the mean number of sites, it does significantly affect the variance of the number of sites (by a factor of n0\left<n\right>_{0} compared to that of the mean), see Fig. S2.

Refer to caption
Figure S2: The probability distribution of number of sites visited at time t=1000t=1000 for σ=0.01,0.05,0.1\sigma=0.01,0.05,0.1 (see legend), based on 15000 simulations, compared to Eq. (S27) (solid lines), where the integral is approximated numerically. Note that, the averages n\left<n\right> for each distribution, marked by vertical dashed lines, are only slightly affected by the change in σ\sigma.

S2 Statistics of number of visits to a site

Here we provide details on the mean-field equation for the mean number of sites. In particular we explicitly derive and solve this equation for all α\alpha values in the limit of t1t\gg 1, and provide evidence of a phase transition at α=1\alpha=1. Our starting point is Eq. (11) of the main text

Wit=(1Pnew)[Πi(mi1)Wi(mi1,t)Πi(mi)Wi(mi,t)],\displaystyle\frac{\partial W_{i}}{\partial t}=(1-P_{new})\left[\Pi_{i}(m_{i}-1)W_{i}(m_{i}-1,t)-\Pi_{i}(m_{i})W_{i}(m_{i},t)\right], (S31)

where PnewP_{new} and Πi\Pi_{i} are given by Eq. (1) in the main text.

S2.1 The case of α=1\alpha=1

In the main text we assumed that Pnew0P_{new}\to 0 and solved Eq. (S31). Here we provide a solution to the mean-field equation without neglecting PnewP_{new}. In mean field, we obtain an equation for the first moment mi\left<m_{i}\right> by multiplying Eq. (S31) by mim_{i} and summing over all mim_{i}. For α=1\alpha=1 this yields

mit\displaystyle\frac{\partial\left<m_{i}\right>}{\partial t} =(1Pnew)mi=1mij=1nmjWi(mi,t)mij=1nmj(1qnβ),\displaystyle=(1-P_{new})\sum_{m_{i}=1}^{\infty}\frac{m_{i}}{\sum_{j=1}^{n}m_{j}}W_{i}(m_{i},t)\simeq\frac{\left<m_{i}\right>}{\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>}(1-q\left<n\right>^{-\beta}), (S32)

where we a priori (to be checked a posteriori) assume that jmjmi\sum_{j}m_{j}\gg m_{i} for any site ii such that the denominator can be taken out of the sum over mim_{i}, and that j=1nmjj=1nmj\sum_{j=1}^{n}m_{j}\simeq\sum_{j=1}^{n}\left<m_{j}\right>. To find the value of j=1nmjQ\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>\equiv Q we sum over both sides of Eq. (S32) to obtain a differential equation for QQ: tQ=(1qnβ)\mathcal{\partial}_{t}Q=(1-q\left<n\right>^{-\beta}), an equation which is solved by Q=tnQ=t-\left<n\right>. Substituting this back into Eq. (S32) gives

dmidt=mitn(1qnβ),\frac{d\left<m_{i}\right>}{dt}=\frac{\left<m_{i}\right>}{t-\left<n\right>}(1-q\left<n\right>^{-\beta}), (S33)

which is solved, assuming site ii is first visited at time tit_{i} [i.e., with an initial condition mi(ti)=1\left<m_{i}\right>(t_{i})=1], by [21]

mi=tntintitti.\left<m_{i}\right>=\frac{t-\left<n\right>}{t_{i}-\left<n\right>_{t_{i}}}\simeq\frac{t}{t_{i}}\,. (S34)

Here nti\left<n\right>_{t_{i}} is the average number of sites at time tit_{i}, and on the right we approximated the solution for t1t\gg 1 and discarded terms of order 𝒪(t1/(1+β))\mathcal{O}(t^{1/(1+\beta)}). This final result agrees with the one found in the main text. Importantly, as all sites have a linear dependence on tt, we verify a posteriori that jmjmi\sum_{j}m_{j}\gg m_{i} for any site ii, as contribution from all visited sites will not diminish at long times.

Refer to caption
Figure S3: Comparison between the value of ξ\xi as obtained from 100 simulation of length t=105t=10^{5} (symbols) to the theoretical prediction (dashed lines). Plotted for β=0.5\beta=0.5 (blue crosses) and β=1\beta=1 (red triangles). In the inset we plot the relative error between the predicted value and the one obtained in simulations.

S2.2 The case of α<1\alpha<1

For α<1\alpha<1 we solve the mean-field equation at t1t\gg 1 such that Pnew0P_{new}\to 0,

mitmi=1miαj=1nmjαWi(mi,t)miαj=1nmjαmiαAtξ,\displaystyle\frac{\partial\left<m_{i}\right>}{\partial t}\simeq\sum_{m_{i}=1}^{\infty}\frac{m_{i}^{\alpha}}{\sum_{j=1}^{n}m_{j}^{\alpha}}W_{i}(m_{i},t)\simeq\frac{\left<m_{i}\right>^{\alpha}}{\sum_{j=1}^{n}\left<m_{j}\right>^{\alpha}}\simeq\frac{\left\langle m_{i}\right\rangle^{\alpha}}{At^{\xi}}, (S35)

where, similarly to the case of α=1\alpha=1, we a priori assume that jmjαmiα\sum_{j}\left<m_{j}\right>^{\alpha}\gg\left<m_{i}\right>^{\alpha} for any site ii, and we further assume j=1nmjα=Atξ\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>^{\alpha}=At^{\xi} with α<ξ<1\alpha<\xi<1 (to be proved a posteriori, see below). Notably, such a scaling was found to hold in numerical simulations. For initial condition mi(t=t0)=1\left<m_{i}\right>(t=t_{0})=1, Eq. (S35) is solved by

mi[1+(α1)(t1ξti1ξ)A(ξ1)]1/(1α).\left<m_{i}\right>\simeq\left[1+\frac{(\alpha-1)\left(t^{1-\xi}-t_{i}^{1-\xi}\right)}{A(\xi-1)}\right]^{1/(1-\alpha)}. (S36)

Note that the asymptotic scaling of this result at ttit\gg t_{i} depends on the value of ξ\xi, where for ξ<1\xi<1, Eq. (S36) predicts an asymptotic scaling of mit(1ξ)/(1α)[1+𝒪(tξ1)]\left<m_{i}\right>\sim t^{(1-\xi)/(1-\alpha)}[1+\mathcal{O}(t^{\xi-1})], for all sites. Now, as all sites scale similarly with tt, it is evident that jmjαmiα\sum_{j}\left<m_{j}\right>^{\alpha}\gg\left<m_{i}\right>^{\alpha}, thus verifying our initial assumption. Using this solution for mi\left<m_{i}\right>, we find that up to some unknown factor j=1nmjαt1/(1+β)tα(1ξ)/(1α)\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>^{\alpha}\sim t^{1/(1+\beta)}t^{\alpha(1-\xi)/(1-\alpha)}, entailing that ξ=α(1ξ)/(1α)+1/(1+β)=(1+αβ)/(1+β)\xi=\alpha(1-\xi)/(1-\alpha)+1/(1+\beta)=(1+\alpha\beta)/(1+\beta).

In Fig. S3 we show that this prediction agrees with simulations for two different values of β\beta, up to a maximum of 3%3\% relative error. However, we note that this relative error becomes crucial when ξ\xi is substituted back into the scaling mit(1ξ)/(1α)\left<m_{i}\right>\sim t^{(1-\xi)/(1-\alpha)} found above. Let us denote ξ0=(1+αβ)/(1+β)\xi_{0}=(1+\alpha\beta)/(1+\beta) such that ξ=ξ0(1ϵ)\xi=\xi_{0}(1-\epsilon), where ϵ1\epsilon\ll 1 is a small correction that depends on α\alpha and β\beta (see Fig. S3). Substituting ξ\xi into mit(1ξ)/(1α)\left<m_{i}\right>\sim t^{(1-\xi)/(1-\alpha)} one readily obtains (1ξ)/(1α)=β/(1+β)+ξ0ϵ/(1α)(1-\xi)/(1-\alpha)=\beta/(1+\beta)+\xi_{0}\epsilon/(1-\alpha). Here, the approximation is valid only as long as β/(1+β)ϵ/(1α)\beta/(1+\beta)\gg\epsilon/(1-\alpha), or alternatively 1αϵ1-\alpha\ll\epsilon [assuming β=𝒪(1)\beta=\mathcal{O}(1)]. As we numerically find that ϵ=𝒪(101)\epsilon=\mathcal{O}(10^{-1}) this condition is hard to satisfy as α\alpha approaches 1, and in this regime it is preferable to find ξ\xi directly from simulations.

In Fig. S4 we plot the number of visits to the five most visited site for different values of α\alpha. We show that for α<1\alpha<1 all sites converge to the same number of visits, while for α>1\alpha>1 the most visited site diverges from all other sites (see below). All α\alpha values show good agreement with the theory presented above. Similarly, in the bottom panels of S4 we show evidence for our a priori assumption that j=1nmjα=Atξ\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>^{\alpha}=At^{\xi}, again with good agreement to the theory.

Refer to caption
Figure S4: Upper panels: the mean number of visits to the five most visited sites for different values of α\alpha (different colors mark different sites). We fit the most visited site to a power law (blue solid lines, see legend) and plot the theoretical prediction (black dashed line, see legend). Lower panels: measuring ξ\xi from simulations (black crosses), fit (blue solid line) and theory (orange solid line).

S2.3 The case of α>1\alpha>1

Here, in contrast to the previous cases, in the limit of t1t\gg 1 we a priori assume that m1αj=2nmjα\left<m\right>_{1}^{\alpha}\gg\sum_{j=2}^{\left<n\right>}\left<m_{j}\right>^{\alpha}, i.e. at long times the most visited site dominates and contributions from all other sites diminish. We again obtain an equation for the first moment mi\left<m_{i}\right> by multiplying Eq. (S31) by mim_{i} and summing over all mim_{i}:

mitmi=1miαj=1nmjαWi(mi,t){1i=1miαj=1nmjαi>1,\displaystyle\frac{\partial\left<m_{i}\right>}{\partial t}\simeq\sum_{m_{i}=1}^{\infty}\frac{m_{i}^{\alpha}}{\sum_{j=1}^{n}m_{j}^{\alpha}}W_{i}(m_{i},t)\simeq\begin{cases}1&i=1\\ \frac{\left<m_{i}\right>^{\alpha}}{\sum_{j=1}^{n}\left<m_{j}\right>^{\alpha}}&i>1,\end{cases} (S37)

where we have separated the most visited site i=1i=1 from all other sites, in accord with the above assumption. For i=1i=1, Eq. (S37) with initial conditions m1(0)=1m_{1}(0)=1 is solved by m11+tt\left<m_{1}\right>\simeq 1+t\simeq t, i.e. we predict a linear scaling with time. For all other sites we assume that j=1nmjαm1αtα\sum_{j=1}^{\left<n\right>}\left<m_{j}\right>^{\alpha}\simeq\left<m_{1}\right>^{\alpha}\sim t^{\alpha}. Plugging this into Eq. (S37) yields

mi{ti=1const[1+𝒪(t1α)]i>1,\left<m_{i}\right>\simeq\begin{cases}t&i=1\\ \mbox{const}[1+\mathcal{O}(t^{1-\alpha})]&i>1,\end{cases} (S38)

where const(1ti1α)1/(1α)\mbox{const}\sim(1-t_{i}^{1-\alpha})^{1/(1-\alpha)}. Importantly, for α>1\alpha>1 and β>0\beta>0 it follows that α>1/(1+β)\alpha>1/(1+\beta), such that m1αtαt1/(1+β)j=2nmjα\left<m_{1}\right>^{\alpha}\sim t^{\alpha}\gg t^{1/(1+\beta)}\sim\sum_{j=2}^{\left<n\right>}\left<m_{j}\right>^{\alpha}, thus verifying our initial assumption. As discussed in the main text, these results suggest a phase transition at α=1\alpha=1, see Fig. 3 and S5, and the next subsection.

S2.4 Evidence of a phase transition

Here we prove that there is a phase transition at α=1\alpha=1, with no a priori assumptions on the solution (see previous sections). To this end, we define Qi=1nmiαQ\equiv\sum_{i=1}^{\left<n\right>}m_{i}^{\alpha}, so the probability that the most visited site will be visited again in the next time step tt will be p1(t)=m1α/Qp_{1}(t)=m_{1}^{\alpha}/Q, and for any site in general we have pi(t)=miα/Qp_{i}(t)=m_{i}^{\alpha}/Q. Next, we write an expression for the expected value of p1(t)p_{1}(t) in the next time step:

p1(t+1)=m1α+fα(m1)Q+fα(m1)p1(t)+i=2nm1αQ+fα(mi)pi(t),\left<p_{1}(t+1)\right>=\frac{m_{1}^{\alpha}+f_{\alpha}(m_{1})}{Q+f_{\alpha}(m_{1})}p_{1}(t)+\sum_{i=2}^{\left<n\right>}\frac{m_{1}^{\alpha}}{Q+f_{\alpha}(m_{i})}p_{i}(t), (S39)

where we have defined fα(mi)(mi+1)αmiαf_{\alpha}(m_{i})\equiv(m_{i}+1)^{\alpha}-m_{i}^{\alpha}. The first term on the right hand side represents the case for which the most visited site is visited in the next time step t+1t+1, and the second term corresponds to the case where any other site is chosen instead.

In the case α=1\alpha=1 we have f1(mi)=1f_{1}(m_{i})=1 for any mim_{i}. Taking into account that p1(t)=m1α/Qp_{1}(t)=m_{1}^{\alpha}/Q, Eq. (S39) leads after some algebra to p1(t+1)=p1(t)\left<p_{1}(t+1)\right>=p_{1}(t) independently of the specific set of values {mi}\{m_{i}\} we have. Thus, the probability of revisiting the most visited site will be kept constant through time (and the same can be proved for any other site).

For α>1\alpha>1 we note that fα(mi)f_{\alpha}(m_{i}) increases monotonically with mim_{i}. This, together with the fact that p1(t)=1i=2npi(t)p_{1}(t)=1-\sum_{i=2}^{\left<n\right>}p_{i}(t) allow us to write the inequality

p1(t+1)>m1α+fα(m1)Q+fα(m1)p1(t)+m1αQ+fα(m2)(1p1(t)).\left<p_{1}(t+1)\right>>\frac{m_{1}^{\alpha}+f_{\alpha}(m_{1})}{Q+f_{\alpha}(m_{1})}p_{1}(t)+\frac{m_{1}^{\alpha}}{Q+f_{\alpha}(m_{2})}(1-p_{1}(t)). (S40)

Finally, introducing p1(t)=m1α/Qp_{1}(t)=m_{1}^{\alpha}/Q into the previous inequality, after some algebra we obtain

p1(t+1)>[1+(fα(m1)fα(m2)(Qm1α)(Q+fα(m1))(Q+fα(m2))]p1(t).\left<p_{1}(t+1)\right>>\left[1+\frac{(f_{\alpha}(m_{1})-f_{\alpha}(m_{2})(Q-m_{1}^{\alpha})}{(Q+f_{\alpha}(m_{1}))(Q+f_{\alpha}(m_{2}))}\right]p_{1}(t). (S41)

We thus conclude that p1(t+1)>p1(t)\left<p_{1}(t+1)\right>>p_{1}(t) regardless of the specific set {mi}\{m_{i}\} we have. The probability of revisiting the most visited site thus always increases with time on average, leading eventually to its dominance over the others.

For α<1\alpha<1 we proceed in a similar manner. Here, fα(mi)f_{\alpha}(m_{i}) will decrease monotonically with mim_{i}, so we can write

p1(t+1)<[1(fα(m2)fα(m1)(Qm1α)(Q+fα(m1))(Q+fα(m2))]p1(t).\left<p_{1}(t+1)\right><\left[1-\frac{(f_{\alpha}(m_{2})-f_{\alpha}(m_{1})(Q-m_{1}^{\alpha})}{(Q+f_{\alpha}(m_{1}))(Q+f_{\alpha}(m_{2}))}\right]p_{1}(t). (S42)

This leads to p1(t+1)<p1(t)\left<p_{1}(t+1)\right><p_{1}(t), such that for α<1\alpha<1, on average the probability of revisiting the most visited site will decrease with time, thus leading to a much more homogeneous distribution of revisits among all sites available.

Refer to caption
Figure S5: (a) The average frequency of visits to the most visited site f1f_{1} versus α\alpha, for β=0.5\beta=0.5 (simulations). Each curve corresponds to a given number of visits tt (see legend). (b) fkf_{k} for different sites (see legend) for β=0.5\beta=0.5 and t=105t=10^{5}.

S3 Data collection and analysis

The Egyptian fruit bat (Rousettus aegyptiacus, EFB) is a long-lived, widely distributed Old World fruit bat [53]. Like other fruit bats, individual EFBs tend to feed on a small subset of available trees and repeatedly revisit them for weeks and even months [54, 11] affirms that EFBs rely heavily on individual memory. Additionally, it has recently been shown that EFBs obtain a ”cognitive map,” which encompasses information about a large number of tree locations, suggesting that memory expands beyond the trees used at a given time [11]. Bats were tracked at a 0.125Hz sampling rate for an average tracking period of 23.7 nights and up to 131 nights. The data also includes nearly all fruit trees in the study area (14,314 trees and 18,111 orchard trees), which enabled us to identify specific tree visits.

To segment the data into movements and tree visits, we first filtered raw EFB tracks for localization errors based on the covariance matrices attributed to each ATLAS fix [55]. Localization that exceeded the highest realistic speed threshold for this species (20ms\frac{m}{s}) were removed. Visits to trees were defined based on track segmentation using the first-passage algorithm to determine the center of a ”cloud of fixes” where the animal has spent a specified number of observations within a certain radius (for source code and details see https://github.com/ATLAS-HUJI/R/tree/master/ AdpFixedPoint). Finally, the median coordinates of each cloud were related to the closest tree in the dataset.

To make the seasonal classification most relevant for bats’ foraging, we defined winter and summer based on the known peak of fruiting periods of the main seasonal tree species the bats frequently visit in the study area. These are the mulberry (Morus negra) and common fig (Ficus carica) species during May-September (summer) and Chinaberry (Melia azedarach) during November-February (winter). During each fruiting period we used 10 day periods for each bat to ensure sufficient statistics (many of the bats did not have longer tracks during a single season). Based on the field work it is reasonable to assume that during such 10 day periods no significant resource depletion occurs. To fit between the data and the theory we used a standard least square fit procedure from python scipy package.